SearcharxivSearch

arXiv · 2112.11757

Some characterizations for Markov processes at first passage

Abstract

Suppose $X$ is a Markov process on the real line (or some interval). Do the distributions of its first passage times downwards (fptd) determine its law? In this paper we treat some special cases of this question. We prove that if the fptd process has the law of a subordinator, then necessarily $X$ is a L\'evy process with no negative jumps; specifying the law of the subordinator determines the law of $X$ uniquely. We further show that, likewise, the classes of continuous-state branching processes and of self-similar processes without negative jumps are also respectively characterised by a certain structure of their fptd distributions; and each member of these classes separately is determined uniquely by the precise family of its fptd laws. The road to these results is paved by (i) the identification of Markov processes without negative jumps in terms of the nature of their fptd laws, and (ii) some general results concerning the identification of the fptd distributions for such processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Matija Vidmar. 2021-12-22. Some characterizations for Markov processes at first passage. https://arxiv.org/abs/2112.11757

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR