Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Markov Processes And Related Fields Année : 2016

Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d

Résumé

We consider simple random walks on random graphs embedded in R-d and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we show an annealed invariance principle for these random walks. These results hold for a large variety of point processes including Poisson point processes, Matern cluster and Matern hardcore processes which have respectively clustering and repulsiveness properties. The proof relies on the use the process of the environment seen from the particle. It allows to reconstruct the original process as an additive functional of a Markovian process under the annealed measure.
Fichier non déposé

Dates et versions

hal-01493031 , version 1 (20-03-2017)

Identifiants

  • HAL Id : hal-01493031 , version 1

Citer

Arnaud Rousselle. Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d . Markov Processes And Related Fields, 2016, 22 (4), pp.653-696. ⟨hal-01493031⟩
114 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More