Skip to main navigation Skip to search Skip to main content

Inferring signed social networks from contact patterns

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

Social networks are typically inferred from indirect observations, such as proximity data; yet, most methods cannot distinguish between absent relationships and actual negative ties, as both can result in few or no interactions. We address the challenge of inferring signed networks from contact patterns while accounting for whether a lack of interactions reflects a lack of opportunity as opposed to active avoidance. We develop a Bayesian framework with Markov Chain Monte Carlo inference that models interaction groups to separate chance from choice when no interactions are observed. Validation on synthetic data demonstrates superior performance compared to natural baselines, particularly in detecting negative edges. We apply our method to French high school contact data to reveal a structure consistent with friendship surveys and demonstrate the model's adequacy through posterior predictive checks.
Original languageEnglish
Article number025018
Number of pages19
JournalJournal of Physics: Complexity
Volume7
Issue number2
DOIs
Publication statusPublished - 1 Jun 2026

Keywords

  • signed networks
  • network reconstruction
  • Bayesian inference
  • MODEL

Fingerprint

Dive into the research topics of 'Inferring signed social networks from contact patterns'. Together they form a unique fingerprint.

Cite this