pith. sign in

arxiv: 1906.09082 · v1 · pith:MCMY3264new · submitted 2019-06-21 · ⚛️ physics.soc-ph · cs.SI

Community Detection in the Hyperbolic Space

Matteo Bruno , Sandro Ferreira Sousa , Furkan Gursoy , Matteo Serafino , Francesca V. Vianello , Ana Vrani\'c , Mari\'an Bogu\~n\'a This is my paper

Pith reviewed 2026-05-25 18:22 UTC · model grok-4.3

classification ⚛️ physics.soc-ph cs.SI
keywords hyperbolic embeddingcommunity detectionangular distributionnetwork structureretweet networkpolitical communitiessocial networks
0
0 comments X

The pith

The angular positions of nodes after hyperbolic embedding reveal the network's community structure.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper tests whether mapping a network into hyperbolic space lets community structure be read directly from how the nodes are spread around the angular coordinate. It checks this by running community detection on the embedded positions and comparing the resulting groups to the partitions found on the original graph, for both a synthetic network and two real networks. The same pipeline is then applied to a retweet graph from Italian elections, where the angular groups align with the political spectrum. A sympathetic reader would care because the geometric layout would turn an abstract graph property into visible angular clusters without needing extra topological calculations.

Core claim

The angular distribution of nodes in the hyperbolic plane reveals the community structure of the embedded network. Partitions obtained by applying community detection heuristics to the angular coordinates after embedding are compared to the partitions on the original network; the two agree for the synthetic case and for the real-world cases examined, including a retweet network whose angular clusters match the Italian political spectrum.

What carries the argument

The angular coordinates of the nodes in the hyperbolic embedding, which group nodes into communities by their angular proximity.

If this is right

  • Community partitions recovered from angular positions match those found before embedding on both synthetic and real networks.
  • The angular approach applied to the Italian election retweet network produces groups that correspond to the political spectrum.
  • Hyperbolic embedding preserves community information in addition to the usual degree and clustering properties.
  • The method offers a geometric route to community detection that can be applied after any standard hyperbolic embedding step.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same angular clustering might be checked against ground-truth labels on networks where such labels exist independently of the embedding.
  • If angular separation scales with community strength, the approach could quantify how sharply communities are separated in the hidden space.
  • The pipeline could be rerun with different embedding algorithms to test whether the angular community signal depends on the particular embedding method chosen.

Load-bearing premise

The embedding algorithm places nodes so that their angular positions reflect genuine communities rather than creating artificial clusters.

What would settle it

Running the same comparison on several additional networks and finding that angular partitions show near-zero agreement with the original partitions would falsify the claim.

Figures

Figures reproduced from arXiv: 1906.09082 by Ana Vrani\'c, Francesca V. Vianello, Furkan Gursoy, Mari\'an Bogu\~n\'a, Matteo Bruno, Matteo Serafino, Sandro Ferreira Sousa.

