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

arXiv: https://arxiv.org/abs/1506.03645 · HTML: https://mlsanity.com/paper/1506.03645/

## Key facts

- Cited by 60 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Jun 2015.

## Built on by (most cited first, 30 of 60)

- [A Comprehensive Survey on Community Detection with Deep Learning](https://mlsanity.com/paper/2105.12584/) (2021)
- [Generative hypergraph clustering: from blockmodels to modularity](https://mlsanity.com/paper/2101.09611/) (2021)
- [Learning Causal Effects on Hypergraphs](https://mlsanity.com/paper/2207.04049/) (2022)
- [Deep Temporal Graph Clustering](https://mlsanity.com/paper/2305.10738/) (2023)
- [Scalable Spectral Clustering with Group Fairness Constraints](https://mlsanity.com/paper/2210.16435/) (2022)
- [Inference of hyperedges and overlapping communities in hypergraphs](https://mlsanity.com/paper/2204.05646/) (2022)
- [Local Hyper-Flow Diffusion](https://mlsanity.com/paper/2102.07945/) (2021)
- [Structure and inference in hypergraphs with node attributes](https://mlsanity.com/paper/2311.03857/) (2023)
- [Disentangling homophily, community structure and triadic closure in networks](https://mlsanity.com/paper/2101.02510/) (2021)
- [Koopman-based spectral clustering of directed and time-evolving graphs](https://mlsanity.com/paper/2204.02951/) (2022)
- [CAT-Walk: Inductive Hypergraph Learning via Set Walks](https://mlsanity.com/paper/2306.11147/) (2023)
- [A Bayesian generative neural network framework for epidemic inference problems](https://mlsanity.com/paper/2111.03383/) (2021)
- [Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs](https://mlsanity.com/paper/2310.15865/) (2023)
- [Alignment and stability of embeddings: measurement and inference improvement](https://mlsanity.com/paper/2101.07251/) (2021)
- [Nonbacktracking spectral clustering of nonuniform hypergraphs](https://mlsanity.com/paper/2204.13586/) (2022)
- [An embedding-based distance for temporal graphs](https://mlsanity.com/paper/2401.12843/) (2024)
- [Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering](https://mlsanity.com/paper/2402.10756/) (2024)
- [Hyperedge Prediction using Tensor Eigenvalue Decomposition](https://mlsanity.com/paper/2102.04986/) (2021)
- [Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels](https://mlsanity.com/paper/2208.08638/) (2022)
- [Learning the effective order of a hypergraph dynamical system](https://mlsanity.com/paper/2306.01813/) (2023)
- [Spectral Normalized-Cut Graph Partitioning with Fairness Constraints](https://mlsanity.com/paper/2307.12065/) (2023)
- [Modularity Based Community Detection in Hypergraphs](https://mlsanity.com/paper/2406.17556/) (2024)
- [Broad Spectrum Structure Discovery in Large-Scale Higher-Order Networks](https://mlsanity.com/paper/2505.21748/) (2025)
- [Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking](https://mlsanity.com/paper/2402.11339/) (2024)
- [Longitudinal Modularity, a Modularity for Link Streams](https://mlsanity.com/paper/2408.16877/) (2024)
- [Systematic assessment of the quality of fit of the stochastic block model for empirical networks](https://mlsanity.com/paper/2201.01658/) (2022)
- [Multivariate Analysis for Multiple Network Data via Semi-Symmetric Tensor PCA](https://mlsanity.com/paper/2202.04719/) (2022)
- [Graph Neural Network Surrogates of Fair Graph Filtering](https://mlsanity.com/paper/2303.08157/) (2023)
- [When Does Bottom-up Beat Top-down in Hierarchical Community Detection?](https://mlsanity.com/paper/2306.00833/) (2023)
- [Dual Node and Edge Fairness-Aware Graph Partition](https://mlsanity.com/paper/2306.10123/) (2023)

## 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.