Spectral stability conjecture for simple random walks on complete graphs
Statement
For , let be the non-lazy simple random walk on the unmixed complete graph , and let be the corresponding linearized curvature-flow matrix.
Complete-graph spectral conjecture. The simple random walk is asymptotically stable, and the eigenvalues of are
As , these eigenvalues tend respectively to , (with ), and . Numerical verification is reported for , while the general assertion remains open.
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.