English

The local limit of weighted spanning trees on balanced networks

Probability 2026-01-01 v1 Combinatorics

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 {WSTβ(G)}β[0,)\{\mathsf{WST}^{\beta}(G)\}_{\beta\in [0, \infty)} 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 WSTβn(Gn)\mathsf{WST}^{\beta_n}(G_n) regarding the local limit and expected edge overlaps for high degree almost balanced graph sequences GnG_n, without any structural assumptions on the graphs; while the expected total length is sensitive to the global structure of the graphs. Our general framework results in a better understanding even in the case of complete graphs, where it narrows the window of the phase transition of [Mak24].

Keywords

Cite

@article{arxiv.2512.25001,
  title  = {The local limit of weighted spanning trees on balanced networks},
  author = {Ágnes Kúsz},
  journal= {arXiv preprint arXiv:2512.25001},
  year   = {2026}
}

Comments

39 pages; Section 3 supersedes and partly overlaps with some parts of arXiv:2410.18269v2