logo AFST
Occupation measure of random walks and wired spanning forests in balls of Cayley graphs
Annales de la Faculté des sciences de Toulouse : Mathématiques, Série 6, Tome 29 (2020) no. 1, pp. 97-109.

On montre que toute marche aléatoire symétrique à pas bornés sur un graphe de Cayley transitoire satisfait que l’espérance du temps d’occupation d’une boule quelconque de rayon r vaut O(r 5/2 ). On étudie aussi la croissance du volume des forêts recouvrantes câblées dans les graphes de Cayley généraux, en montrant que l’espérance du nombre de sommets appartenant à la composante connexe de l’identité dans une boule quelconque de rayon r vaut O(r 11/2 ).

We show that for finite-range, symmetric random walks on general transient Cayley graphs, the expected occupation time of any given ball of radius r is O(r 5/2 ). We also study the volume-growth property of the wired spanning forests on general Cayley graphs, showing that the expected number of vertices in the component of the identity inside any given ball of radius r is O(r 11/2 ).

Reçu le :
Accepté le :
Publié le :
DOI : 10.5802/afst.1625
Russell Lyons 1 ; Yuval Peres 2 ; Xin Sun 3 ; Tianyi Zheng 4

1 Department of Mathematics, IndianaUniversity
2 Redmond, WA
3 Department of Mathematics, Columbia University
4 Department of Mathematics, UCSD
Licence : CC-BY 4.0
Droits d'auteur : Les auteurs conservent leurs droits
@article{AFST_2020_6_29_1_97_0,
     author = {Russell Lyons and Yuval Peres and Xin Sun and Tianyi Zheng},
     title = {Occupation measure of random walks and wired spanning forests in balls of {Cayley} graphs},
     journal = {Annales de la Facult\'e des sciences de Toulouse : Math\'ematiques},
     pages = {97--109},
     publisher = {Universit\'e Paul Sabatier, Toulouse},
     volume = {Ser. 6, 29},
     number = {1},
     year = {2020},
     doi = {10.5802/afst.1625},
     language = {en},
     url = {https://afst.centre-mersenne.org/articles/10.5802/afst.1625/}
}
TY  - JOUR
AU  - Russell Lyons
AU  - Yuval Peres
AU  - Xin Sun
AU  - Tianyi Zheng
TI  - Occupation measure of random walks and wired spanning forests in balls of Cayley graphs
JO  - Annales de la Faculté des sciences de Toulouse : Mathématiques
PY  - 2020
SP  - 97
EP  - 109
VL  - 29
IS  - 1
PB  - Université Paul Sabatier, Toulouse
UR  - https://afst.centre-mersenne.org/articles/10.5802/afst.1625/
DO  - 10.5802/afst.1625
LA  - en
ID  - AFST_2020_6_29_1_97_0
ER  - 
%0 Journal Article
%A Russell Lyons
%A Yuval Peres
%A Xin Sun
%A Tianyi Zheng
%T Occupation measure of random walks and wired spanning forests in balls of Cayley graphs
%J Annales de la Faculté des sciences de Toulouse : Mathématiques
%D 2020
%P 97-109
%V 29
%N 1
%I Université Paul Sabatier, Toulouse
%U https://afst.centre-mersenne.org/articles/10.5802/afst.1625/
%R 10.5802/afst.1625
%G en
%F AFST_2020_6_29_1_97_0
Russell Lyons; Yuval Peres; Xin Sun; Tianyi Zheng. Occupation measure of random walks and wired spanning forests in balls of Cayley graphs. Annales de la Faculté des sciences de Toulouse : Mathématiques, Série 6, Tome 29 (2020) no. 1, pp. 97-109. doi : 10.5802/afst.1625. https://afst.centre-mersenne.org/articles/10.5802/afst.1625/

[1] Itai Benjamini; Harry Kesten; Yuval Peres; Oded Schramm Geometry of the uniform spanning forest: transitions in dimensions 4,8,12,, Ann. Math., Volume 160 (2004) no. 2, pp. 465-491 | DOI | MR | Zbl

[2] Itai Benjamini; Russell Lyons; Yuval Peres; Oded Schramm Uniform spanning forests, Ann. Probab., Volume 29 (2001) no. 1, pp. 1-65 | DOI | MR | Zbl

[3] Sébastien Blachère; Sara Brofferio Internal diffusion limited aggregation on discrete groups having exponential growth, Probab. Theory Relat. Fields, Volume 137 (2007) no. 3-4, pp. 323-343 | DOI | MR | Zbl

[4] Emmanuel Breuillard; Ben Green; Terence Tao The structure of approximate groups, Publ. Math., Inst. Hautes Étud. Sci., Volume 116 (2012), pp. 115-221 | DOI | MR | Zbl

[5] Thierry Coulhon; Alexander Grigor’yan; Christophe Pittet A geometric approach to on-diagonal heat kernel lower bounds on groups, Ann. Inst. Fourier, Volume 51 (2001) no. 6, pp. 1763-1827 | DOI | MR | Zbl

[6] Mikhael Gromov Groups of polynomial growth and expanding maps, Publ. Math., Inst. Hautes Étud. Sci., Volume 53 (1981), pp. 53-73 | DOI | Numdam | Zbl

[7] Harry Kesten Full Banach mean values on countable groups, Math. Scand., Volume 7 (1959), pp. 146-156 | DOI | MR | Zbl

[8] Harry Kesten Symmetric random walks on groups, Trans. Am. Math. Soc., Volume 92 (1959), pp. 336-354 | DOI | MR | Zbl

[9] Nicholas J. Korevaar; Richard M. Schoen Global existence theorems for harmonic maps to non-locally compact spaces, Commun. Anal. Geom., Volume 5 (1997) no. 2, pp. 333-387 | DOI | MR | Zbl

[10] Gregory F. Lawler Intersections of random walks, Modern Birkhäuser Classics, Birkhäuser/Springer, New York, 2013 (reprint of the 1996 edition) | Zbl

[11] James R. Lee; Yuval Peres Harmonic maps on amenable groups and a diffusive lower bound for random walks, Ann. Probab., Volume 41 (2013) no. 5, pp. 3392-3419 | MR | Zbl

[12] James R. Lee; Yuval Peres; Charles K. Smart A Gaussian upper bound for martingale small-ball probabilities, Ann. Probab., Volume 44 (2016) no. 6, pp. 4184-4197 | MR

[13] Russell Lyons; Shayan Oveis Gharan Sharp bounds on random walk eigenvalues via spectral embedding, Int. Math. Res. Not., Volume 2018 (2017) no. 24, pp. 7555-7605 | DOI | Zbl

[14] Russell Lyons; Yuval Peres Probability on trees and networks, Cambridge Series in Statistical and Probabilistic Mathematics, 42, Cambridge University Press, 2016 | MR | Zbl

[15] Ngaiming Mok Harmonic forms with values in locally constant Hilbert bundles, Proceedings of the Conference in Honor of Jean-Pierre Kahane (Orsay, 1993) (Journal of Fourier Analysis and Applications, Special Issue) (1995), pp. 433-453 | Zbl

[16] Robin Pemantle Choosing a spanning tree for the integer lattice uniformly, Ann. Probab., Volume 19 (1991) no. 4, pp. 1559-1574 | DOI | MR | Zbl

[17] David Bruce Wilson Generating random spanning trees more quickly than the cover time, Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996) (1996), pp. 296-303 | DOI | MR | Zbl

Cité par Sources :