pith. sign in

arxiv: 2605.24450 · v1 · pith:RTFBZLHPnew · submitted 2026-05-23 · 💻 cs.SI

Generalized L-Modularity for Community Detection Beyond Simple Temporal Networks

Victor Brabant , Angela Bonifati , Remy Cazabet This is my paper

Pith reviewed 2026-06-30 12:31 UTC · model grok-4.3

classification 💻 cs.SI
keywords community detectiontemporal networkslink streamsL-Modularitydynamic networksmodularity optimizationcomplex networks
0
0 comments X

The pith

Generalizing L-Modularity creates a unified framework for community detection in temporal networks with directed, weighted, delayed, and multipartite interactions.

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

The paper extends Longitudinal Modularity to cover complex link streams that mix instantaneous events, continuous contacts, and delayed interactions while also supporting direction, weight, and multiple node types. Prior methods typically collapse these features through time-window aggregation, unipartite projection, or by dropping direction and weight, which discards information present in the original data. The generalized objective and accompanying algorithm keep all of these aspects inside a single optimization process. Tests on three real-world datasets indicate that the resulting partitions reflect meaningful structure under the richer data model.

Core claim

Extending L-Modularity and the LAGO algorithm yields a single objective function and detection method that operates directly on dynamic networks containing instantaneous, interval, and delayed edges together with directionality, weights, and multipartite structure, without requiring the simplifying transformations used by earlier temporal community-detection approaches.

What carries the argument

Generalized L-Modularity objective that augments the classic modularity score with terms tracking temporal persistence and the full range of interaction modalities in link streams.

If this is right

  • Communities can be extracted without first aggregating edges into fixed time windows.
  • Multipartite networks can be analyzed without first projecting them onto a single node type.
  • Edge direction and weight information remain available to the quality function during optimization.
  • The same algorithm applies uniformly to instantaneous events, persistent contacts, and delayed interactions.

Where Pith is reading between the lines

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

  • Analysts of transportation or communication data may spend less time on custom preprocessing pipelines.
  • The framework could serve as a test bed for adding further interaction features such as higher-order or signed edges.
  • Retaining raw temporal and modality detail may produce communities whose membership changes are easier to interpret in application domains.

Load-bearing premise

The mathematical extension of the original L-Modularity formula correctly captures community quality across all interaction modalities without introducing new biases or needing per-dataset adjustments.

What would settle it

On the three evaluated datasets, partitions produced by the generalized method show no improvement in alignment with external labels or domain interpretations compared with results from standard aggregation or projection baselines.

read the original abstract

Detecting communities in networks is essential for understanding the mesoscopic organization of complex systems. Interactions in most real-world networks evolve over time and exhibit diverse modalities: instantaneous events, continuous contacts that persist over intervals, and delayed interactions where source and destination are temporally separated, as observed in transportation processes. Additionally, interactions may be directed, weighted, or involve multiple node types. Existing methods for community detection in temporal networks typically handle only limited subsets of these features. When applied to real-world data, they often rely on simplifying transformations, such as aggregating interactions into time windows, projecting multipartite structures onto unipartite graphs, or ignoring edge directions and weights, leading to a loss of information. In this work, we generalize Longitudinal Modularity (L-Modularity) and the LAGO algorithm into a unified framework for dynamic community detection in complex link streams. Experiments on three real-world datasets demonstrate that our approach discovers meaningful communities in temporal networks with diverse interaction types.

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 / 1 minor

Summary. The manuscript generalizes Longitudinal Modularity (L-Modularity) and the LAGO algorithm into a unified framework for dynamic community detection in complex link streams. The generalization is claimed to handle instantaneous events, continuous contacts, delayed interactions, as well as directed, weighted, and multipartite structures while avoiding information loss from aggregation, projection, or ignoring directions/weights. Experiments on three real-world datasets are reported to demonstrate discovery of meaningful communities.

Significance. If the generalization preserves the original optimization properties without introducing dataset-specific biases and the experimental results are backed by quantitative controls, the work could provide a useful unification for temporal network community detection. The attempt to address multiple modalities in one framework is a positive direction, though the absence of visible derivations or metrics in the supplied material limits assessment of its actual contribution.

