Pith. sign in

REVIEW 4 major objections 4 minor 1 cited by

Community Aware Temporal Network Generation

T0 review · 4 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Pith's one-line read Adding community labels to egocentric temporal patterns lets surrogate networks reproduce the community structure of real face-to-face interactions, matching modularity, label assortativity, and cross-community interaction durations…

desk verdict A clean, incremental extension of ETN-gen that adds node labels and reproduces community mixing statistics, but its headline validation is partly circular and needs an out-of-sample or downstream check. read the letter →

arxiv 2501.07327 v2 pith:PCWJNUNB submitted 2025-01-13 cs.SI physics.soc-ph

classification cs.SIphysics.soc-ph
keywords temporalnetworksface-to-faceinteractionssurrogatecommunitystructurenodelabelsegocentricneighborhoodsnetworkgenerationlabelassortativity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Temporal interaction data from real settings are short, small, and privacy-sensitive, so researchers want surrogate networks that imitate them. This paper argues that previous surrogate generators, while reproducing local temporal patterns, ignore whether interacting nodes belong to different communities or roles, and therefore produce networks with near-random community structure. The authors extend a recent egocentric generator by labeling nodes (from metadata or from detected communities) and encoding those labels into each node's temporal neighborhood signature; the resulting Labeled ETN-gen (LETN) produces surrogates whose modularity, label assortativity, and cross-community interaction durations track the original networks across seven SocioPatterns datasets. If the claim is right, researchers can generate arbitrarily long, arbitrarily large synthetic contact networks with realistic within- and between-community mixing, without exposing real participants' data.

What carries the argument

The load-bearing object is the Labeled Egocentric Temporal Neighborhood Signature (LETNS), a bit string that records, for each neighbor of an ego over a window of k snapshots, the neighbor's label in snapshots where a link exists and a 0 where it does not, with neighbor strings sorted lexicographically and the ego's own label prepended. These encoded signatures are masked over the final snapshot to form keys of probability dictionaries that store the empirical distribution of temporal extensions, with separate dictionaries per local split to capture daily periodicity. During generation, the algorithm samples desired links from these dictionaries for each ego, then validates the provisional layer by accepting bidirectional requests, randomly keeping half of unidirectional ones, and matching remaining stubs to maximize consensus. The label encoding is what carries community information: it lets the same local temporal pattern produce different link choices depending on who is interacting with whom, which is exactly what the unlabeled baseline cannot do.

What would settle it

Generate LETN surrogates after training on only the first half of each dataset, then compute modularity, label assortativity, and mean inter-community interaction durations on the held-out second half; if the surrogate match degrades to the level of ETN-gen on that held-out period, the method has captured training-period patterns rather than transferable temporal behavior. Independently, simulate an epidemic on original and surrogate networks and compare outbreak size and timing; systematic divergence despite matching structural metrics would show the structural fidelity does not carry over to the dynamics the method is meant to support.

Watch

Extended reading notes

Core claim

The central claim is that community and role labels, injected into the egocentric temporal neighborhood encoding, are sufficient to make surrogate temporal networks reproduce the community organization of face-to-face interaction data. Concretely, LETN computes, for each node and window of snapshots, a binary signature that includes the ego's label and the labels of neighbors across the window, sorts these neighbor signatures, and uses the masked signatures to build label-conditioned probability dictionaries per local time split. Sampling from these dictionaries during generation yields networks whose modularity and label assortativity distributions match the original across a primary school, three high schools, a hospital, and two workplaces, while the unlabeled ETN-gen baseline stays near zero modularity on temporal snapshots. The method also reproduces the average duration of interactions between specific community pairs, and, in the hospital, role-specific asymmetries such as nurses' many short contacts versus doctors' fewer long ones.

Load-bearing premise

The load-bearing assumption is that matching the label-conditioned statistics used to build the generator (modularity and label assortativity) counts as evidence of realistic network behavior; since those metrics are direct summaries of the same label interaction preferences the generator encodes, the validation may be circular and may not extend to unmeasured aspects such as dynamics on the network.

Editorial extensions

