arXiv (All)
open access
A counterexample to a mixing-time conjecture for repeated averages on graphs
The repeated averages process is a stochastic averaging process on graphs whose mixing time is known for several structured families, but no general sharp expression is known for all connected graphs. It was conjectured that the $L^2\!\to\!L^1$ mixing time is of order $|E|\log n/λ_2$. We disprove th
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
- Random independent sets and local sparsity#927922
- Forking in locally o-minimal structures (Model theoretic aspects of the notion of independence and dimension)#625645
- Forking in locally o-minimal structures (Model theoretic aspects of the notion of independence and dimension)#625622
- Slow activity decay in excitable models with discontinuous phase transitions#1070318
- Neighbour-count dependent thinning of Poisson processes: correlation structure and Poisson approximation#1052043
Record · ID 1035181
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