arXiv (All)
open access
Modularity in planted partition model
We obtain tight bounds on the modularity of PPM graphs in the case of equally sized parts. Moreover, we provide a general method that can help in obtaining bounds for various other models.
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
- Large- N expansions applied to gravitational clustering#1053361
- Fast Deterministic Distributed Degree Splitting#618010
- Fast Deterministic Distributed Degree Splitting#617510
- Upper tail bounds for irregular graphs#1062761
- The exact rank of sparse random graphs#344752
Record · ID 985307
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