Sharp vacant-set transition on uniformly transient transitive graphs
Statement
Let be finite transitive graphs with and uniformly bounded effective resistances between all vertex pairs. Prove that the largest vacant component left by simple random walk drops from order to before time , for a fixed , in a transition window of width .
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.