arXiv (All)
open access
The maximum relaxation time of a random walk on regular graphs
We determine the asymptotic maximum relaxation time of simple random walk on connected simple regular graphs of a given order. The leading constant depends on the parity of the order: cubic graphs are asymptotically extremal at even orders, whereas quartic graphs are asymptotically extremal at odd o
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
- Higher-Order Fluctuations of the Log-Partition Function for Ising Models on Inhomogeneous Random Graphs#1156570
- Ratios of partition functions for the log-gamma polymer#954808
- Universal Degenerate-Mobility Scaling in Crowded Soft Matter#99432
- The geometric control of boundary-catalytic branching processes#1120714
- Log canonical thresholds of high multiplicity reduced plane curves#821647
Record · ID 974905
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