The update-stable zero-one conjecture for wired and free spanning forests
Statement
Let be an infinite network, and let be either the wired or free spanning forest of . A Borel set is update-stable if, for every oriented edge of , the updated forest belongs to if and only if belongs to almost surely.
Update-stable zero-one conjecture. For every update-stable Borel set , the probability that belongs to is either zero or one.
A positive solution would yield an alternative proof that the number of excessive ends of the wired or free uniform spanning forest is nonrandom, and would also imply a positive solution to Question 15.7 of Benjamini, Lyons, Peres, and Schramm.
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.