Dynamics of diffusion on monoplex and multiplex networks: A message-passing approach
arXiv:2103.09417 · doi:10.1007/s00199-022-01457-x
Abstract
New ideas and technologies adopted by a small number of individuals occasionally spread globally through a complex web of social ties. Here, we present a simple and general approximation method, namely, a message-passing approach, that allows us to describe the diffusion processes on complex networks in an almost exact manner. We consider two classes of binary-action games in each of which the best pure strategy for individual players is characterized as a variant of the threshold rule. We show that the dynamics of diffusion observed on synthetic networks are accurately replicated by the message-passing equation, whose fixed point corresponds to a Nash equilibrium. In contrast, the mean-field method tends to overestimate the size and frequency of diffusion. We extend the framework to analyze multiplex networks in which social interactions take place in multiple layers.
arXiv comment34 pages, 9 figures
References in corpus (16)
- Epidemic processes in complex networks
- Critical phenomena in complex networks
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Optimal network modularity for information diffusion
- High-accuracy approximation of binary-state dynamics on networks
- Multiplexity-facilitated cascades in networks
- Analysis of complex contagions in random multiplex networks
- Network models of financial systemic risk: A review
- The unreasonable effectiveness of tree-based theory for networks with clustering
- Threshold model of cascades in temporal networks
- Kinetics of Social Contagion
- Cascades in multiplex financial networks with debts of different seniority
- Trend-driven information cascades on random networks
- Reentrant phase transitions in threshold driven contagion on multiplex networks
- Message-Passing Methods for Complex Contagions
- Coordination problems on networks revisited: statics and dynamics