arXiv (All)
open access
The Kemeny-Braess Paradox in Random Graphs
In 2016, Kirkland and Zeng initiated the mathematical treatment of Braess paradox for random walks on graphs using Kemeny's constant as the measure of travel time. We study this phenomenon for the Erdős-Rényi random graph $G(n,p)$. An edge in a connected graph is called Kemeny-Braess if its deletion
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
- Phase transition for the asymptotic entropy of branching random walks on groups#652401
- Phase transition for the asymptotic entropy of branching random walks on groups#650948
- Trimers, pairs and localisation on disordered random graphs#1117099
- Deterministic Avalanches on a Branching Koch Curve#69593
- Unifying network connectivity from geodesics to random walks via the random cluster model.#449879
Record · ID 1388709
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