The local limit of weighted spanning trees on balanced networks
\'Agnes K\'usz

TL;DR
This paper establishes the local limit of weighted spanning trees on high degree networks as a Poisson(1) branching process, explores phase transitions in a model interpolating between uniform and minimum spanning trees, and advances understanding of local and global properties.
Contribution
It generalizes previous results to high degree almost regular networks, characterizes phase transitions in weighted spanning trees, and refines the understanding of local limits and structural sensitivity.
Findings
The local limit is a Poisson(1) branching process conditioned to survive.
A phase transition in local limit and edge overlaps is identified for high degree almost balanced graphs.
Expected total length of WSTs is sensitive to the global structure of the graphs.
Abstract
We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and closing a gap in their proof. We also study the local statistics of the WST's on high degree almost balanced sequences, which is interesting even for the uniform spanning trees. Our motivation comes from studying an interpolation between UST(G) and MST(G) by WST's on a one-parameter family of random environments. This model has recently been introduced in [MSS24, K\'us24], and the phases of several properties have been determined on the complete graphs. We show a phase transition of regarding the local limit and expected edge overlaps for high degree almost balanced…
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 · Complex Network Analysis Techniques · Random Matrices and Applications