Figure 1
Figure 1. Figure 1: Methodological pipeline. The network is embedded on a hyperbolic plane a → b, then nodes are clustered in the new system b → c where communities are identified, and finally we construct a network from the newly formed communities c → d. A Hyperbolic embedding The embedding of real complex networks is not trivial. The reason is that many complex networks are not explicitly embedded in a physical space, i.e.… view at source ↗
Figure 2
Figure 2. Figure 2: Email network communities. After embedding network to hyperbolic plane, we used different methods to [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Twitter network embedded on a hyperbolic plane where communities are detected according to the angular [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The network of communities generated from the Twitter data, considering the realized energies (left) and the [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Facebook, email and test (synthetic) networks are embedded to a hyperbolic plane and using different methods [PITH_FULL_IMAGE:figures/full_fig_p014_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Communities on the Italian Political Twitter dataset, obtained by Louvain optimisation, projected onto the [PITH_FULL_IMAGE:figures/full_fig_p015_6.png] view at source ↗
read the original abstract

Embedding a network in hyperbolic space can reveal interesting features for the network structure, especially in terms of self-similar characteristics. The hidden metric space, which can be thought of as the underlying structure of the network, is able to preserve some interesting features generally observed in real-world networks such as heterogeneity in the degree distribution, high clustering coefficient, and small-world effect. Moreover, the angular distribution of the nodes in the hyperbolic plane reveals a community structure of the embedded network. It is worth noting that, while a large body of literature compares well-known community detection algorithms, there is still no consensus on what defines an ideal community partition on a network. Moreover, heuristics for communities found on networks embedded in the hyperbolic space have been investigated here for the first time. We compare the partitions found on embedded networks to the partitions obtained before the embedding step, both for a synthetic network and for two real-world networks. The second part of this paper presents the application of our pipeline to a network of retweets in the context of the Italian elections. Our results uncover a community structure reflective of the political spectrum, encouraging further research on the application of community detection heuristics to graphs mapped onto hyperbolic planes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript claims that embedding a network in hyperbolic space reveals community structure through the angular distribution of nodes. It validates this by comparing partitions derived from angular positions post-embedding against partitions obtained on the original network, for one synthetic network and two real-world networks. The approach is then applied to a retweet network from the Italian elections, where the resulting communities align with the political spectrum.

Significance. If the central claim holds after addressing controls, the work offers a geometrically grounded heuristic for community detection that leverages the known hyperbolic properties of many real networks (heterogeneous degrees, high clustering). The explicit before/after partition comparisons and the concrete election-retweet application are positive features that could stimulate further geometric methods in network science.

major comments (2)
  1. [Validation section (comparisons on synthetic and real networks)] Validation section (comparisons on synthetic and real networks): the reported agreement between pre-embedding and post-embedding partitions is presented as evidence that angular positions reveal communities, yet no results are shown for community-free null models (Erdős–Rényi or configuration-model graphs). This omission is load-bearing because the embedding procedure itself could induce angular sectors from degree heterogeneity or connection patterns alone, undermining the claim that the observed clustering is recovered rather than manufactured.
  2. [Methods / embedding procedure] Methods / embedding procedure: the specific algorithm used to obtain the hyperbolic coordinates (and therefore the angular coordinates) is not described with sufficient detail to evaluate whether angular clustering is an input-independent output of the embedding energy or distance minimization. Without this, it is impossible to assess the weakest assumption that the embedding step does not itself create the community signal being measured.
minor comments (2)
  1. The abstract states that 'heuristics for communities found on networks embedded in the hyperbolic space have been investigated here for the first time'; the main text should explicitly name and reference the particular heuristics (e.g., angular binning, k-means on angles) and any parameter choices.
  2. Figure captions and table legends should clarify whether the reported partition agreement metrics are normalized mutual information, adjusted Rand index, or another measure, and whether error bars reflect multiple embedding runs or multiple community-detection seeds.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed report. The two major comments identify important gaps in validation and methodological transparency. We address each below and commit to revisions that directly respond to the concerns.

read point-by-point responses

  1. Referee: Validation section (comparisons on synthetic and real networks): the reported agreement between pre-embedding and post-embedding partitions is presented as evidence that angular positions reveal communities, yet no results are shown for community-free null models (Erdős–Rényi or configuration-model graphs). This omission is load-bearing because the embedding procedure itself could induce angular sectors from degree heterogeneity or connection patterns alone, undermining the claim that the observed clustering is recovered rather than manufactured.

    Authors: We agree that the absence of null-model controls is a substantive limitation. In the revised manuscript we will add explicit experiments on Erdős–Rényi graphs and on configuration-model graphs that preserve the original degree sequences. These controls will quantify the angular clustering (or lack thereof) that arises solely from degree heterogeneity and the embedding procedure. We expect the results to show that significant angular sectors appear only when the input network contains community structure, thereby strengthening the claim that the observed partitions are recovered rather than manufactured. revision: yes

  2. Referee: Methods / embedding procedure: the specific algorithm used to obtain the hyperbolic coordinates (and therefore the angular coordinates) is not described with sufficient detail to evaluate whether angular clustering is an input-independent output of the embedding energy or distance minimization. Without this, it is impossible to assess the weakest assumption that the embedding step does not itself create the community signal being measured.

    Authors: We acknowledge that the embedding algorithm was described at an insufficient level of detail. The revised Methods section will specify the exact procedure employed (including the optimization objective, initialization method, convergence criteria, and any hyperparameters), together with references to the underlying implementation. This will allow readers to verify that angular clustering emerges from the network topology rather than from algorithmic bias in the embedding step. revision: yes

Circularity Check

0 steps flagged

No circularity; embedding and angular community detection are independent steps

full rationale

The paper's pipeline embeds a network into hyperbolic space (using an external procedure), extracts angular coordinates, applies community detection heuristics to those angles, and validates by comparing the resulting partitions against the original network's partitions on both synthetic and real data. No equations, fitted parameters, or self-citations are described that would make any claimed result equivalent to its inputs by construction. The central claim rests on empirical comparison rather than a derivation that reduces tautologically to the embedding step itself. This is the most common honest outcome for papers whose core contribution is methodological application and validation rather than a closed mathematical derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The central claim depends on the unstated properties of the hyperbolic embedding algorithm (not named in the abstract) and on the assumption that angular coordinates carry community information independent of the embedding procedure itself.

pith-pipeline@v0.9.0 · 5764 in / 978 out tokens · 18905 ms · 2026-05-25T18:22:55.474783+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    Diameter of the World-Wide Web

    Réka Albert, Hawoong Jeong, and Albert-László Barabási. Diameter of the World-Wide Web. Nature, 401(6749):130–131, 1999

    work page 1999

  2. [2]

    Mahadevan and B

    R. Mahadevan and B. O. Palsson. Properties of metabolic networks: Structure versus function. Biophysical Journal, 88(1):7–9, 2005

    work page 2005

  3. [3]

    The Power Grid as a complex network: A survey.Physica A: Statistical Mechanics and its Applications, 392(11):2688–2700, 2013

    Giuliano Andrea Pagani and Marco Aiello. The Power Grid as a complex network: A survey.Physica A: Statistical Mechanics and its Applications, 392(11):2688–2700, 2013

    work page 2013

  4. [4]

    small world

    Duncan Watts and Steven Strogatz. Collective dynamics of "small world" networks. Nature, 393(6684):440–442, 1998

    work page 1998

  5. [5]

    Community Structure in Graphs

    Santo Fortunato and Claudio Castellano. Community Structure in Graphs. Computational Complexity, pages 490–512, 2012

    work page 2012

  6. [6]

    S. N. Dorogovtsev, A. V . Goltsev, and J. F.F. Mendes. Critical phenomena in complex networks. Reviews of Modern Physics, 80(4):1275–1335, 2008

    work page 2008

  7. [7]

    Cambridge University Press], 2008

    Alain Barrat, Marc Barthelemy, and Alessandro Vespignani.Dynamical Process on Complex Networks. Cambridge University Press], 2008

    work page 2008

  8. [8]

    Interdisciplinary and physics challenges of network theory

    Ginestra Bianconi. Interdisciplinary and physics challenges of network theory. Epl, 111(5), 2015

    work page 2015

  9. [9]

    Ángeles Serrano, Dmitri Krioukov, and Marián Boguñá

    M. Ángeles Serrano, Dmitri Krioukov, and Marián Boguñá. Self-similarity of complex networks and hidden metric spaces. Phys. Rev. Lett., 100:078701, Feb 2008

    work page 2008

  10. [10]

    Marián Boguna, Dmitri Krioukov, and K. C. Claffy. Navigability of complex networks.Nature Physics, 5(1):74–80, 2009

    work page 2009

  11. [11]

    Hyperbolic geometry of complex networks

    Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguñá. Hyperbolic geometry of complex networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 82(3):1–18, 2010

    work page 2010

  12. [12]

    Ángeles Serrano, Marián Boguñá, and Dmitri Krioukov

    Fragkiskos Papadopoulos, Maksim Kitsak, M. Ángeles Serrano, Marián Boguñá, and Dmitri Krioukov. Popularity versus similarity in growing networks. Nature, 489(7417):537–540, 2012

    work page 2012

  13. [13]

    Ángeles Serrano, Marián Boguñá, and Francesc Sagués

    M. Ángeles Serrano, Marián Boguñá, and Francesc Sagués. Uncovering the hidden geometry behind metabolic networks. Molecular BioSystems, 8(3):843–850, 2012

    work page 2012

  14. [14]

    T. Aste, T. Di Matteo, and S.T. Hyde. Complex networks on hyperbolic surfaces.Physica A: Statistical Mechanics and its Applications, 346(1):20 – 26, 2005

    work page 2005

  15. [15]

    Greedy Routing using Hyperbolic Space

    Robert Kleinberg. Greedy Routing using Hyperbolic Space. IEEE INFOCOM 2007 Proc., pages 1902–1909, 2007

    work page 2007

  16. [16]

    Sustaining the Internet with hyperbolic mapping

    Marián Boguñá, Fragkiskos Papadopoulos, and Dmitri Krioukov. Sustaining the Internet with hyperbolic mapping. Nature Communications, 1(6):1–8, 2010

    work page 2010

  17. [17]

    Lang, Anirban Dasgupta, and Michael W

    Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29–123, 2009

    work page 2009

  18. [18]

    Topological Strata of Weighted Complex Networks

    Giovanni Petri, Martina Scolamiero, Irene Donato, and Francesco Vaccarino. Topological Strata of Weighted Complex Networks. PLoS ONE, 8(6), 2013

    work page 2013

  19. [19]

    Gallos, Hernan A

    Lazaros K. Gallos, Hernan A. Makse, and Mariano Sigman. A small-world of weak ties provides optimal global integration of self-similar modules in functional brain networks. P . N. A. S., 109(8):2825–2830, 2011

    work page 2011

  20. [20]

    Wedeen, D L Rosene, R Wang, G Dai, F Mortazavi, P Hagmann, J H Kaas, and W-Y I Tseng

    Van J. Wedeen, D L Rosene, R Wang, G Dai, F Mortazavi, P Hagmann, J H Kaas, and W-Y I Tseng. The Geometric Structure of the Brain Fiber Pathways. Science, 335(March):1628–1635, 2012

    work page 2012

  21. [21]

    Homological scaffolds of brain functional networks

    Giovanni Petri, P Expert, F Turkheimer, R Carhart-Harris, D Nutt, P J Hellyer, and F Vaccarino. Homological scaffolds of brain functional networks. J. R. Soc. Interface, 11, 2014

    work page 2014

  22. [22]

    Large-scale curvature of networks

    Onuttom Narayan and Iraj Saniee. Large-scale curvature of networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 84(6):1–8, 2011

    work page 2011

  23. [23]

    Ángeles Serrano, and Marián Boguñá

    Guillermo García-Pérez, Antoine Allard, M. Ángeles Serrano, and Marián Boguñá. Mercator: uncovering faithful hyperbolic embeddings of complex networks. arXiv, pages 1–14, 2019

    work page 2019

  24. [24]

    The Computer Science and Physics of Community Detection : Landscapes , Phase Transitions , and Hardness

    Cristopher Moore. The Computer Science and Physics of Community Detection : Landscapes , Phase Transitions , and Hardness. arXiv, 2017. 11 COMPLEXITY 72H PREPRINT

    work page 2017

  25. [25]

    Larremore, and Aaron Clauset

    Leto Peel, Daniel B. Larremore, and Aaron Clauset. The ground truth about metadata and community detection in networks. Science Advances, 3(5), 2017

    work page 2017

  26. [26]

    Krishna Reddy, Masaru Kitsuregawa, P

    P. Krishna Reddy, Masaru Kitsuregawa, P. Sreekanth, and S. Srinivasa Rao. A graph based approach to extract a neighborhood customer community for collaborative filtering. In Subhash Bhalla, editor, Databases in Networked Information Systems, pages 188–200, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg

    work page 2002

  27. [27]

    M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69:026113, Feb 2004

    work page 2004

  28. [28]

    A density-based algorithm for discovering clusters in large spatial databases with noise

    Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD’96 Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pages 226–231, 1996

    work page 1996

  29. [29]

    Emergence of soft communities from geometric preferential attachment

    Konstantin Zuev, Marián Boguná, Ginestra Bianconi, and Dmitri Krioukov. Emergence of soft communities from geometric preferential attachment. Scientific reports, 5:9421, 2015

    work page 2015

  30. [30]

    Least Squares Quantization in PCM

    Stuart P Lloyd. Least Squares Quantization in PCM. IEEE Trans. Inf. Th., I(2):129–137, 1982

    work page 1982

  31. [31]

    Clustering Methods, pages 321–352

    Lior Rokach, Oded Maimon, and Lior Rokach. Clustering Methods, pages 321–352. Springer US, Boston, MA, 2005

    work page 2005

  32. [32]

    Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre

    Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast Unfolding of Commu- nities in Large Networks. J. Stat. Mech. Theor. Exp., page P10008, 2008

    work page 2008

  33. [33]

    Extracting significant signal of news consumption from social networks: the case of twitter in italian political elections

    Carolina Becatti, Guido Caldarelli, Renaud Lambiotte, and Fabio Saracco. Extracting significant signal of news consumption from social networks: the case of twitter in italian political elections. arXiv preprint arXiv:1901.07933, 2019

    work page arXiv 1901

  34. [34]

    Colombian export capabilities: Building the firms-products network

    Matteo Bruno, Fabio Saracco, Tiziano Squartini, and Marco Dueñas. Colombian export capabilities: Building the firms-products network. Entropy, 20(10):785, Oct 2018

    work page 2018

  35. [35]

    J. M. Kumpula, J. Saramäki, K. Kaski, and J. Kertész. Limited resolution in complex network community detection with potts model approach. The European Physical Journal B, 56(1):41–45, Mar 2007

    work page 2007

  36. [36]

    SNAP Datasets: Stanford large network dataset collection

    Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap. stanford.edu/data, June 2014. 12 COMPLEXITY 72H PREPRINT Appendix A Network Datasets In this study, we use data extracted from the Stanford Large Network Dataset Collection (SNAP) [36], the interested reader can obtain a copy from the online repository. ...

    work page 2014