arXiv (All)
open access
Graph conductance, synchronization, and a new local bottleneck measure for decentralized network optimization
The two most prominent bottleneck measures in graph theory, commonly known as the isoperimetric number and conductance, are both referred to in the literature as Cheeger constants. While these measures are useful for assessing barriers to flow in networked systems, neither is sufficient to character
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
- Towards Reasonable Concept Bottleneck Models#139178
- Counting cographs in locally dense graphs#1298316
- Measuring Complexity: Things That Go Wrong and How to Get It Right—Version 2#724261
- Profiling Resilient to Change in Probe Position#138818
- Transferable Graph Metanetworks#1155355
Record · ID 1199711
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