Fixed-graph recurrence conjecture for simple random walk on growing subgraphs
Statement
Let be a fixed graph of uniformly bounded degrees on which simple random walk is recurrent, and let be non-decreasing subgraphs with . Fixed-graph recurrence conjecture. Simple random walk on is recurrent for any choice of such non-decreasing . This is presented as a consequence of the monotonicity conjecture and would imply recurrence for simple random walk on every non-decreasing subgraph evolution in . The claim remains open in the source.
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.