arXiv (All)
open access
Consensus time for asynchronous $\ell^p$ relaxation: graph dependence
We study the asynchronous $\ell^p$ relaxation introduced by Amir, Nazarov, and Peres: at each step, a uniformly chosen vertex minimizes its incident $\ell^p$ energy. For the profile $f_t$ after $t$ updates, let $$ \mathsf T_p(G,1/2):= \sup_{\lVert f_0\rVert_\infty\le1} \mathbb{E}\bigl[\min\{t\
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
- Stationary activated random walk: regularity, heavy tails, and remixing#1115799
- Higher-Order Fluctuations of the Log-Partition Function for Ising Models on Inhomogeneous Random Graphs#1156570
- Rigidity of expanders and pseudorandom graphs#662234
- Rigidity of expanders and pseudorandom graphs#661184
- Majority dynamics on sparse random graphs#1084861
Record · ID 926733
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