The number of spanning clusters of the uniform spanning tree in three dimensions

DOI10.2969/aspm/08710403zbMath1486.05139arXiv2003.04548OpenAlexW3010649430MaRDI QIDQ2119924

Omer Angel, Sarai Hernandez-Torres, David A. Croydon, Daisuke Shiraishi

Publication date: 30 March 2022

Full work available at URL: https://arxiv.org/abs/2003.04548

zbMATH Keywords

random subgraphuniform spanning treespanning clusters

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree
• Choosing a spanning tree for the integer lattice uniformly
• On Brownian motion, simple paths, and loops
• SLE as a mating of trees in Euclidean geometry
• Scaling limits of the three-dimensional uniform spanning tree and associated random walk
• On the number of incipient spanning clusters
• Probability on Trees and Networks
• The number of incipient spanning clusters in two-dimensional percolation

This page was built for publication: The number of spanning clusters of the uniform spanning tree in three dimensions