ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \bmathbbG∞\bmathbb{G}_\infty be a fixed graph of uniformly bounded degrees on which simple random walk is recurrent, and let \bmathbbGt\bmathbb{G}_t be non-decreasing subgraphs with \bmathbbGt↑\bmathbbG∞\bmathbb{G}_t\uparrow\bmathbb{G}_\infty. Fixed-graph recurrence conjecture. Simple random walk on \bmathbbGt\bmathbb{G}_t is recurrent for any choice of such non-decreasing \bmathbbGt\bmathbb{G}_t. 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 \bmathbbZ2\bmathbb{Z}^2. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.