Expander and wired-tree local-limit conjecture for the minimum spanning algorithm
Let be an expander sequence converging locally to the -regular tree. Consider the local limits associated with item c., a sequence of -regular expanders with vertices, and item d., a -regular tree of height whose leaves are glued or wired together, both with i.i.d. continuously distributed weights with positive support. Expander–wired-tree local-limit conjecture. The local limit for the expander sequence in item c. matches the local limit for the wired -regular-tree sequence in item d. This is posed as a natural extension of the main theorem to other graph classes; the existence of a local limit for the wired-tree case with i.i.d. Exponential weights is stated to be known, but a more detailed description and the claimed identification with the expander limit remain open.
References
- Swarnadeep Bagchi and Gourab Ray, “Oriented Minimum spanning tree looks like the Uniform spanning tree on the complete graph (at least locally)”, arXiv:2607.25428 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.