SearcharxivSearch

arXiv · 2407.10685

Asymptotics of Green functions for Markov-additive processes: an approach via dyadic splitting of integrals

Abstract

We consider a discrete Markov-additive process, that is a Markov chain on a state space $\mathbb{Z}^d \times E$ with invariant jumps along the $\mathbb{Z}^d$ component. In the case where the set $E$ is finite, we derive an asymptotic equivalent of the Green function of the process, providing a new proof of a result obtained by Dussaule in 2020. This result generalizes the famous theorem of Ney and Spitzer of 1966, that deals with the sum of independent and identically distributed random variables, to a spatially non-homogeneous case. In this new proof, we generalize the arguments used in Woess's book Random Walks on Infinite Graphs and Groups to prove Ney and Spitzer's theorem, that consists in establishing an integral formula of the Green function from which we get the asymptotic equivalent. To do so, we use techniques developed by Babillot. In particular, we use dyadic splitting of integrals, a powerful Fourier analysis tool that enables us to control the Fourier transform of a function that has a singularity at the origin.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Théo Ballu. 2024-07-15. Asymptotics of Green functions for Markov-additive processes: an approach via dyadic splitting of integrals. https://arxiv.org/abs/2407.10685

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