ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let τ(G)\tau(G) denote the relaxation time of the simple random walk on a connected regular graph GG with nn vertices. Aldous and Fill conjectured that, as n→∞n\to\infty, max⁡G connected and regular |V(G)|=nτ(G)≤(1+o(1))3n22π2,\max_{\substack{G\text{ connected and regular\\ |V(G)|=n}}}\tau(G)\le (1+o(1))\frac{3n^2}{2\pi^2}, and that asymptotic equality holds for even nn. Equivalently, for a dd-regular graph, since τ(G)=d/μ(G)\tau(G)=d/\mu(G) where μ(G)\mu(G) is the algebraic connectivity, this predicts the corresponding extremal behavior for the minimum algebraic connectivity among connected regular graphs.

Record

Added
Links

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.