Theory of minimum spanning trees I: Mean-field theory and strongly disordered spin-glass model
T. S. Jackson, N. Read

TL;DR
This paper develops a mean-field theory for the random minimum spanning tree problem, revealing a critical dimension of six and implications for the strongly-disordered spin-glass model's ground states.
Contribution
It provides an exact solution for the random MST on the Bethe lattice and clarifies the critical dimension, correcting previous estimates and connecting to spin-glass models.
Findings
Fractal dimension D=6 for connected components on Bethe lattice
Critical dimension for ground state multiplicity is d=6
Results apply to mean-field models and Euclidean space
Abstract
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider the random MST, in which the edge costs are (quenched) independent random variables. There is a strongly-disordered spin-glass model due to Newman and Stein [Phys. Rev. Lett. 72, 2286 (1994)], which maps precisely onto the random MST. We study scaling properties of random MSTs using a relation between Kruskal's greedy algorithm for finding the MST, and bond percolation. We solve the random MST problem on the Bethe lattice (BL) with appropriate wired boundary conditions and calculate the fractal dimension D=6 of the connected components. Viewed as a mean-field theory, the result implies that on a lattice in Euclidean space of dimension d, there are of…
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.
