pith. sign in

arxiv: 1907.10453 · v1 · pith:KKM6FVXSnew · submitted 2019-07-24 · 💻 cs.SI · physics.soc-ph

Detecting Stable Communities in Link Streams at Multiple Temporal Scales

Souaad Boudebza , Remy Cazabet , Omar Nouali , Faical Azouaou This is my paper

Pith reviewed 2026-05-24 16:41 UTC · model grok-4.3

classification 💻 cs.SI physics.soc-ph
keywords community detectionchange point detectionlink streamsdynamic networksstable communitiestemporal scalessocial contact networks
0
0 comments X

The pith

A method combines community detection and change point detection to identify stable communities in link streams at multiple temporal scales.

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

The paper develops a technique for link streams that first detects communities and then locates change points inside those communities to mark periods of stability. This combination lets the approach operate at several time resolutions at once rather than requiring a single fixed scale. Existing dynamic community detection methods typically lack this flexibility, so the new procedure reuses standard tools for both community finding and change-point location. The authors evaluate the procedure on synthetic networks with known structure and on high-resolution contact data from real social settings. A reader would care because the method promises to extract persistent group structures from time-stamped interaction records without exhaustive parameter searches for each scale.

Core claim

We build on both community detection and change point detection to detect stable community structures by identifying change points within meaningful communities. Unlike existing dynamic community detection algorithms, the proposed method is able to discover stable communities efficiently at multiple temporal scales. We test the effectiveness of our method on synthetic networks, and on high-resolution time-varying networks of contacts drawn from real social networks.

What carries the argument

The integration of standard community detection to locate meaningful groups followed by change-point detection applied inside those groups to isolate stable intervals in link-stream data.

If this is right

  • Stable communities become detectable without committing to one temporal resolution before analysis begins.
  • High-resolution contact networks can be processed directly rather than requiring aggregation to a single time step.
  • Standard off-the-shelf community detection and change-point algorithms can be reused instead of requiring new end-to-end dynamic methods.
  • Multiple scales can be examined in one pass, reducing the need for repeated runs at every candidate resolution.

Where Pith is reading between the lines

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

  • The detected stable intervals could serve as natural time windows for studying information diffusion or influence within the same groups.
  • The same two-step procedure might be tested on biological or technological interaction streams to locate persistent functional modules.
  • An automated rule for choosing which change points to retain could be derived from the distribution of community lifetimes themselves.
  • Computational savings may arise when the method avoids exhaustive community detection at every possible aggregation scale.

Load-bearing premise

That change points found inside communities cleanly separate stable periods from transitions without scale-specific biases introduced by the two-step process.

What would settle it

Apply the method to a synthetic link stream engineered with known stable communities at two distinct scales; if the recovered stable intervals do not match the planted ones at both scales, the central claim is falsified.

Figures

Figures reproduced from arXiv: 1907.10453 by Faical Azouaou, Omar Nouali, Remy Cazabet, Souaad Boudebza.

