SearcharxivSearch

arXiv · 2602.16838

Ray-Knight theorems for the local times of rebirthed Markov processes

Abstract

We prove generalizations of the first and second Ray-Knight theorems, for a large class of non-symmetric strong Markov processes. These results link the local times of the Markov process with the squares of associated Gaussian processes. This connection allows us to establish results about the exact modulus of continuity (in the spatial variable) of the local times. Our approach is different from earlier treatments which were based on associated permanental processes rather than Gaussian processes. The type of process with which we work can be described as follows. Start with a symmetric Markov process with finite lifetime; upon its death resurrect it at a place in the state space chosen at random, independent of the past. Continue in this way, resurrecting at each death, to obtain a recurrent process. The rebirthing procedure destroys the symmetry of the original process, leading to a large class of non-symmetric processes. The main results are illustrated by many examples.

Explore related subjects

Keep this discovery

BibTeXRIS

P. J. Fitzsimmons, Jay Rosen. 2026-02-18. Ray-Knight theorems for the local times of rebirthed Markov processes. https://arxiv.org/abs/2602.16838

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