The local limit of uniform spanning trees

[1]  N. Alon,et al.  The diameter of the uniform spanning tree of dense graphs , 2020, Comb. Probab. Comput..

[2]  Asaf Nachmias.  Planar Maps, Random Walks and Circle Packing , 2018, Lecture Notes in Mathematics.

[3]  Asaf Nachmias,et al.  The diameter of uniform spanning trees in high dimensions , 2019, Probability theory and related fields.

[4]  J. Hladký,et al.  The Local Limit of the Uniform Spanning Tree on Dense Graphs , 2017, 1711.09788.

[5]  Y. Peres,et al.  Probability on Trees and Networks , 2017 .

[6]  Sara van de Geer,et al.  Ecole d'été de probabilités de Saint-Flour XLV , 2016 .

[7]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[8]  D. Aldous,et al.  Processes on Unimodular Random Networks , 2006, math/0603062.

[9]  I. Benjamini,et al.  Recurrence of Distributional Limits of Finite Planar Graphs , 2000, math/0011019.

[10]  Russell Lyons,et al.  Conceptual proofs of L log L criteria for mean behavior of branching processes , 1995 .

[11]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[12]  Geoffrey Grimmett,et al.  Random labelled trees and their branching networks , 1980 .

[13]  G. Stewart.  On the Continuity of the Generalized Inverse , 1969 .

[14]  C. Nash-Williams,et al.  Random walk and electric currents in networks , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[15]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .