arXiv (All)
open access
Fully Dynamic Random-Walk Quantities on Undirected Expanders and $κ$-Uniform Directed Graphs
We study fully dynamic data structures for random-walk quantities on undirected expanders and fast-mixing directed graphs. For an unweighted graph whose normalized Laplacian has spectral gap at least $γ$, we give a $(1\pm\varepsilon)$ effective-resistance data structure with expected update time $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
- Repeated averaging on expanders I: random $d$-regular graph#1061363
- Exact Recovery by Neighborhood Smoothing in Directed Stochastic Block Models#1083019
- Majority dynamics and internal partitions of random regular graphs: Experimental results#1358956
- Random Schreier graphs as expanders#984010
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
Record · ID 1342922
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