If this is right

  • Surrogate networks with realistic community structure can be generated at arbitrary temporal length and population size, so epidemic and opinion-dynamics simulations can run beyond the observed data collection window.
  • The generator works both with metadata-given labels and with labels inferred from community detection, so it applies to datasets without role or class annotations.
  • Because community structure emerges from local label-conditioned rules rather than a global layout constraint, the surrogates reproduce the time evolution of modularity, including the daily rise and fall in schools.
  • Role-specific mixing patterns, such as nurse-doctor versus nurse-patient contact durations, are preserved, enabling realistic hospital or workplace interaction simulations.
  • The method gives a direct way to test how community structure affects spreading processes by generating surrogates with matched egocentric statistics but different label mixing.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's main validation metrics, modularity and label assortativity, are direct aggregations of the label-conditioned probabilities the generator encodes, so the match is partly circular; a stronger test would hold out the final days of each dataset and check whether the generated networks still match on that held-out period.
  • The authors do not report downstream dynamics; a natural extension is to run a simple SIR contagion on original and LETN-generated networks and compare epidemic sizes, peak times, and inter-community transmission rates.
  • Because LETN explicitly models label-conditioned mixing, it could be adapted to generate counterfactual contact networks (for example, rewiring cross-class contacts) to study what community configurations would do to spreading or opinion dynamics.
  • The CLETN and DLETN label-inference variants are validated only by snapshot-level Euclidean distances; an independent check would be to compare predictive accuracy on next-snapshot link prediction between LETN and ETN-gen.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript proposes Labeled ETN-gen (LETN), an extension of the ETN-gen surrogate temporal network generator. The method adds node labels (from metadata or community detection) to egocentric temporal neighborhood signatures, builds per-local-split probability dictionaries over masked label-conditioned signatures, and samples new snapshots during generation. The authors evaluate on seven SocioPatterns face-to-face datasets, comparing modularity, label assortativity, interaction duration, and PCA of neighborhood signatures against ETN-gen, and also propose and test CLETN and DLETN variants for label-absent settings. The central claim is that LETN reproduces community interaction structure substantially better than ETN-gen.

Significance. Face-to-face temporal network surrogates with community structure would be useful for privacy-preserving simulations of epidemics and social dynamics, and the proposed extension is conceptually simple and computationally light. The manuscript has strengths: seven public datasets, ten generations per dataset, explicit generation and validation rules, and a useful PCA diagnostic suggesting that LETN signatures separate communities. However, the validity of the central claim rests on metrics (modularity and label assortativity) that are direct aggregate summaries of the label-conditioned statistics the generator is fitted to reproduce; this circularity, together with the absence of hold-out tests, downstream simulations, or an attributed generative baseline, means that the paper does not currently establish realistic behavior beyond the training distribution. The work is a reasonable candidate after substantial validation improvements.

major comments (4)
  1. [Section 2.1 and Section 3, Figures 6-7, Table 2] The main validation metrics are not independent of the fitted statistics. In Section 2.1, the probability dictionaries are computed from masked LETNS strings that include the ego node's label, the neighbor labels, and the masked last-layer bits, so the generator is explicitly fitted to label-pair transition frequencies; modularity computed with the original labels and label assortativity (Figures 6-7, Table 2) are direct aggregate summaries of those same label-pair frequencies. The strong match is therefore substantially built in, and the ETN baseline is expected to fail these metrics because it has no label channel. To support the claim of 'replicating realistic behaviors,' the paper should add at least one validation that does not reuse the training statistics, for example training on the first part of the observation period and evaluating on a held-out temporal segment, simulating a downstream process such as SIR epidemic spread and comparing outbreak statistics, or comparing against an attributed generator such as DyANE (reference [33]).
  2. [Section 3, Table 3] Table 3 reports Euclidean distances between snapshot-level metric curves for LETN, CLETN, and DLETN, but it does not include the ETN baseline, so it cannot support the claim that the labeled method improves temporal tracking; in addition, the snapshot-level values are temporally autocorrelated and the reported mean plus or minus error over ten runs is not a statistical test. Please add an ETN column and paired or bootstrap comparisons, or another appropriate test, to establish that the differences are meaningful.
  3. [Section 3, Table 2 (Hospital row)] The Hospital row of Table 2 shows that LETN does not improve over ETN on the headline metrics (original modularity 0.00 plus or minus 0.20 versus LETN -0.02 plus or minus 0.16 versus ETN -0.11 plus or minus 0.09; label assortativity -0.03 versus -0.07 versus -0.20). The blanket statement in the Introduction and Section 3 that the method 'significantly improves' on ETN-gen should therefore be qualified, and the paper should discuss when metadata labels do not align with community-structured interaction patterns.
  4. [Section 2.3 and Table 3] For the CLETN and DLETN extensions, it is not stated whether the modularity and label assortativity in Table 3 are computed using the originally observed labels or the community-inferred labels. If the inferred labels are used for both the original and generated networks, the comparison is at risk of circularity because the community structure is estimated from the same aggregated data used to build the generator; a null model with shuffled labels or a comparison using the true metadata would clarify the added value.
