arXiv (All)
open access
The Maximum Commute Time of Regular Graphs
For a connected simple regular graph $G$, let $τ(G)$ be the maximum commute time for simple random walk, and let $t_n$ be the maximum of $τ(G)$ over all such graphs of order $n$. Aldous and Fill conjectured that $t_n\sim3n^2/2$. We determine $t_n$ exactly and classify all maximizers for every even $
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
- On Edge Coloring of Multigraphs#1082904
- Quantitative homogenization of the maximal action of curves in a Brownian potential#986242
- Jacobi Endpoint Pencils and Sharp Interlacing for Centered Binomial Samples#1356149
- Reversing the Mostar line-graph inequality with long pendant paths#1155764
- On Chen's conjecture for the log-concavity of the longest increasing subsequence distribution#1343751
Record · ID 1400618
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