Local Limit Theorem for Additive Processes on $\mathbb Z^d$ with Null Recurrent Internal Markov Chain - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Applied Probability Année : 2022

Local Limit Theorem for Additive Processes on $\mathbb Z^d$ with Null Recurrent Internal Markov Chain

Résumé

In the classical framework, a random walk on a group is a Markov chain with independent and identically distributed increments. In some sense, random walks are time and space homogeneous. This paper is devoted to a class of inhomogeneous random walks on $\mathbb Z^d$ termed Markov Additive processes (also known as Markov Random Walks, Random Walks with Internal Degree of Freedom or semi-Markov Processes). In this model, the increments of the walk are still independent but their distributions are dictated by a Markov chain termed the internal Markov chain. Whereas this model is largely studied in the literature, most of the results involve internal Markov chains whose operator is quasi-compact. This paper extends two results for more general internal operators: a Local Limit Theorem and a sufficient criterion for their transience. These results are thereafter applied to a new family of models of drifted random walks on the lattice $\mathbb Z^d$.
Fichier principal
Vignette du fichier
map-llt.pdf (375.53 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01274873 , version 1 (16-02-2016)
hal-01274873 , version 2 (12-05-2016)
hal-01274873 , version 3 (13-06-2016)
hal-01274873 , version 4 (18-01-2018)
hal-01274873 , version 5 (07-08-2020)
hal-01274873 , version 6 (22-06-2022)

Licence

Identifiants

Citer

Basile de Loynes. Local Limit Theorem for Additive Processes on $\mathbb Z^d$ with Null Recurrent Internal Markov Chain. Journal of Applied Probability, 2022, 60 (2), pp.570-588. ⟨10.1017/jpr.2022.73⟩. ⟨hal-01274873v6⟩

Collections

GENES CREST ENSAI
622 Consultations
473 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More