minor comments (4)
  1. [Figure 4, Panel B] The heatmaps are described as log-scaled but no colorbar is provided; please add a colorbar and specify whether the log scale is base 10 or natural logarithm.
  2. [Figure 5] The mean interaction durations per community pair are shown for a single dataset without confidence intervals; adding error bars or a second dataset would make the duration-reproduction claim quantitative.
  3. [Page 7, Table 1] There is a typo in the table caption: 'T able 1' should read 'Table 1'.
  4. [Abstract and Introduction] The manuscript needs copyediting for grammar and phrasing, for example 'The advantages ... has led' in the abstract should be 'The advantages ... have led'.

Circularity Check

2 steps flagged · score 6.0 of 10

Validation metrics are aggregate summaries of the label-conditioned probabilities the generator is estimated from, so the headline community-structure match is substantially by construction.

  1. fitted input called prediction [Section 2.1, Probability Dictionaries; Section 3, Figures 6-7 and Table 2]
    "Thus, this step is able to model the preferences of nodes with a certain label to interact with nodes with specific labels, also taking into account the time of the interactions."

    The LETNS dictionaries are built by counting masked label-labeled egocentric signatures in the original network, and sampling from them reproduces label-pair interaction frequencies. The headline validation metrics — modularity computed with the original labels and label assortativity — are direct aggregates of the same label-conditioned mixing preferences. Therefore the reported match (LETN close to original, ETN far) is substantially forced by the construction of the probability dictionaries, not an independent test. The paper does not hold out temporal periods, use downstream dynamics, or compare against an attributed baseline such as DyANE, so the central claim of realistically reproducing community interaction structure rests on this circular evidence.

  2. fitted input called prediction [Section 3, Figure 5 and preceding paragraph]
    "Another improvement of the LETN method consists in the ability of our method to better reproduce the duration of the interactions among individuals of different communities."

    With the chosen window k=2, each LETNS encodes for every neighbor whether the link was present in the previous snapshot, and the masked dictionary estimates the probability of an extension conditional on that prior presence. The mean interaction duration between communities, reported in Figure 5, is an aggregate of these same label-conditioned transition probabilities. Reproducing it is therefore also largely built into the fitted input rather than emerging as an independent validation of realistic temporal dynamics.

full rationale

The paper's central validation of LETN is that generated networks match the original on modularity and label assortativity (Figures 6-7, Table 2), and that they reproduce community-conditioned interaction durations (Figure 5). All of these metrics are summaries of label-pair interaction statistics that the generator directly encodes: Section 2.1 constructs probability dictionaries from masked LETNS that include both ego and neighbor labels, and the text states this 'model[s] the preferences of nodes with a certain label to interact with nodes with specific labels.' Matching such summaries is expected from a generator whose input is the empirical label-conditioned transition distribution, so the match is substantially circular as validation. The comparison against ETN-gen, which does not use labels, is not a disconfirmation of the mechanism, because ETN is structurally unable to reproduce label-conditioned statistics. The PCA visualization (Figure 3) and community detection extensions are more independent, but they do not establish the headline claim of realistic generation. The paper does not use hold-out temporal periods, downstream dynamics, or an attributed baseline, so the strongest quantitative evidence is not independent of the training statistics. This is a method whose objective is to reproduce label-conditioned interaction statistics and whose evaluation uses those same statistics; hence a partial but substantive circularity, scored 6 rather than higher because the local egocentric generation rules and stochastic validation steps are not a literal identity with the aggregate metrics.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

No new physical entities or conserved quantities are introduced. The method introduces algorithmic objects (LETN, LETNS, label-conditioned dictionaries), but these are not free-floating entities with independent evidence requirements. The main burden is the two hyperparameters, the local split schedule, and the domain assumptions inherited from ETN-gen.

free parameters (3)
  • k (window size) = 2
    Chosen as optimal in the prior ETN-gen paper [38] and used for all experiments; it controls the temporal context encoded in each signature.
  • gap (snapshot interval) = 300 seconds (5 minutes)
    Chosen as most suited for face-to-face interaction identification; robustness is only checked at 15 minutes. It affects all dictionaries and generated networks.
  • local split schedule = unspecified (hours within days suggested)
    The split granularity determines how periodicity is modeled; the paper says most use cases mean daily moments such as hours, but exact choices per dataset are not given.
assumptions (4)
  • domain assumption Egocentric temporal neighborhood patterns are sufficient building blocks to reproduce global temporal network structure.
    Inherited from ETN-gen; the method assumes local motifs capture enough of the network dynamics to reconstruct global properties.
  • domain assumption The discrete snapshot representation with fixed gap captures the relevant face-to-face interaction dynamics.
    All datasets are binned at 5 minutes, treating interactions within a bin as simultaneous; this is a modeling choice imported from the base method.
  • domain assumption Community labels, whether from metadata or Louvain partitions, are stable and meaningful at the temporal scale used.
    Labels define label assortativity and modularity, and CLETN/DLETN depend on the quality of the community partitions.
  • standard math Lexicographic sorting of temporal signatures removes ordering dependence without losing information.
    Sorting is used as a canonicalization step for dictionary keys; it assumes neighbor order is irrelevant to the interaction patterns.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Community Aware Temporal Network Generation." pith.science (2026). https://pith.science/paper/PCWJNUNB

