Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
Not on the map. Why?
Abstract (arXiv)
It is common in the study of networks to investigate meso-scale features to try to gain an understanding of network structure and function. For example, numerous algorithms have been developed to try to identify "communities," which are typically construed as sets of nodes with denser connections internally than with the remainder of a network. In this paper, we adopt a complementary perspective that "communities" are associated with bottlenecks of locally-biased dynamical processes that begin at seed sets of nodes, and we employ several different community-identification procedures (using diffusion-based and geodesic-based dynamics) to investigate community quality as a function of community size. Using several empirical and synthetic networks, we identify several distinct scenarios for ``size-resolved community structure'' that can arise in real (and realistic) networks. Depending on which scenario holds, one may or may not be able to successfully identify ``good'' communities in a given network, the manner in which different small communities fit together to form meso-scale network structures can be very different, and processes such as viral propagation and information diffusion can exhibit very different dynamics.In addition, our results suggest that, for many large realistic networks, the output of locally-biased methods that focus on communities that are centered around a given seed node might have better conceptual grounding and greater practical utility than the output of global community-detection methods. They also illustrate subtler structural properties that are important to consider in the development of better benchmark networks to test methods for community detection. [Note: Because of space limitations in the arXiv's abstract field, this is an abridged version of the paper's abstract.]
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Mar 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 1; 2023: 1; 2024: 0; 2025: 1.
8 papers.
- 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learnercited by 131
- 2021Scalable Community Detection via Parallel Correlation Clusteringcited by 9
- 2021Learning low-rank latent mesoscale structures in networkscited by 3
- 2021Learning from learning machines: a new generation of AI technology to meet the needs of sciencecited by 3
- 2022CHIEF: Clustering with Higher-order Motifs in Big Networkscited by 3
- 2025Adaptive Local Clustering over Attributed Graphscited by 2
- 2021ℓ2-norm Flow Diffusion in Near-Linear Timecited by 0
- 2021An adaptation of InfoMap to absorbing random walks using absorption-scaled graphscited by 0
- 2025Adaptive Local Clustering over Attributed Graphs26 Mar 2025
- 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learner10 Apr 2023
- 2022CHIEF: Clustering with Higher-order Motifs in Big Networks6 Apr 2022
- 2021An adaptation of InfoMap to absorbing random walks using absorption-scaled graphs21 Dec 2021
- 2021Learning from learning machines: a new generation of AI technology to meet the needs of science27 Nov 2021
- 2021Scalable Community Detection via Parallel Correlation Clustering27 Jul 2021
- 2021ℓ2-norm Flow Diffusion in Near-Linear Time30 May 2021
- 2021Learning low-rank latent mesoscale structures in networks13 Feb 2021