Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach

Abstract

AbstractNew 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 (sparse) random networks in an almost exact manner. We consider two classes of binary-action games where the best pure strategies for individual players are characterized as variants of the threshold rule. We verify 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, while the conventional mean-field method tends to overestimate the size and frequency of diffusion. Generalized cascade conditions under which a global diffusion can occur are also provided. We extend the framework to analyze multiplex networks in which social interactions take place in multiple layers.