major comments (2)
  1. [Abstract] Abstract: the claim that the approach 'correctly extends the original objective' without new biases is load-bearing for the central claim, yet no objective function, derivation, or proof of property preservation is visible; this must be supplied with explicit comparison to the original L-Modularity formulation.
  2. [Experiments] Experiments section: the assertion that communities are 'meaningful' on three datasets rests on qualitative judgment with no reported quantitative metrics, baselines, or cross-modality validation; this undermines the experimental support for the generalization's utility.
minor comments (1)
  1. [Abstract] Abstract: the phrase 'complex link streams' is used without a precise definition or reference to how it relates to standard temporal-network terminology.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful review and the opportunity to clarify and strengthen the manuscript. We address each major comment below and commit to revisions that directly respond to the concerns raised.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that the approach 'correctly extends the original objective' without new biases is load-bearing for the central claim, yet no objective function, derivation, or proof of property preservation is visible; this must be supplied with explicit comparison to the original L-Modularity formulation.

    Authors: The generalization of the L-Modularity objective is derived in Section 3, where we explicitly extend the original formulation to accommodate delayed, directed, weighted, and multipartite interactions in link streams while retaining the core optimization structure. To improve visibility and directly address the referee's point, we will revise the manuscript to include (i) the full generalized objective function, (ii) a step-by-step derivation showing equivalence to the original L-Modularity under the special case of simple temporal networks, and (iii) a side-by-side comparison table highlighting preserved properties and the absence of introduced biases. revision: yes

  2. Referee: [Experiments] Experiments section: the assertion that communities are 'meaningful' on three datasets rests on qualitative judgment with no reported quantitative metrics, baselines, or cross-modality validation; this undermines the experimental support for the generalization's utility.

    Authors: The current experiments emphasize qualitative demonstration of interpretable communities across diverse modalities on three real-world datasets. We acknowledge that quantitative backing would strengthen the evaluation. In revision we will add (i) quantitative modularity scores and community quality metrics, (ii) comparisons against established temporal community detection baselines, and (iii) cross-modality validation where ground-truth or proxy labels permit, while retaining the qualitative case studies. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained against external benchmarks

full rationale

The abstract and context present a generalization of L-Modularity to handle diverse temporal interaction types, validated via experiments on three real-world datasets. No equations, fitting procedures, or self-citation chains are visible that reduce predictions or uniqueness claims to inputs by construction. The central claim rests on empirical results rather than internal redefinition, satisfying the condition for an honest non-finding of circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Insufficient information in the provided abstract to enumerate free parameters, axioms, or invented entities; the generalization is described at a high level without exposing modeling choices.

pith-pipeline@v0.9.1-grok · 5693 in / 1050 out tokens · 21728 ms · 2026-06-30T12:31:48.932915+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

