mlsanityData to 7 Oct 2026

Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys

arXiv 1506.03645 ↗First posted 11 Jun 2015physics.soc-ph cs.SIcited by 59

Not on the map. Why?

Abstract (arXiv)

Given their importance in shaping social networks and determining how information or diseases propagate in a population, human interactions are the subject of many data collection efforts. To this aim, different methods are commonly used, from diaries and surveys to wearable sensors. These methods show advantages and limitations but are rarely compared in a given setting. As surveys targeting friendship relations might suffer less from memory biases than contact diaries, it is also interesting to explore how daily contact patterns compare with friendship relations and with online social links. Here we make progresses in these directions by leveraging data from a French high school: face-to-face contacts measured by two concurrent methods, sensors and diaries; self-reported friendship surveys; Facebook links. We compare the data sets and find that most short contacts are not reported in diaries while long contacts have larger reporting probability, with a general tendency to overestimate durations. Measured contacts corresponding to reported friendship can have durations of any length but all long contacts correspond to reported friendships. Online links not associated to reported friendships correspond to short face-to-face contacts, highlighting the different nature of reported friendships and online links. Diaries and surveys suffer from a low sampling rate, showing the higher acceptability of sensor-based platform. Despite the biases, we found that the overall structure of the contact network, i.e., the mixing patterns between classes, is correctly captured by both self-reported contacts and friendships networks. Overall, diaries and surveys tend to yield a correct picture of the structural organization of the contact network, albeit with much less links, and give access to a sort of backbone of the contact network corresponding to the strongest links in terms of cumulative durations.

Key facts. Cited by 59 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jun 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 12; 2022: 14; 2023: 12; 2024: 10; 2025: 8; 2026: 3.

59 papers.

Sort:

  1. 2021A Comprehensive Survey on Community Detection with Deep Learningcited by 63
  2. 2021Generative hypergraph clustering: from blockmodels to modularitycited by 48
  3. 2022Learning Causal Effects on Hypergraphscited by 31
  4. 2023Deep Temporal Graph Clusteringcited by 28
  5. 2022Scalable Spectral Clustering with Group Fairness Constraintscited by 16
  6. 2022Inference of hyperedges and overlapping communities in hypergraphscited by 13
  7. 2021Local Hyper-Flow Diffusioncited by 8
  8. 2023Structure and inference in hypergraphs with node attributescited by 7
  9. 2021Disentangling homophily, community structure and triadic closure in networkscited by 6
  10. 2022Koopman-based spectral clustering of directed and time-evolving graphscited by 6
  11. 2023CAT-Walk: Inductive Hypergraph Learning via Set Walkscited by 6
  12. 2021Alignment and stability of embeddings: measurement and inference improvementcited by 4
38 more
  1. 2021A Bayesian generative neural network framework for epidemic inference problemscited by 4
  2. 2022Nonbacktracking spectral clustering of nonuniform hypergraphscited by 4
  3. 2023Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphscited by 4
  4. 2024Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clusteringcited by 4
  5. 2021Hyperedge Prediction using Tensor Eigenvalue Decompositioncited by 3
  6. 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labelscited by 3
  7. 2023Learning the effective order of a hypergraph dynamical systemcited by 3
  8. 2023Spectral Normalized-Cut Graph Partitioning with Fairness Constraintscited by 3
  9. 2024An embedding-based distance for temporal graphscited by 3
  10. 2024Modularity Based Community Detection in Hypergraphscited by 3
  11. 2025Broad Spectrum Structure Discovery in Large-Scale Higher-Order Networkscited by 3
  12. 2024Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breakingcited by 2
  13. 2024Longitudinal Modularity, a Modularity for Link Streamscited by 2
  14. 2022Systematic assessment of the quality of fit of the stochastic block model for empirical networkscited by 1
  15. 2022Multivariate Analysis for Multiple Network Data via Semi-Symmetric Tensor PCAcited by 1
  16. 2023Graph Neural Network Surrogates of Fair Graph Filteringcited by 1
  17. 2023When Does Bottom-up Beat Top-down in Hierarchical Community Detection?cited by 1
  18. 2023Dual Node and Edge Fairness-Aware Graph Partitioncited by 1
  19. 2024Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Modelscited by 1
  20. 2024Redefining Event Types and Group Evolution in Temporal Datacited by 1
  21. 2026Deep Temporal Graph Clustering: A Comprehensive Benchmark and Datasetscited by 1
  22. 2021Exploring and mining attributed sequences of interactionscited by 0
  23. 2021SINGA-Easy: An Easy-to-Use Framework for MultiModal Analysiscited by 0
  24. 2021VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Searchcited by 0
  25. 2021Text is NOT Enough: Integrating Visual Impressions into Open-domain Dialogue Generationcited by 0
  26. 2021Love tHy Neighbour: Remeasuring Local Structural Node Similarity in Hypergraph-Derived Networkscited by 0
  27. 2022Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectorscited by 0
  28. 2022Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networkscited by 0
  29. 2022Explanation-Guided Fairness Testing through Genetic Algorithmcited by 0
  30. 2022Using Graph Neural Networks for Program Terminationcited by 0
  31. 2022Adversarial contamination of networks in the setting of vertex nomination: a new trimming methodcited by 0
  32. 2022Reconstructing signed relations from interaction datacited by 0
  33. 2023Tribe or Not? Critical Inspection of Group Differences Using TribalGramcited by 0
  34. 2023HyperS2V: A Framework for Structural Representation of Nodes in Hyper Networkscited by 0
  35. 2023Effectiveness of probabilistic contact tracing in epidemic containment: the role of super-spreaders and transmission path reconstructioncited by 0
  36. 2024Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithmscited by 0
  37. 2024Scaling up Dynamic Edge Partition Models via Stochastic Gradient MCMCcited by 0
  38. 2024Federated Temporal Graph Clusteringcited by 0

50 most cited of 59 All 59 (JSON)