Random spanning trees in random environment
Luca Makowiec, Michele Salvi, Rongfeng Sun

TL;DR
This paper introduces a new model called the random spanning tree in random environment (RSTRE) that interpolates between uniform and minimum spanning trees, analyzing its properties across different disorder regimes.
Contribution
The paper defines RSTRE, explores its behavior in low and high disorder regimes, and conjectures about its properties in intermediate regimes.
Findings
In low disorder, the diameter is typically of order n^{1/2}.
In high disorder, the diameter is typically of order n^{1/3}.
The model interpolates between uniform and minimum spanning trees.
Abstract
We introduce a new spanning tree model called the random spanning tree in random environment (RSTRE), which interpolates between the uniform spanning tree and the minimum spanning tree as the inverse temperature (disorder strength) varies. On the complete graph with vertices and i.i.d.\ uniform disorder variables on the edges, we identify: (1) a low disorder regime with , where the diameter of the random spanning tree is typically of order , the same as for the uniform spanning tree; (2) a high disorder regime with , where the diameter is typically of order , the same as for the minimum spanning tree. We conjecture that for with , the diameter is of order for some strictly between and .
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
TopicsData Management and Algorithms · Data Mining Algorithms and Applications · Advanced Clustering Algorithms Research
