arXiv (All)
open access
Approximating Kemeny's constant via spectral sparsification
Kemeny's constant of a network quantifies the expected time for a random walk to reach a target vertex chosen according to the stationary distribution, independently of the starting vertex. The purpose of this work is twofold. First, we introduce the class of slightly regular networks, whose orthogo
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
- Incompressibility and spectral gaps of random circuits#1051965
- Full Lyapunov Spectra of Random Neural Networks, Part I: Finite-Time and Asymptotic Theory#1325818
- General theory of perturbation of infinite resistor networks#670352
- General theory of perturbation of infinite resistor networks#668287
- Long-time behavior of reducible stochastic linear reaction networks: a spectral and structural classification#1248723
Record · ID 1422720
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