arXiv (OAI Expanded)
open access
Kemeny's constant via matrix compression and eigenvalue interlacing
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic framework for bounding Kemeny's constant of a finite connected weighted graph using degree-weighted compressions of the norm
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
- Derandomizing Karger's Contraction Algorithm for Matroids#620698
- Derandomizing Karger's Contraction Algorithm for Matroids#619019
- Strong matchgate designs in nearly optimal depth#1062564
- Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compression#1109878
- On (Directed) Width-Parameters of Geometric Spanners#1036492
Record · ID 1123839
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