Inferring signed social networks from contact patterns
By: Dávid Ferenczi, Jean-Gabriel Young, Leto Peel
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.
Similar Papers
Model inference for ranking from pairwise comparisons
Social and Information Networks
Figures out who's best from messy game results.
Meso-scale structures in signed networks
Social and Information Networks
Finds hidden patterns in how groups connect.
Negative Ties Highlight Hidden Extremes in Social Media Polarization
Physics and Society
Shows how online arguments reveal extreme users.