Random-walk displacement on circle-packed doubling graphs
Statement
In the circle-packed planar-doubling setting of Section 7, prove that the expected distance of simple random walk from its root at time is at most for some . Is the optimal exponent when volume grows like ?
Record
- Source
- Added
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.