arXiv (All)
open access
Community structure of the pseudofractal web
The Ramsey community number $r_κ$ is the smallest network size at which a graph is better described by a partition into communities than by no partition, under a prescribed detection rule. On a scale-free graph this question is confounded: a block model can split the network merely to absorb its deg
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
- Freeze-thaw strength regulates carbon density through microbial assembly processes and network clustering#333044
- COMPANION DEFENSE & INTEGRATION MANUSCRIPT: RECONCILING NUMBER-THEORETIC SPECTRAL RIGIDITY WITH DISCIPLINARY CONSENSUS IN MACROMOLECULAR BIOPHYSICS#1506699
- The Canonical Closure of the RZS Framework#87020
- Fractals and Angelito Malicse's Universal Formula#699554
- Hierarchical Localized Subsystems: From Quantum Particles to Cosmology#86062
Record · ID 1534087
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