Agent-based neutral competition in two-community networks
Kota Ishida, Beata Oborny, Michael T. Gastner

TL;DR
This paper studies how community structure and update rules influence neutral competition dynamics in networks, providing a theoretical framework that aligns with simulations and aids predictions even with incomplete data.
Contribution
It introduces a heterogeneous mean-field theory for neutral competition in two-community networks, accounting for various update limitations and validated by Monte Carlo simulations.
Findings
Community structure affects success probabilities of states.
Update rules influence the time to reach consensus.
Mean-field theory accurately predicts competition outcomes.
Abstract
Competition between alternative states is an essential process in social and biological networks. Neutral competition can be represented by an unbiased random drift process in which the states of vertices (e.g., opinions, genotypes, or species) in a network are updated by repeatedly selecting two connected vertices. One of these vertices copies the state of the selected neighbor. Such updates are repeated until all vertices are in the same "consensus" state. There is no unique rule for selecting the vertex pair to be updated. Real-world processes comprise three limiting factors that can influence the selected edge and the direction of spread: (1) the rate at which a vertex sends a state to its neighbors, (2) the rate at which a state is received by a neighbor, and (3) the rate at which a state can be exchanged through a connecting edge. We investigate how these three limitations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Evolutionary Game Theory and Cooperation