@misc{pith2026250107327,
  author       = {Pith},
  title        = {Pith review of: Community Aware Temporal Network Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PCWJNUNB}},
  note         = {Machine review of arXiv:2501.07327}
}
read the original abstract

The advantages of temporal networks in capturing complex dynamics, such as diffusion and contagion, has led to breakthroughs in real world systems across numerous fields. In the case of human behavior, face-to-face interaction networks enable us to understand the dynamics of how communities emerge and evolve in time through the interactions, which is crucial in fields like epidemics, sociological studies and urban science. However, state-of-the-art datasets suffer from a number of drawbacks, such as short time-span for data collection and a small number of participants. Moreover, concerns arise for the participants' privacy and the data collection costs. Over the past years, many successful algorithms for static networks generation have been proposed, but they often do not tackle the social structure of interactions or their temporal aspect. In this work, we extend a recent network generation approach to capture the evolution of interactions between different communities. Our method labels nodes based on their community affiliation and constructs surrogate networks that reflect the interactions of the original temporal networks between nodes with different labels. This enables the generation of synthetic networks that replicate realistic behaviors. We validate our approach by comparing structural measures between the original and generated networks across multiple face-to-face interaction datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Modeling memory in time-respecting paths on temporal networks

    physics.soc-ph 2025-11 conditional novelty 6.0 of 10

    A one-parameter 'return to previously visited nodes' model reveals strong memory in time-respecting paths across eight human-proximity datasets, and higher memory slows diffusion.

Reference graph

Works this paper leans on

60 extracted references · 34 canonical work pages · cited by 1 Pith paper

  1. [33]

    In: Proceedings of the 32nd ACM International Conference on Information 17 and Knowledge Management, pp

    Zeno, G., Neville, J.: Dyane: Dynamic attributed node roles generative model. In: Proceedings of the 32nd ACM International Conference on Information 17 and Knowledge Management, pp. 3144–3153 (2023). https://doi.org/10.1145/ 3583780.3614858

  2. [1]

    Oxford University Press, Oxford, United Kingdom (2010)

    Newman, M.: Networks: An Introduction. Oxford University Press, Oxford, United Kingdom (2010). https://doi.org/10.1093/acprof:oso/9780199206650.001. 0001

  3. [2]

    Cambridge University Press, Cambridge, United Kingdom (2016)

    Barabasi, A.-L.: Network Science. Cambridge University Press, Cambridge, United Kingdom (2016). https://networksciencebook.com/

  4. [3]

    Clinical Phar- macology & Therapeutics 88(1), 120–125 (2010) https://doi.org/10.1038/clpt

    Arrell, D., Terzic, A.: Network systems biology for drug discovery. Clinical Phar- macology & Therapeutics 88(1), 120–125 (2010) https://doi.org/10.1038/clpt. 2010.91

  5. [4]

    Nature communications 10(1), 1240 (2019) https://doi.org/10.1038/ s41467-019-09177-y

    Kov´ acs, I.A., Luck, K., Spirohn, K., Wang, Y., Pollis, C., Schlabach, S., Bian, W., Kim, D.-K., Kishore, N., Hao, T., et al.: Network-based prediction of protein interactions. Nature communications 10(1), 1240 (2019) https://doi.org/10.1038/ s41467-019-09177-y

  6. [5]

    Psychological medicine 46(16), 3359–3369 (2016) https://doi.org/10.1017/S0033291716002300

    Beard, C., Millner, A.J., Forgeard, M.J., Fried, E.I., Hsu, K.J., Treadway, M.T., Leonard, C.V., Kertz, S., Bj¨ orgvinsson, T.: Network analysis of depression and anxiety symptom relationships in a psychiatric sample. Psychological medicine 46(16), 3359–3369 (2016) https://doi.org/10.1017/S0033291716002300

  7. [6]

    : Network analysis of multivariate data in psychological science

    Borsboom, D., Deserno, M.K., Rhemtulla, M., Epskamp, S., Fried, E.I., McNally, R.J., Robinaugh, D.J., Perugini, M., Dalege, J., Costantini, G., et al. : Network analysis of multivariate data in psychological science. Nature Reviews Methods Primers 1(1), 58 (2021) https://doi.org/10.1038/s43586-021-00055-w

  8. [7]

    Princeton University Press, Princeton, New Jersey (2008)

    Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton, New Jersey (2008). https://doi.org/10.2307/j.ctvcm4gh1