Figure 1
Figure 1. Figure 1: Visual comparison between planted and discovered communities. Time [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Stable communities of different lengths on the SocioPatterns Primary [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Speed of several dynamic community detection methods for several tem [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
read the original abstract

Link streams model interactions over time in a wide range of fields. Under this model, the challenge is to mine efficiently both temporal and topological structures. Community detection and change point detection are one of the most powerful tools to analyze such evolving interactions. In this paper, we build on both to detect stable community structures by identifying change points within meaningful communities. Unlike existing dynamic community detection algorithms, the proposed method is able to discover stable communities efficiently at multiple temporal scales. We test the effectiveness of our method on synthetic networks, and on high-resolution time-varying networks of contacts drawn from real social networks.

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

3 major / 2 minor

Summary. The paper proposes a method to detect stable communities in link streams by combining community detection with change-point detection. This allows identification of stable structures at multiple temporal scales, in contrast to existing dynamic community detection algorithms. Effectiveness is tested on synthetic networks and real high-resolution contact networks from social interactions.

Significance. If the quantitative validation holds, the approach could provide an efficient, multi-scale tool for temporal network analysis by leveraging existing techniques without the overhead of fully dynamic methods. The absence of metrics in the provided description limits assessment of whether this integration succeeds without introducing scale biases or heavy tuning.

major comments (3)
  1. [Abstract] Abstract: the claim of effectiveness on synthetic and real networks supplies no quantitative metrics, baselines, or validation details, preventing assessment of whether the data support the central claim that stable communities are discovered efficiently at multiple scales.
  2. [Method] Method description (inferred from abstract): the integration of community detection and change-point detection is presented without explicit discussion of how scale-specific biases are avoided or how parameters are chosen, which is load-bearing for the claim of reliable isolation of stable structures.
  3. [Experiments] Evaluation section: no details on the synthetic network generation process, the real contact datasets used, or comparison against baselines are supplied, undermining the ability to verify the multi-scale advantage.
minor comments (2)
  1. [Introduction] Notation for link streams and temporal scales could be clarified with a formal definition early in the paper.
  2. [Figures] Figure captions for any network visualizations should explicitly state the temporal scale and detected change points.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their constructive comments. We address each point below and will make revisions to improve the clarity and completeness of the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim of effectiveness on synthetic and real networks supplies no quantitative metrics, baselines, or validation details, preventing assessment of whether the data support the central claim that stable communities are discovered efficiently at multiple scales.

    Authors: We agree that the abstract lacks specific quantitative details. In the revised manuscript, we will incorporate key performance metrics from our experiments, including accuracy measures on synthetic data and comparisons of computational efficiency, to substantiate the claims. revision: yes

  2. Referee: [Method] Method description (inferred from abstract): the integration of community detection and change-point detection is presented without explicit discussion of how scale-specific biases are avoided or how parameters are chosen, which is load-bearing for the claim of reliable isolation of stable structures.

    Authors: The manuscript's method section details the integration, but we acknowledge the need for more explicit discussion. We will add explanations on parameter selection procedures and strategies to mitigate scale-specific biases, such as using multiple temporal resolutions and validation on controlled synthetic scenarios. revision: yes

  3. Referee: [Experiments] Evaluation section: no details on the synthetic network generation process, the real contact datasets used, or comparison against baselines are supplied, undermining the ability to verify the multi-scale advantage.

    Authors: Details on synthetic network generation (based on planted partition models with temporal dynamics) and real datasets (high-resolution contact networks from the SocioPatterns project) are present in the full manuscript. We will enhance this section with more explicit descriptions and include baseline comparisons to better demonstrate the advantages of the multi-scale approach. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper describes a method that integrates existing community detection and change-point detection techniques to identify stable communities in link streams across temporal scales, with validation on synthetic and real contact networks. No derivation chain is presented that reduces by construction to fitted parameters, self-definitions, or self-citation load-bearing premises; the central claim rests on empirical effectiveness rather than tautological inputs or renamed known results. The approach is self-contained against external benchmarks without evidence of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no free parameters, axioms, or invented entities can be extracted.

pith-pipeline@v0.9.0 · 5628 in / 833 out tokens · 18320 ms · 2026-05-24T16:41:21.049875+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

19 extracted references · 19 canonical work pages · 2 internal anchors

  1. [1]

    In: 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

    Aynaud, T., Guillaume, J.L.: Static community detection algorithms for evolv- ing networks. In: 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. pp. 513–519. IEEE (2010)

    work page 2010

  2. [2]

    Journal of statistical mechanics: theory and experiment 2008(10), P10008 (2008)

    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of com- munities in large networks. Journal of statistical mechanics: theory and experiment 2008(10), P10008 (2008)

    work page 2008

  3. [3]

    Computer Com- munications 123, 36–51 (2018)

    Boudebza, S., Cazabet, R., Azouaou, F., Nouali, O.: Olcpm: An online framework for detecting overlapping communities in dynamic social networks. Computer Com- munications 123, 36–51 (2018)

    work page 2018

  4. [4]

    Publicationes Mathematicae Debrecen 6, 290–297 (1959)

    Erd¨ os, P., R´ enyi, A.: On random graphs i. Publicationes Mathematicae Debrecen 6, 290–297 (1959)

    work page 1959

  5. [5]

    In: 2010 international conference on advances in social networks analysis and mining

    Greene, D., Doyle, D., Cunningham, P.: Tracking the evolution of communities in dynamic social networks. In: 2010 international conference on advances in social networks analysis and mining. pp. 176–183. IEEE (2010) 7The full code is available at https://github.com/Yquetzal/ECML_PKDD_ 2019 8An online notebook to test the method is available at https://col...

    work page 2010

  6. [6]

    Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using networkx. Tech. rep., Los Alamos National Lab.(LANL), Los Alamos, NM (United States) (2008)

    work page 2008

  7. [7]

    Labatut, V., Orman, G.K.: Community Structure Characterization, pp. 1–13. Springer New York, New York, NY (2017)

    work page 2017

  8. [8]

    New Journal of Physics 11(3), 033015 (2009)

    Lancichinetti, A., Fortunato, S., Kert´ esz, J.: Detecting the overlapping and hier- archical community structure in complex networks. New Journal of Physics 11(3), 033015 (2009)

    work page 2009

  9. [9]

    Stream Graphs and Link Streams for the Modeling of Interactions over Time

    Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the mod- eling of interactions over time. CoRR abs/1710.04073 (2017)

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  10. [10]

    Internet Mathematics 6(1), 29–123 (2009)

    Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: 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

  11. [11]

    Scientific Reports 9(1) (1 2019)

    Masuda, N., Holme, P.: Detecting sequences of system states in temporal networks. Scientific Reports 9(1) (1 2019). https://doi.org/10.1038/s41598-018-37534-2

    work page doi:10.1038/s41598-018-37534-2 2019

  12. [12]

    science 328(5980), 876–878 (2010)

    Mucha, P.J., Richardson, T., Macon, K., Porter, M.A., Onnela, J.P.: Commu- nity structure in time-dependent, multiscale, and multiplex networks. science 328(5980), 876–878 (2010)

    work page 2010

  13. [13]

    Nature 446(7136), 664 (2007)

    Palla, G., Barab´ asi, A.L., Vicsek, T.: Quantifying social group evolution. Nature 446(7136), 664 (2007)

    work page 2007

  14. [14]

    In: Pro- ceedings of the Tenth ACM International Conference on Web Search and Data Mining

    Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Pro- ceedings of the Tenth ACM International Conference on Web Search and Data Mining. pp. 601–610. ACM (2017)

    work page 2017

  15. [15]

    Detecting change points in the large-scale structure of evolving networks

    Peel, L., Clauset, A.: Detecting change points in the large-scale structure of evolv- ing networks. CoRR abs/1403.0989 (2014)

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  16. [16]

    ACM Computing Surveys (CSUR) 51(2), 35 (2018)

    Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Computing Surveys (CSUR) 51(2), 35 (2018)

    work page 2018

  17. [17]

    Machine Learning 106(8), 1213–1241 (2017)

    Rossetti, G., Pappalardo, L., Pedreschi, D., Giannotti, F.: Tiles: an online al- gorithm for community discovery in dynamic social networks. Machine Learning 106(8), 1213–1241 (2017)

    work page 2017

  18. [18]

    PLOS ONE 6(8), e23176 (08 2011)

    Stehl´ e, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J., Quaggiotto, M., Van den Broeck, W., R´ egis, C., Lina, B., Vanhems, P.: High-resolution mea- surements of face-to-face contact patterns in a primary school. PLOS ONE 6(8), e23176 (08 2011). https://doi.org/10.1371/journal.pone.0023176

    work page doi:10.1371/journal.pone.0023176 2011

  19. [19]

    In: Proceedings of the 26th International Joint Conference on Artificial Intelligence

    Wang, Y., Chakrabarti, A., Sivakoff, D., Parthasarathy, S.: Fast change point de- tection on dynamic social networks. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. pp. 2992–2998. IJCAI’17, AAAI Press (2017)

    work page 2017