One-endedness of essential spanning-forest components in high dimensions
Statement
Let be the infinite nearest-neighbor graph on the integer lattice in dimensions, and let be the uniform spanning forest obtained as a distributional limit of uniform spanning trees on -dimensional -tori as . One-endedness conjecture. If , then with probability one each component of the essential spanning forest has only one path to infinity; equivalently, any two infinite paths in a component eventually merge.
This is presented as an open problem because the limiting object in dimensions five and higher is an essential spanning forest rather than a spanning tree of the lattice. The corresponding one-path-to-infinity property is stated earlier for the uniform random spanning tree in dimensions two, three, and four.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.