Show all 60 references
  1. [8]

    The MIT Press, Cambridge, Massachusetts (2013)

    Batty, M.: The New Science of Cities. The MIT Press, Cambridge, Massachusetts (2013). https://doi.org/10.1080/13658816.2014.937717

  2. [9]

    Nature 587(7834), 402–407 (2020) https://doi.org/10.1038/s41586-020-2909-1

    Alessandretti, L., Aslak, U., Lehmann, S.: The scales of human mobility. Nature 587(7834), 402–407 (2020) https://doi.org/10.1038/s41586-020-2909-1

  3. [10]

    EPJ data science11(1), 58 (2022) https://doi.org/10.1140/epjds/s13688-022-00372-4

    Mauro, G., Luca, M., Longa, A., Lepri, B., Pappalardo, L.: Generating mobility networks with generative adversarial networks. EPJ data science11(1), 58 (2022) https://doi.org/10.1140/epjds/s13688-022-00372-4

  4. [11]

    Physical Review X 14(2), 021050 (2024) https://doi.org/10.1103/PhysRevX.14

    Bontorin, S., Cencetti, G., Gallotti, R., Lepri, B., De Domenico, M.: Emergence of complex network topologies from flow-weighted optimization of network efficiency. Physical Review X 14(2), 021050 (2024) https://doi.org/10.1103/PhysRevX.14. 021050

  5. [12]

    Philosophical 15 Transactions of the Royal Society B: Biological Sciences 369(1653), 20130521 (2014) https://doi.org/10.1098/rstb.2013.0521

    Vico Fallani, F., Richiardi, J., Chavez, M., Achard, S.: Graph analysis of func- tional brain networks: practical issues in translational neuroscience. Philosophical 15 Transactions of the Royal Society B: Biological Sciences 369(1653), 20130521 (2014) https://doi.org/10.1098/...

  6. [13]

    Nature neuroscience 20(3), 353– 364 (2017) https://doi.org/10.1038/nn.4502

    Bassett, D.S., Sporns, O.: Network neuroscience. Nature neuroscience 20(3), 353– 364 (2017) https://doi.org/10.1038/nn.4502

  7. [14]

    : Computa- tional social science

    Lazer, D., Pentland, A., Adamic, L., Aral, S., Barab´ asi, A.-L., Brewer, D., Christakis, N., Contractor, N., Fowler, J., Gutmann, M., et al. : Computa- tional social science. Science 323(5915), 721–723 (2009) https://doi.org/10.1126/ science.1167742

  8. [15]

    Nature communications 8(1), 582 (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 8(1), 582 (2017) https: //doi.org/10.1038/s41467-017-00148-9

  9. [16]

    Proceedings of the Royal Society B 288(1959), 20211164 (2021) https://doi.org/10.1098/rspb.2021.1164

    Gelardi, V., Le Bail, D., Barrat, A., Claidiere, N.: From temporal network data to the dynamics of social relationships. Proceedings of the Royal Society B 288(1959), 20211164 (2021) https://doi.org/10.1098/rspb.2021.1164

  10. [17]

    Per- sonal and ubiquitous computing 10, 255–268 (2006) https://doi.org/10.1007/ s00779-005-0046-3

    Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Per- sonal and ubiquitous computing 10, 255–268 (2006) https://doi.org/10.1007/ s00779-005-0046-3

  11. [18]

    Plos One 5((7):e11596) (2010) https://doi.org/10.1371/journal.pone.0011596

    Cattuto, C., Broeck, W., Barrat, A., Colizza, V., Pinton, J.-F., Vespignani, A.: Dynamics of person-to-person interactions from distributed rfid sensor networks. Plos One 5((7):e11596) (2010) https://doi.org/10.1371/journal.pone.0011596

  12. [19]

    Pervasive and mobile computing 7(6), 643–659 (2011) https://doi.org/10.1016/j.pmcj.2011.09.004

    Aharony, N., Pan, W., Ip, C., Khayal, I., Pentland, A.: Social fMRI: Investigating and shaping social mechanisms in the real world. Pervasive and mobile computing 7(6), 643–659 (2011) https://doi.org/10.1016/j.pmcj.2011.09.004

  13. [20]

    Plos One 6((2):e17144) (2011) https://doi.org/10.1371/journal

    Isella, L., Romano, M., Barrat, A., Cattuto, C., Colizza, V., Broeck, W., Gesu- aldo, F., Pandolfi, E., Rav` a, L., Rizzo, C., Tozzi, A.E.: Close encounters in a pediatric ward: Measuring face-to-face proximity and mixing patterns with wearable sensors. Plos One 6((2):e17144) ...

  14. [21]

    PloS one 9(4), 95978 (2014) https://doi.org/10.1371/journal.pone.0095978

    Stopczynski, A., Sekara, V., Sapiezynski, P., Cuttone, A., Madsen, M.M., Larsen, J.E., Lehmann, S.: Measuring large-scale social networks with high resolution. PloS one 9(4), 95978 (2014) https://doi.org/10.1371/journal.pone.0095978

  15. [22]

    : The Mobile Territorial Lab: a multilayered and dynamic view on parents’ daily lives

    Centellegher, S., De Nadai, M., Caraviello, M., Leonardi, C., Vescovi, M., Rama- dian, Y., Oliver, N., Pianesi, F., Pentland, A., Antonelli, F., et al. : The Mobile Territorial Lab: a multilayered and dynamic view on parents’ daily lives. EPJ Data Science 5, 1–19 (2016) https:...

  16. [23]

    In: Proceed- ings of the 2022 CHI Conference on Human Factors in Computing Systems, pp

    Nepal, S., Wang, W., Vojdanovski, V., Huckins, J.F., daSilva, A., Meyer, M., 16 Campbell, A.: COVID student study: A year in the life of college students during the COVID-19 pandemic through the lens of mobile phone sensing. In: Proceed- ings of the 2022 CHI Conference on Huma...

  17. [24]

    Behav- ioral ecology and sociobiology 63, 1057–1066 (2009) https://doi.org/10.1007/ s00265-009-0739-0

    Eagle, N., Pentland, A.S.: Eigenbehaviors: Identifying structure in routine. Behav- ioral ecology and sociobiology 63, 1057–1066 (2009) https://doi.org/10.1007/ s00265-009-0739-0

  18. [25]

    In: Social Informatics: 9th International Confer- ence, SocInfo 2017, Oxford, UK, September 13-15, 2017, Proceedings, Part I 9, pp

    Starnini, M., Lepri, B., Baronchelli, A., Barrat, A., Cattuto, C., Pastor-Satorras, R.: Robust modeling of human contact networks across different scales and proximity-sensing techniques. In: Social Informatics: 9th International Confer- ence, SocInfo 2017, Oxford, UK, Septemb...

  19. [26]

    Journal of medical internet research 21(4), 12251 (2019) https://doi.org/10.2196/12251

    Ozella, L., Gauvin, L., Carenzo, L., Quaggiotto, M., Ingrassia, P.L., Tizzoni, M., Panisson, A., Colombo, D., Sapienza, A., Kalimeri, K., et al.: Wearable proximity sensors for monitoring a mass casualty incident exercise: feasibility study. Journal of medical internet researc...

  20. [27]

    Communications Physics 5(1), 64 (2022) https://doi.org/10.1038/s42005-022-00845-y

    Iacopini, I., Petri, G., Baronchelli, A., Barrat, A.: Group interactions modulate critical mass dynamics in social convention. Communications Physics 5(1), 64 (2022) https://doi.org/10.1038/s42005-022-00845-y

  21. [29]

    Applied Network Science 9(1), 55 (2024) https://doi.org/10.1007/ s41109-024-00665-9

    Lotito, Q.F., Montresor, A., Battiston, F.: Multiplex measures for higher-order networks. Applied Network Science 9(1), 55 (2024) https://doi.org/10.1007/ s41109-024-00665-9

  22. [30]

    Entropy 26(3), 256 (2024) https://doi.org/10.3390/e26030256

    Arregui-Garc ´ ıa, B., Longa, A., Lotito, Q.F., Meloni, S., Cencetti, G.: Patterns in temporal networks with higher-order egocentric structures. Entropy 26(3), 256 (2024) https://doi.org/10.3390/e26030256

  23. [31]

    Journal of Complex Networks 8(4), 039 (2020) https://doi.org/10.1093/comnet/cnz039

    Pereira, L.R., Lopes, R.J., Lou¸ c˜ a, J.: Syntgen: a system to generate temporal networks with user-specified topology. Journal of Complex Networks 8(4), 039 (2020) https://doi.org/10.1093/comnet/cnz039

  24. [32]

    In: Proceedings of the Web Conference 2021, pp

    Zeno, G., La Fond, T., Neville, J.: Dymond: Dynamic motif-nodes network gen- erative model. In: Proceedings of the Web Conference 2021, pp. 718–729 (2021). https://doi.org/10.1145/3442381.3450102

  25. [34]

    Proceedings of the ACM on Networking 2(CoNEXT4), 1–20 (2024) https://doi.org/10.1145/3696407

    C¨ uppers, J., Schoen, A., Blanc, G., Gimenez, P.-F.: Flowchronicle: Synthetic net- work flow generation through pattern set mining. Proceedings of the ACM on Networking 2(CoNEXT4), 1–20 (2024) https://doi.org/10.1145/3696407

  26. [35]

    The European Physical Journal B 88, 1–10 (2015) https://doi.org/10.1140/epjb/e2015-60481-x

    Laurent, G., Saram¨ aki, J., Karsai, M.: From calls to communities: a model for time-varying social networks. The European Physical Journal B 88, 1–10 (2015) https://doi.org/10.1140/epjb/e2015-60481-x

  27. [36]

    In: Proceedings of the 14th International Workshop on Mining and Learning with Graphs, vol

    Purohit, S., Holder, L.B., Chin, G.: Temporal graph generation based on a dis- tribution of temporal motifs. In: Proceedings of the 14th International Workshop on Mining and Learning with Graphs, vol. 7 (2018)

  28. [37]

    arXiv preprint arXiv:2411.05477 (2024) https://doi.org/10

    Cencetti, G., Barrat, A.: Generating surrogate temporal networks from mesoscale building blocks. arXiv preprint arXiv:2411.05477 (2024) https://doi.org/10. 48550/arXiv.2411.05477

  29. [38]

    Communications Physics 7(1), 22 (2024) https://doi.org/10.1038/s42005-023-01517-1

    Longa, A., Cencetti, G., Lehmann, S., Passerini, A., Lepri, B.: Generating fine- grained surrogate temporal networks. Communications Physics 7(1), 22 (2024) https://doi.org/10.1038/s42005-023-01517-1

  30. [39]

    Physical review E68(6), 065103 (2003) https://doi.org/10.1103/PhysRevE.68.065103

    Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Physical review E68(6), 065103 (2003) https://doi.org/10.1103/PhysRevE.68.065103

  31. [40]

    Network Science 8(S1), 4–25 (2020) https://doi.org/10.1017/nws.2020.3

    Hoffman, M., Block, P., Elmer, T., Stadtfeld, C.: A model for the dynamics of face-to-face interactions in social groups. Network Science 8(S1), 4–25 (2020) https://doi.org/10.1017/nws.2020.3

  32. [41]

    The European Physical Journal B 88, 1–6 (2015) https://doi.org/10.1140/epjb/e2015-60549-7

    Stopczynski, A., Sapiezynski, P., Pentland, A., Lehmann, S.: Temporal fidelity in dynamic social networks. The European Physical Journal B 88, 1–6 (2015) https://doi.org/10.1140/epjb/e2015-60549-7

  33. [42]

    Proceedings of the national academy of sciences 113(36), 9977– 9982 (2016) https://doi.org/10.1073/pnas.1602803113

    Sekara, V., Stopczynski, A., Lehmann, S.: Fundamental structures of dynamic social networks. Proceedings of the national academy of sciences 113(36), 9977– 9982 (2016) https://doi.org/10.1073/pnas.1602803113

  34. [43]

    PloS one 8(9), 73970 (2013) https://doi.org/10.1371/journal.pone.0073970

    Vanhems, P., Barrat, A., Cattuto, C., Pinton, J.-F., Khanafer, N., R´ egis, C., Kim, B.-a., Comte, B., Voirin, N.: Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PloS one 8(9), 73970 (2013) https://doi.org/10.1371/journal...

  35. [44]

    Data Mining and Knowledge Discovery 36(1), 355– 378 (2022) https://doi.org/10.1007/s10618-021-00803-2 18

    Longa, A., Cencetti, G., Lepri, B., Passerini, A.: An efficient procedure for mining egocentric temporal motifs. Data Mining and Knowledge Discovery 36(1), 355– 378 (2022) https://doi.org/10.1007/s10618-021-00803-2 18

  36. [45]

    Journal of statistical mechanics: theory and experiment 2008(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 experiment 2008(10), 10008 (2008) https://doi.org/10.1088/1742-5468/2008/10/ P10008

  37. [46]

    Scientific reports 9(1), 1–12 (2019) https://doi.org/ 10.1038/s41598-019-41695-z

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

  38. [47]

    PloS one 6(8), 23176 (2011) https: //doi.org/10.1371/journal.pone.0023176

    Stehl´ e, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J.-F., Quaggiotto, M., Broeck, W., R´ egis, C., Lina, B.,et al.: High-resolution measurements of face- to-face contact patterns in a primary school. PloS one 6(8), 23176 (2011) https: //doi.org/10.1371/jour...

  39. [48]

    BMC infectious diseases 14, 1–10 (2014) https://doi.org/10.1186/s12879-014-0695-9

    Gemmetto, V., Barrat, A., Cattuto, C.: Mitigation of infectious disease at school: targeted class closure vs school closure. BMC infectious diseases 14, 1–10 (2014) https://doi.org/10.1186/s12879-014-0695-9

  40. [49]

    PloS one 9(9), 107878 (2014) https://doi.org/10.1371/journal.pone.0107878

    Fournet, J., Barrat, A.: Contact patterns among high school students. PloS one 9(9), 107878 (2014) https://doi.org/10.1371/journal.pone.0107878

  41. [50]

    PloS one 10(9), 0136497 (2015) https://doi.org/10.1371/ journal.pone.0136497

    Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one 10(9), 0136497 (2015) https://doi.org/10.1371/ journal.pone.0136497

  42. [51]

    Network Science3(3), 326–347 (2015) https: //doi.org/10.1017/nws.2015.10

    G´ enois, M., Vestergaard, C.L., Fournet, J., Panisson, A., Bonmarin, I., Barrat, A.: Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers. Network Science3(3), 326–347 (2015) https: //doi.org/10.1017/nws.2015.10

  43. [52]

    G´ enois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Science 7(1), 1–18 (2018) https://doi.org/10.1140/epjds/ s13688-018-0140-1

  44. [53]

    Philosophical transactions of the royal society A: Mathematical, Physical and Engineering Sciences 374(2065), 20150202 (2016) https://doi.org/ 10.1098/rsta.2015.0202

    Jolliffe, I.T., Cadima, J.: Principal component analysis: a review and recent developments. Philosophical transactions of the royal society A: Mathematical, Physical and Engineering Sciences 374(2065), 20150202 (2016) https://doi.org/ 10.1098/rsta.2015.0202

  45. [54]

    In: Proceedings of the 17th International Conference on World Wide Web, pp

    Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International Conference on World Wide Web, pp. 695–704 (2008). https://doi.org/10.1145/1367497.1367591

  46. [55]

    Journal of theoretical 19 biology 271(1), 166–180 (2011) https://doi.org/10.1016/j.jtbi.2010.11.033

    Isella, L., Stehl´ e, J., Barrat, A., Cattuto, C., Pinton, J.-F., Broeck, W.: What’s in a crowd? analysis of face-to-face behavioral networks. Journal of theoretical 19 biology 271(1), 166–180 (2011) https://doi.org/10.1016/j.jtbi.2010.11.033

  47. [56]

    PLoS computational biology 6(4), 1000736 (2010) https: //doi.org/10.1371/journal.pcbi.1000736

    Salath´ e, M., Jones, J.H.: Dynamics and control of diseases in networks with community structure. PLoS computational biology 6(4), 1000736 (2010) https: //doi.org/10.1371/journal.pcbi.1000736

  48. [57]

    Journal of the Royal Society Interface21(210), 20230471 (2024) https://doi.org/10.1098/rsif.2023.0471

    Cencetti, G., Lucchini, L., Santin, G., Battiston, F., Moro, E., Pentland, A., Lepri, B.: Temporal clustering of social interactions trades-off disease spreading and knowledge diffusion. Journal of the Royal Society Interface21(210), 20230471 (2024) https://doi.org/10.1098/rsi...

  49. [58]

    Information Sciences 621, 672–690 (2023) https://doi.org/10.1016/j.ins.2022.11.101

    Peng, Y., Zhao, Y., Hu, J.: On the role of community structure in evolution of opinion formation: A new bounded confidence opinion dynamics. Information Sciences 621, 672–690 (2023) https://doi.org/10.1016/j.ins.2022.11.101

  50. [59]

    Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 77(3), 036103 (2008) https://doi.org/10.1103/PhysRevE.77.036103

    Danon, L., Arenas, A., Diaz-Guilera, A.: Impact of community structure on information transfer. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 77(3), 036103 (2008) https://doi.org/10.1103/PhysRevE.77.036103

  51. [60]

    Physics reports 469(3), 93–153 (2008) https://doi.org/10

    Arenas, A., D ´ ıaz-Guilera, A., Kurths, J., Moreno, Y., Zhou, C.: Synchronization in complex networks. Physics reports 469(3), 93–153 (2008) https://doi.org/10. 1016/j.physrep.2008.09.002

  52. [61]

    Proceedings of the national academy of sciences 99(12), 7821–7826 (2002) https://doi.org/10.1073/pnas.122653799 20

    Girvan, M., Newman, M.E.: Community structure in social and biological net- works. Proceedings of the national academy of sciences 99(12), 7821–7826 (2002) https://doi.org/10.1073/pnas.122653799 20

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.