Scaling-limit conjecture for the canonical evaporated UST component
Scaling-limit conjecture for the canonical evaporated UST component
Let be a rooted uniform spanning tree of a graph, and obtain by successively removing outgoing edges at independent uniformly chosen non-root vertices until the component containing first has size less than . For a tree of diameter smaller than the torus side, let denote its canonical embedding in . The evaporated-tree scaling conjecture. If is a sequence of integers satisfying and , then
converges in distribution, for the Hausdorff metric on compact subsets of , to a limiting compact set with Lebesgue measure that is simply connected. The conjecture predicts that repeated edge evaporation does not lose macroscopic area in the scaling limit; the motivation given is that simulations show most removals discard only very small components. No proof or resolution is supplied.
Sources & referencesView supporting material
Primary source
Luis Fredes and Jean-Francois Marckert, “Models of random subtrees of a graph”, arXiv:2102.12738 (2023).
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
Sign in to submit a solution.
No solutions have been posted yet.