Reconstructing networks from simple and complex contagions

Abstract

Network scientists often use complex dynamic processes to describe network contagions, but tools for fitting contagion models typically assume simple dynamics. Here, we address this gap by developing a nonparametric method to reconstruct a network and dynamics from a series of node states, using a model that breaks the dichotomy between simple pairwise and complex neighborhood-based contagions. We then show that a network is more easily reconstructed when observed through the lens of complex contagions if it is dense or the dynamic saturates, and that simple contagions are better otherwise.

8 pages, 5 figures

References in corpus (13)

• Epidemic spreading in scale-free networks
• Cooperative Game Theory Approaches for Network Partitioning
• Universal behavior in a generalized model of contagion
• Properties of highly clustered networks
• Inferring Network Topology from Complex Dynamics
• Network reconstruction and community detection from dynamics
• Deep learning of contagion dynamics on complex networks
• Bayesian inference of network structure from unreliable data
• Interacting contagions are indistinguishable from social reinforcement
• A statistical inference approach to structural reconstruction of complex networks from binary time series
• Distinguishing simple and complex contagion processes on networks
• Expectation-Maximizing Network Reconstruction and MostApplicable Network Types Based on Binary Time Series Data
• Nonlinear bias toward complex contagion in uncertain transmission settings