Unanimity Rule on networks
Renaud Lambiotte, Stefan Thurner, Rudolf Hanel
Abstract
We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown that a transition takes place depending on the initial condition of the problem. In particular, a critical number of initially activated nodes is needed so that the whole system gets activated in the long-time limit. The influence of the degree distribution of the nodes is naturally taken into account. For simple network topologies we solve the model analytically, the cases of random, small-world and scale-free are studied in detail.
Create a lesson
Related papers
Distinct routes to phase transitions in spatial activation systems
Jialu Zhang, Guanyu Zhang, Leyang Xue et al.
District-Level Food Environment Indicators and Social Vulnerability in São Paulo
Pedro Lemes Sixel Lobo, Eric Tokuda, Kuruvilla Joseph Abraham et al.
Prompt Sensitivity of Generative Agents: Evidence from an Epidemic Model
Ross Williams, Niyousha Hosseinichimeh
Giant strongly biconnected components of directed networks: a generating function approach
Minsoo Yang, Reinhard Laubenbacher, Byungjoon Min
(k,n)-core percolation on hypergraphs with anchor nodes
Hoseung Jang, Byungjoon Min, Ginestra Bianconi
The complex relationship between anti-immigrant sentiment and exposure in the Netherlands
Benedikt Meylahn, Tommaso Giommoni, Mike Lees et al.