arXiv (All)
open access
Repeated averaging on expanders I: random $d$-regular graph
Repeated averaging on graphs is a natural prototype of local stochastic exchange, modeling consensus formation, information spreading, and wealth redistribution. Its convergence has attracted longstanding interest, from Bourgain's complete-graph $L^1$ cutoff question in the 80s (answered in recent y
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
- Weak error on the densities for the Euler scheme of stable additive SDEs with Hölder drift#11562
- Discounted Hitting Domination on Graphs with Submodularity, Complexity and Exact Algorithms#1106234
- Central limit theorems for the Euler characteristic in the Random Connection Model for higher-dimensional simplicial complexes#792635
- Central limit theorems for the Euler characteristic in the Random Connection Model for higher-dimensional simplicial complexes#788635
- Sim-Width, Induced Matching Treewidth, and Tree-Independence Number in Induced $K_{t,t}$-Free Graphs#1012820
Record · ID 1061363
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