PreprintCC BY 4.0arXiv
Modularity in planted partition model
Abstract
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.
Versions
Related
- Hypergraph cycle enumeration for efficient inference of planted k-XOR with smooth trade-off
- Estimation and Recovery of a Planted Dense Subgraph from a Single Network Cascade
- Modularity of Higher Theta Series III: Proof of the Modularity Conjecture
- Modularity of higher theta series I: cohomology of the generic fiber
- On the modularity of residually reducible Galois representations of rank 2
BibTeX
@misc{koshelev2026modularity,
title = {{Modularity in planted partition model}},
author = {M. Koshelev},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.07896},
eprint = {2609.07896},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.07896},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Modularity in planted partition model
AU - M. Koshelev
PY - 2026
DA - 2026/09/07
PB - arXiv
DO - 10.48550/arxiv.2609.07896
UR - https://arxiv.org/abs/2609.07896
AB - 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.
ER -