A Bayesian framework with MCMC inference infers signed social networks from contact patterns by separating chance non-interactions from active avoidance using interaction group models.
A probabilistic proof of an asymptotic for- mula for the number of labelled regular graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inferring signed social networks from contact patterns
A Bayesian framework with MCMC inference infers signed social networks from contact patterns by separating chance non-interactions from active avoidance using interaction group models.