Abstract
The uniform spanning forest measure () on a locally finite, infinite connected graph with conductance c, is defined as a weak limit of uniform spanning tree measure on finite subgraphs. Depending on the underlying graph and conductances, the corresponding is not necessarily concentrated on the set of spanning trees. Pemantle (Ann. Probab. 19 (1991) 1559–1574) showed that on , equipped with the unit conductance , is concentrated on spanning trees if and only if . In this work we study the associated with conductances , where is the graph distance of the edge e from the origin, and is a fixed parameter. Our main result states that in this case consists of finitely many trees if and only if or 3. More precisely, we prove that the uniform spanning forest has trees if or 3, and infinitely many trees if . Our method relies on the analysis of the spectral radius and the speed of the λ-biased random walk on .
La forêt couvrante uniforme (notée ) sur un graphe connexe, infini et localement fini avec conductance , est définie comme la loi limite de l’arbre couvrant uniforme de sous-graphes finis. Suivant le graphe et les conductances, la mesure ne porte pas nécessairement sur l’ensemble des arbres couvrants. Pemantle (Ann. Probab. 19 (1991) 1559–1574) a démontré que sur muni de la conductance unité , porte sur les arbres couvrants si et seulement si . Dans ce travail, nous étudions associée aux conductances , où est la distance entre l’arête e et l’origine, et est un paramètre fixé. Notre résultat principal montre que dans ce cas, porte sur un nombre fini d’arbres si et seulement si ou 3. Plus précisément, nous prouvons que la forêt couvrante uniforme contient arbres si ou 3, et contient une infinité d’arbres si . Notre approche s’appuie sur une analyse du rayon spectral et de la vitesse de la marche aléatoire λ-biaisée sur .
Acknowledgements
The authors would like to thank an anonymous referee for valuable comments and suggestions to improve the quality of the paper, and to significantly simplify the proofs of Theorem 2.1 and Lemma 3.4. Part of the work has been done while Z. Shi, L. Wang and K. Xiang were visiting the NYU Shanghai – ECNU Mathematical Institute. They are deeply grateful to the Institute for hospitality and financial support. H. Song’s research is supported partially by the Natural Science Foundation of Jiangsu Higher Education Institutions of China (No. 60620196003) and by Xiang Yu Ying Cai (No. 31SH002). K. Xiang’s research is supported partially by National Natural Science Foundation of China (Nos. 11671216, 11871032) and by Hu Xiang Gao Ceng Ci Ren Cai Ju Jiao Gong Cheng-Chuang Xin Ren Cai (No. 2019RS1057).
Citation
Zhan Shi. Vladas Sidoravicius. He Song. Longmin Wang. Kainan Xiang. "Uniform spanning forests on biased Euclidean lattices." Ann. Inst. H. Poincaré Probab. Statist. 57 (3) 1569 - 1582, August 2021. https://doi.org/10.1214/20-AIHP1119
Information