51 extracted references · 42 canonical work pages

  1. [1]

    arXiv.org (2001) https://doi.org/10.1103/revmodphys.74.47

    Albert, R., Barab´ asi, A.: Statistical mechanics of complex networks. arXiv.org (2001) https://doi.org/10.1103/revmodphys.74.47

    work page doi:10.1103/revmodphys.74.47 2001

  2. [2]

    SIAM Review (2003) https://doi.org/10.1137/s003614450342480

    Newman, M.: The structure and function of complex networks. SIAM Review (2003) https://doi.org/10.1137/s003614450342480

    work page doi:10.1137/s003614450342480 2003

  3. [3]

    arXiv.org (2016) https://doi.org/10.1016/j.physrep.2016.09.002

    Fortunato, S., Hric, D.: Community detection in networks: A user guide. arXiv.org (2016) https://doi.org/10.1016/j.physrep.2016.09.002

    work page doi:10.1016/j.physrep.2016.09.002 2016

  4. [4]

    Physical Review E (2004) https://doi.org/10.1103/physreve.69.026113

    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E (2004) https://doi.org/10.1103/physreve.69.026113

    work page doi:10.1103/physreve.69.026113 2004

  5. [5]

    Journal of Statistical Mechanics: Theory and Experiment2008(10), 10008 (2008) https://doi.org/10.1088/1742-5468/2008/ 10/p10008

    Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment2008(10), 10008 (2008) https://doi.org/10.1088/1742-5468/2008/ 10/p10008

    work page doi:10.1088/1742-5468/2008/ 2008

  6. [6]

    Scientific Reports9(1) (2019) https://doi.org/10.1038/ s41598-019-41695-z

    Traag, V.A., Waltman, L., Eck, N.J.: From louvain to leiden: guaranteeing well- connected communities. Scientific Reports9(1) (2019) https://doi.org/10.1038/ s41598-019-41695-z

    2019

  7. [7]

    Science 328(5980), 876–878 (2010) https://doi.org/10.1126/science.1184819

    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) https://doi.org/10.1126/science.1184819

    work page doi:10.1126/science.1184819 2010

  8. [8]

    Journal of Complex Networks (2021) https://doi.org/10.1093/comnet/cnaa027

    Cazabet, R., Boudebza, S., Rossetti, G.: Evaluating community detection algo- rithms for progressively evolving graphs. Journal of Complex Networks (2021) https://doi.org/10.1093/comnet/cnaa027

    work page doi:10.1093/comnet/cnaa027 2021

  9. [9]

    EPJ Data Science (2012) https://doi.org/10.1140/epjds4

    Krings, G., Karsai, M., Bernhardsson, S., Blondel, V.D., Saram¨ aki, J.: Effects of time window size and placement on the structure of an aggregated communication network. EPJ Data Science (2012) https://doi.org/10.1140/epjds4

    work page doi:10.1140/epjds4 2012

  10. [10]

    Social Network Analysis and Mining (2018) https://doi.org/10.1007/s13278-018-0537-7

    Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Social Network Analysis and Mining (2018) https://doi.org/10.1007/s13278-018-0537-7

    work page doi:10.1007/s13278-018-0537-7 2018

  11. [11]

    EPJ Data Sci.14(1) (2025) https: //doi.org/10.1140/epjds/s13688-025-00529-x

    Brabant, V., Asgari, Y., Borgnat, P., Bonifati, A., Cazabet, R.: Longitudinal modularity, a modularity for link streams. EPJ Data Sci.14(1) (2025) https: //doi.org/10.1140/epjds/s13688-025-00529-x

    work page doi:10.1140/epjds/s13688-025-00529-x 2025

  12. [12]

    In: 2025 IEEE International Conference on Data Mining (ICDM), pp

    Brabant, V., Bonifati, A., Cazabet, R.: Discovering communities in continuous- time temporal networks by optimizing l-modularity. In: 2025 IEEE International Conference on Data Mining (ICDM), pp. 1065–1074 (2025). https://doi.org/10. 1109/ICDM65498.2025.00115 32

    work page arXiv 2025

  13. [13]

    245–257 (2023)

    Robledo, O., Klepper, M., Boven, E., Wang, H.: Community Detection for Tem- poral Weighted Bipartite Networks, pp. 245–257 (2023). https://doi.org/10.1007/ 978-3-031-21131-7 19

    2023

  14. [14]

    ACM Computing Surveys (2018) https://doi.org/10.1145/3172867

    Cazabet, R., Rossetti, G.: Community discovery in dynamic networks. ACM Computing Surveys (2018) https://doi.org/10.1145/3172867

    work page doi:10.1145/3172867 2018

  15. [15]

    Aslak, U., Rosvall, M., Lehmann, S.: Constrained information flows in temporal networks reveal intermittent communities. Phys. Rev. E97, 062312 (2018) https: //doi.org/10.1103/PhysRevE.97.062312

    work page doi:10.1103/physreve.97.062312 2018

  16. [16]

    Social Networks5(2), 109–137 (1983) https://doi.org/10.1016/0378-8733(83) 90021-7

    Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: First steps. Social Networks5(2), 109–137 (1983) https://doi.org/10.1016/0378-8733(83) 90021-7

    work page doi:10.1016/0378-8733(83 1983

  17. [17]

    Machine-mediated learning (2011) https://doi.org/10.1007/s10994-010-5214-7

    Yang, T., Chi, Y., Zhu, S., Gong, Y., Jin, R.: Detecting communities and their evolutions in dynamic social networks—a bayesian approach. Machine-mediated learning (2011) https://doi.org/10.1007/s10994-010-5214-7

    work page doi:10.1007/s10994-010-5214-7 2011

  18. [18]

    IEEE Journal of Selected Topics in Signal Processing (2014) https: //doi.org/10.1109/jstsp.2014.2310294

    Xu, K.S., Hero, A.O.: Dynamic stochastic blockmodels for time-evolving social networks. IEEE Journal of Selected Topics in Signal Processing (2014) https: //doi.org/10.1109/jstsp.2014.2310294

    work page doi:10.1109/jstsp.2014.2310294 2014

  19. [19]

    Journal of the Royal Statistical Society Series B: Statistical Methodology (2017) https://doi.org/10.1111/rssb.12200

    Matias, C., Miele, V.: Statistical clustering of temporal networks through a dynamic stochastic block model. Journal of the Royal Statistical Society Series B: Statistical Methodology (2017) https://doi.org/10.1111/rssb.12200

    work page doi:10.1111/rssb.12200 2017

  20. [20]

    Zenodo (2024)

    Brabant, V.: Longitudinal Modularity. Zenodo (2024)

    2024

  21. [21]

    2010 IEEE Second International Conference on Social Computing (2010) https://doi.org/10.1109/socialcom.2010.51

    Cazabet, R., Amblard, F., Hanachi, C.: Detection of overlapping communities in dynamical social networks. 2010 IEEE Second International Conference on Social Computing (2010) https://doi.org/10.1109/socialcom.2010.51

    work page doi:10.1109/socialcom.2010.51 2010

  22. [22]

    Machine-mediated learning (2017) https://doi.org/10.1007/s10994-016-5582-8

    Rossetti, G., Pappalardo, L., Pedreschi, D., Giannotti, F.: Tiles: an online algo- rithm for community discovery in dynamic social networks. Machine-mediated learning (2017) https://doi.org/10.1007/s10994-016-5582-8

    work page doi:10.1007/s10994-016-5582-8 2017

  23. [23]

    Computer Communications123, 36–51 (2018) https://doi.org/10.1016/j.comcom.2018.04

    Boudebza, S., Cazabet, R., Azouaou, F., Nouali, O.: Olcpm: An online framework for detecting overlapping communities in dynamic social networks. Computer Communications123, 36–51 (2018) https://doi.org/10.1016/j.comcom.2018.04. 003

    work page doi:10.1016/j.comcom.2018.04 2018

  24. [24]

    Neuro- computing (2016) https://doi.org/10.1016/j.neucom.2016.02.031

    Corneli, M., Latouche, P., Rossi, F.: Exact icl maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks. Neuro- computing (2016) https://doi.org/10.1016/j.neucom.2016.02.031

    work page doi:10.1016/j.neucom.2016.02.031 2016

  25. [25]

    Social Network Analysis and Mining (2016) https://doi.org/10.1007/s13278-016-0368-3

    Corneli, M., Latouche, P., Rossi, F.: Block modelling in dynamic networks with 33 non-homogeneous poisson processes and exact icl. Social Network Analysis and Mining (2016) https://doi.org/10.1007/s13278-016-0368-3

    work page doi:10.1007/s13278-016-0368-3 2016

  26. [26]

    Biometrika (2018) https://doi.org/10

    Matias, C., Rebafka, T., Villers, F.: A semiparametric extension of the stochas- tic block model for longitudinal networks. Biometrika (2018) https://doi.org/10. 1093/biomet/asy016

    2018

  27. [27]

    Nature Communications (2017) https://doi.org/ 10.1038/s41467-017-00148-9

    Peixoto, T.P., Rosvall, M.: Modelling sequences and temporal networks with dynamic community structures. Nature Communications (2017) https://doi.org/ 10.1038/s41467-017-00148-9

    work page doi:10.1038/s41467-017-00148-9 2017

  28. [28]

    Time (2023) https://doi.org/ 10.48550/arxiv.2308.10801

    Baudin, A., Tabourier, L., Magnien, C.: Lscpm: communities in massive real- world link streams by clique percolation method. Time (2023) https://doi.org/ 10.48550/arxiv.2308.10801

    work page doi:10.48550/arxiv.2308.10801 2023

  29. [29]

    Science Advances (2022) https://doi.org/10.1126/sciadv.abj3063

    Bovet, A., Delvenne, J.-C., Lambiotte, R., Bovet, A., Delvenne, J.-C., Lambiotte, R.: Flow stability for dynamic community detection. Science Advances (2022) https://doi.org/10.1126/sciadv.abj3063

    work page doi:10.1126/sciadv.abj3063 2022

  30. [30]

    Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E74, 016110 (2006) https://doi.org/10.1103/PhysRevE.74.016110

    work page doi:10.1103/physreve.74.016110 2006

  31. [31]

    Pro- ceedings of the National Academy of Sciences of the United States of America (2007) https://doi.org/10.1073/pnas.0605965104

    Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Pro- ceedings of the National Academy of Sciences of the United States of America (2007) https://doi.org/10.1073/pnas.0605965104

    work page doi:10.1073/pnas.0605965104 2007

  32. [32]

    Physical Review Letters100(11) (2008) https://doi.org/10.1103/physrevlett.100

    Leicht, E.A., Newman, M.E.J.: Community structure in directed networks. Physical Review Letters100(11) (2008) https://doi.org/10.1103/physrevlett.100. 118703

    work page doi:10.1103/physrevlett.100 2008

  33. [33]

    Phys- ical Review E76(6) (2007) https://doi.org/10.1103/physreve.76.066102

    Barber, M.J.: Modularity and community detection in bipartite networks. Phys- ical Review E76(6) (2007) https://doi.org/10.1103/physreve.76.066102

    work page doi:10.1103/physreve.76.066102 2007

  34. [34]

    HAL (Le Centre pour la Communication Scientifique Directe) (2015)

    Dugu´ e, N., Perez, A.: Directed louvain : maximizing modularity in directed networks. HAL (Le Centre pour la Communication Scientifique Directe) (2015)

    2015

  35. [35]

    Physica A-statistical Mechanics and Its Applications (2018) https:// doi.org/10.1016/j.physa.2017.11.089

    Zhou, C., Feng, L., Zhao, Q.: A novel community detection method in bipartite networks. Physica A-statistical Mechanics and Its Applications (2018) https:// doi.org/10.1016/j.physa.2017.11.089

    work page doi:10.1016/j.physa.2017.11.089 2018

  36. [36]

    arXiv: Social and Information Networks (2019) https://doi.org/10.1007/978-3-030-23495-9 3

    Latapy, M., Magnien, C., Viard, T.: Weighted, bipartite, or directed stream graphs for the modeling of temporal networks. arXiv: Social and Information Networks (2019) https://doi.org/10.1007/978-3-030-23495-9 3

    work page doi:10.1007/978-3-030-23495-9 2019

  37. [37]

    The European Physical Journal Special Topics178(1), 13–23 (2009) https://doi.org/10.1140/ epjst/e2010-01179-1 34

    Rosvall, M., Axelsson, D., Bergstrom, C.T.: The map equation. The European Physical Journal Special Topics178(1), 13–23 (2009) https://doi.org/10.1140/ epjst/e2010-01179-1 34

    2009

  38. [38]

    Uporabna informatika28(2020) https://doi.org/10

    Svete, A., Hostnik, J., ˇSubelj, L.: It is not just about the melody: How europe votes for its favourite songs. Uporabna informatika28(2020) https://doi.org/10. 31449/upinf.vol28.num2.85

    2020

  39. [39]

    Journal of computational social science (2018) https://doi.org/10.1007/s42001-018-0020-2

    Mantzaris, A.V., Rein, S.R., Hopkins, A.D.: Preference and neglect amongst coun- tries in the eurovision song contest. Journal of computational social science (2018) https://doi.org/10.1007/s42001-018-0020-2

    work page doi:10.1007/s42001-018-0020-2 2018

  40. [40]

    Advances in Complex Systems (2013) https://doi.org/10.1142/ s0219525913500379

    Garcia, D., Tanase, D.: Measuring cultural dynamics through the eurovision song contest. Advances in Complex Systems (2013) https://doi.org/10.1142/ s0219525913500379

    2013

  41. [41]

    Connections 27(2007)

    Dekker, A.: The eurovision song contest as a ’friendship’ network 1. Connections 27(2007)

    2007

  42. [42]

    Transportation Research Part E Logistics and Transportation Review (2025) https://doi.org/10.1016/j.tre.2025.104634

    Chen, B., Hu, S., Xu, X., Wang, G., Lee, D.-H., He, Z.: A survey of multi-modal urban transportation network resilience: modeling, evaluation, and optimization. Transportation Research Part E Logistics and Transportation Review (2025) https://doi.org/10.1016/j.tre.2025.104634

    work page doi:10.1016/j.tre.2025.104634 2025

  43. [43]

    Systems (2025) https://doi

    Rakhmangulov, A., Osintsev, N., Mishkurov, P.: Spatio-temporal graphs in trans- portation: Challenges, optimization, and prospects. Systems (2025) https://doi. org/10.3390/systems13040263

    work page doi:10.3390/systems13040263 2025

  44. [44]

    Physica A: Statistical Mechanics and its Applications (2022) https://doi.org/10.1016/j.physa.2022.128063

    Zhang, M., Huang, T., Guo, Z., He, Z.: Complex-network-based traffic network analysis and dynamics: A comprehensive review. Physica A: Statistical Mechanics and its Applications (2022) https://doi.org/10.1016/j.physa.2022.128063

    work page doi:10.1016/j.physa.2022.128063 2022

  45. [45]

    Travel Behaviour and Society (2023) https://doi.org/10.1016/j.tbs.2022.12.009

    Zhao, Y., Chen, B.Y., Gao, F., Zhu, X.: Dynamic community detection con- sidering daily rhythms of human mobility. Travel Behaviour and Society (2023) https://doi.org/10.1016/j.tbs.2022.12.009

    work page doi:10.1016/j.tbs.2022.12.009 2023

  46. [46]

    PLoS ONE (2021) https://doi.org/10.1371/journal.pone

    Xie, C., Yu, D., Zheng, X., Wang, Z., Jiang, Z.: Revealing spatiotemporal travel demand and community structure characteristics with taxi trip data: A case study of new york city. PLoS ONE (2021) https://doi.org/10.1371/journal.pone. 0259694

    work page doi:10.1371/journal.pone 2021

  47. [47]

    Transportation Research Part C-emerging Technologies (2018) https://doi.org/10.1016/j.trc.2018.02.015

    Yildirimoglu, M., Kim, J.: Identification of communities in urban mobility net- works using multi-layer graphs of network traffic. Transportation Research Part C-emerging Technologies (2018) https://doi.org/10.1016/j.trc.2018.02.015

    work page doi:10.1016/j.trc.2018.02.015 2018

  48. [48]

    Applied Network Science (2020) https://doi.org/10.1007/s41109-020-00317-8

    Cruickshank, I.J., Carley, K.M.: Characterizing communities of hashtag usage on twitter during the 2020 covid-19 pandemic by multi-view clustering. Applied Network Science (2020) https://doi.org/10.1007/s41109-020-00317-8

    work page doi:10.1007/s41109-020-00317-8 2020

  49. [49]

    Social Network Analysis 35 and Mining (2019) https://doi.org/10.1007/s13278-019-0566-x

    Azaouzi, M., Rhouma, D., Romdhane, L.B.: Community detection in large-scale social networks: state-of-the-art and future directions. Social Network Analysis 35 and Mining (2019) https://doi.org/10.1007/s13278-019-0566-x

    work page doi:10.1007/s13278-019-0566-x 2019

  50. [50]

    WIREs Data Mining Knowl

    Bedi, P., Sharma, C.: Community detection in social networks. WIREs Data Mining Knowl. Discov. (2016) https://doi.org/10.1002/widm.1178

    work page doi:10.1002/widm.1178 2016

  51. [51]

    i’m in the bluesky tonight

    Failla, A., Rossetti, G.: “i’m in the bluesky tonight”: Insights from a year worth of social data. PLOS ONE19(2024) https://doi.org/10.1371/journal.pone.0310330 36

    work page doi:10.1371/journal.pone.0310330 2024