← All problems

Phase-transition conjecture for connectedness of the weighted free uniform spanning forest

6 years old · traced to

Let HH) be a finite connected graph and let Td\mathbb{T}^d be the dd-regular tree. For w>0w>0, define the edge-weight function w^\hat w on G=Td□HG=\mathbb{T}^d\square H by assigning weight 11 to edges within the tree direction and weight ww to edges within the HH-copies. Write FSFw(G)\mathsf{FSF}_w(G) for the free uniform spanning forest of (G,w^)(G,\hat w). Phase-transition conjecture. If FSFw′\mathsf{FSF}_{w'} and FSFw”\mathsf{FSF}_{w”} are connected for some w”>w′>0w”>w'>0, then FSFw\mathsf{FSF}_w is connected for every w∈[w′,w”]w\in[w',w”]; the analogous statement holds for disconnectedness. Moreover, there exists γ∈[0,∞]\gamma\in[0,\infty] such that FSFw\mathsf{FSF}_w has a unique component whenever w>γw>\gamma, and infinitely many components whenever w<γw<\gamma. The conjecture describes the expected monotone phase transition in the connectedness of the weighted free uniform spanning forest; the supplied text does not indicate whether it has been resolved.

References
  1. Marcell Alexy, Márton Borbényi, András Imolay and Ádám Timár, “Connectedness of the Free Uniform Spanning Forest as a function of edge weights”, arXiv:2011.12904 (2020).

Progress summary

Never refreshed

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.