arXiv (All)
open access
Graphs with Minimum Algebraic Connectivity II: Regular Graphs of Even Degree
Aldous and Fill (2002) conjectured the asymptotic maximum relaxation time of a random walk on a connected regular graph. Since the relaxation time of a $d$-regular graph $G$ is $d/μ(G)$, where $μ(G)$ denotes its algebraic connectivity, this conjecture is closely related to the problem of minimizing
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Trimers, pairs and localisation on disordered random graphs#1117099
- An inverse problem for fractional random walks on finite graphs#131242
- Tree walks and the spectrum of random graphs#652722
- PageRank on Lubotzky--Phillips--Sarnak graphs#1154732
- Recurrence and capacity of stable branching random walks#818723
Record · ID 1062586
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive