The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
\'Agnes K\'usz

TL;DR
This paper introduces a model of weighted spanning trees on complete graphs that interpolates between uniform and minimum spanning trees, analyzing phase transitions and the global geometry, especially the diameter growth, as the model parameter varies.
Contribution
It defines a new interpolating model of weighted spanning trees on complete graphs and characterizes phase transitions and diameter growth behavior across different regimes of the model parameter.
Findings
Diameter grows like Θ(n^{1/3}) for large β_n, similar to MST.
Diameter grows like Θ(n^{1/2}) for small β_n, similar to UST.
Identifies phase transition thresholds for algorithm agreement and edge similarity.
Abstract
We introduce as the weighted spanning tree of the complete graph w.r.t. the random electric network of conductances with i.i.d. 's. Moving from to faster and faster growing 's, the model interpolates between the \emph{uniform} and the \emph{minimum} spanning trees: , and there are phase transitions for behaving more and more like : - around regarding the agreement of the two standard algorithms generating these models : Aldous-Broder and Prim's invasion algorithms, - around regarding the models consisting of exactly the same edges, and - around regarding the expected total length…
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 · Graph theory and applications · Complex Network Analysis Techniques
