Aldous–Fill and Guiduli–Mohar conjectures on minimum algebraic connectivity
Statement
Let denote the relaxation time of the simple random walk on a connected regular graph with vertices. Aldous and Fill conjectured that, as , and that asymptotic equality holds for even . Equivalently, for a -regular graph, since where is the algebraic connectivity, this predicts the corresponding extremal behavior for the minimum algebraic connectivity among connected regular graphs.
Record
- 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.