Inferring signed social networks from contact patterns

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ferenczi, Dávid, Young, Jean-Gabriel, Peel, Leto
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914554920828928
author Ferenczi, Dávid
Young, Jean-Gabriel
Peel, Leto
author_facet Ferenczi, Dávid
Young, Jean-Gabriel
Peel, Leto
contents 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 lack of interactions reflect a lack of opportunity as opposed to active avoidance. We develop a Bayesian framework with MCMC 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.
format Preprint
id arxiv_https___arxiv_org_abs_2601_10565
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Inferring signed social networks from contact patterns
Ferenczi, Dávid
Young, Jean-Gabriel
Peel, Leto
Social and Information Networks
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 lack of interactions reflect a lack of opportunity as opposed to active avoidance. We develop a Bayesian framework with MCMC 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.
title Inferring signed social networks from contact patterns
topic Social and Information Networks
url https://arxiv.org/abs/2601.10565