Local limits of random spanning trees in random environment
Luca Makowiec

TL;DR
This paper investigates the local limits and edge overlap of random spanning trees in a weighted environment on complete graphs, revealing phase transitions depending on the parameter eta.
Contribution
It characterizes the phase transition in local limits and edge overlap of RSTRE as eta varies with respect to the graph size n.
Findings
Edge overlap is approximately eta for small eta
Edge overlap approaches n for large eta
Local limit transitions from uniform spanning tree to minimum spanning tree around eta n
Abstract
We study the edge overlap and local limit of the random spanning tree in random environment (RSTRE) on the complete graph with vertices and weights given by for uniformly distributed on . We show that for growing with , the edge overlap is , while for much larger than , the edge overlap is . Furthermore, there is a transition of the local limit around . When the RSTRE locally converges to the same limit as the uniform spanning tree, whereas for larger than , where arbitrarily slowly, the local limit of the RSTRE is the same as that of the minimum spanning tree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Topological and Geometric Data Analysis · Data Management and Algorithms
