Metraipolis › archive › dc_a6d123df607a

Partition Space Maps for Community Detection: Visualizing Algorithmic Behaviour and Guiding Search — arXiv:2609.36977

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36977
License (as archived)
CC0-1.0
Archived
2026-10-07T17:26:27.958Z
SHA-256 of the archived text
4b7297aebdd7af84edb933a05006e701eaa637a445526da8366ed33e1102e02c
Stable URL of this page
https://metraipolis.com/documento/dc_a6d123df607a

How to cite

Partition Space Maps for Community Detection: Visualizing Algorithmic Behaviour and Guiding Search — arXiv:2609.36977 — arXiv (en), https://arxiv.org/abs/2609.36977 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a6d123df607a (Metraipolis archive dc_a6d123df607a, sha256 4b7297aebdd7af84edb933a05006e701eaa637a445526da8366ed33e1102e02c)
BibTeX
@misc{dca6d123df607a,
  title = {Partition Space Maps for Community Detection: Visualizing Algorithmic Behaviour and Guiding Search — arXiv:2609.36977},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36977},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a6d123df607a; sha256 4b7297aebdd7af84edb933a05006e701eaa637a445526da8366ed33e1102e02c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36977. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Community-detection methods search over possible partitions of a network, but the structure of this partition space is rarely examined directly. This paper introduces two complementary tools that make~$\mathcal{P}$ analytically and visually accessible. First, a canonical labelling scheme based on the Restricted Growth Sequence~(RGS) is adopted, assigning each partition a unique, permutation-invariant identifier and eliminating the need for pairwise similarity measures such as the Normalized Mutual Information. Second, granularity~$\Gamma$ is defined and combined with modularity~$Q$ to produce a two-dimensional projection: the Partition Space Map~(PSM). Within the $(\Gamma,Q)$ plane, only a discrete set of integer values of~$\Gamma$ is attainable, and upper and lower bounds on~$Q$ are derived directly from the deviation matrix. These tools are demonstrated through complete enumeration of~$\mathcal{P}$ for small benchmark graphs, revealing the fine structure of modularity degeneracy and the combinatorial constraints that shape the feasible region. The framework provides an exact, assumption-free reference for evaluating heuristic community detection algorithms and lays the groundwork for geometry-aware exploration of partition space in larger networks.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-30 in cs.SI).
Categorie arXiv: Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2609.36977 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T16:58:01.664Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).