Sur le nombre de points visités par une marche aléatoire sur un amas infini de percolation
Clement Rau
Abstract
In this article, we consider random walk on the infinite cluster of bond percolation on d (d ≥ 2). We show that the Laplace transformation of the number of visited points N\n, has a behaviour as the random walk was on d. More precisely, for all 0<α<1, we proved that there exist constants C\i and C\s such that for all infinite cluster that contains the origin, we have: e-C\i ndd+2 ≤ \0ω (αN\n) ≤ e-C\sndd+2. Our approach is based on finding an isoperimetric inequalities on the infinite cluster, lifted on a wreath product which give good behaviour. The problem of the isoperimetry on wreath product was already raised by A.Ershler.
Create a lesson
Related papers
Shannon's problem on the monotonicity of entropy and a Conjecture of Tao
Ziran Liu
Extinction, Survival and Fluctuations for the Spatial Maki--Thompson Model on Infinite Graphs
Luciano Henrique Lacerda de Araújo, Daniel Miranda Machado, Cristian Favio Coletti et al.
Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs
Partha S. Dey, Daecheol Kim
Colorful Exponential Random Graph Models
Bhaswar B. Bhattacharya, Pierfrancesco Dionigi, Ankan Ganguly et al.
On (fake) Stationarity in Stochastic Volterra Equations with Affine Drift and Regular Kernels
Emmanuel Gnabeyeu, Gilles Pagès
Limit Laws of the Iterated Logarithm Under Sub-linear Expectations
Li-Xin Zhang, Yongsheng Song