Sur le nombre de points visit\'es par une marche al\'eatoire sur un amas infini de percolation
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.