Mixed evolutionary strategies imply coexisting opinions on networks
Physical Review EPublished 23 January 2008
Lang Cao, Xiang Li
Citations27
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An evolutionary battle-of-the-sexes game is proposed to model the opinion formation on networks, indicating that the individuals of a community (or modular) structured network are prone to form coexisting opinions, and the coexistence of mixed evolutionary strategies implies the modularity of networks.
Abstract
An evolutionary battle-of-the-sexes game is proposed to model the opinion formation on networks. The individuals of a network are partitioned into different classes according to their unaltered opinion preferences, and their factual opinions are considered as the evolutionary strategies, which are updated with the birth-death or death-birth rules to imitate the process of opinion formation. The individuals finally reach a consensus in the dominate opinion or fall into (quasi)stationary fractions of coexisting mixed opinions, presenting a phase transition at the critical modularity of the multiclass individuals' partitions on networks. The stability analysis on the coexistence of mixed strategies among multiclass individuals is given, and the analytical predictions agree well with the numerical simulations, indicating that the individuals of a community (or modular) structured network are prone to form coexisting opinions, and the coexistence of mixed evolutionary strategies implies the modularity of networks.
Keywords
Social SciencesPhysics and Astronomy
SIAM ReviewThe Structure and Function of Complex Networks
18,742 Citations2003Michael Newman
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
American Mathematical Society eBooksTheory of games and economic behavior
16,943 Citations2019Stephan Ramon Garcia, Steven J. Miller
Proceedings of the National Academy of SciencesCommunity structure in social and biological networks
15,656 Citations2002Michelle Girvan, M. E. J. Newman
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Physical Review EFinding and evaluating community structure in networks
13,892 Citations2004Michelle G. Newman, Michelle Girvan
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Cambridge University Press eBooksEvolutionary Games and Population Dynamics
5,603 Citations1998Josef Hofbauer, Karl Sigmund
In this book the authors investigate the nonlinear dynamics of the self-regulation of social and economic behavior, and of the closely related interactions among species in ecological communities.
Princeton University Press eBooksIncorporating Fairness into Game Theory and Economics
4,421 Citations2011Matthew Rabin
NatureA simple rule for the evolution of cooperation on graphs and social networks
2,241 Citations2006Hisashi Ohtsuki, Christoph Hauert +2 more
A surprisingly simple rule is described that is a good approximation for all graphs that are analysed, including cycles, spatial lattices, random regular graphs, random graphs and scale-free networks: natural selection favours cooperation if the benefit of the altruistic act, b, exceeds the average number of neighbours, k, which means b/c > k.
Physical Review EFinding local community structure in networks
789 Citations2005Aaron Clauset
This work defines both a measure of local community structure and an algorithm that infers the hierarchy of communities that enclose a given vertex by exploring the graph one vertex at a time, and uses this algorithm to extract meaningful local clustering information in the large recommender network of an online retailer.
Physical Review ENonequilibrium phase transition in the coevolution of networks and opinions
598 Citations2006Petter Holme, M. E. J. Newman
A simple model of the convergence of opinion in social systems, with a single parameter controlling the balance of the two processes, that undergoes a continuous phase transition as this parameter is varied, from a regime in which opinions are arbitrarily diverse to one in which most individuals hold the same opinion.
Journal of Theoretical BiologyThe replicator equation on graphs
459 Citations2006Hisashi Ohtsuki, Martin A. Nowak
A differential equation is derived which describes how the average frequency of each strategy on the graph changes over time, and is a replicator equation with a transformed payoff matrix, which results in a transformation of the payoff matrix.
Physical Review LettersDynamics of Majority Rule in Two-State Interacting Spin Systems
449 Citations2003P. L. Krapivsky, S. Redner
A two-state opinion dynamics model where agents evolve by majority rule is introduced, where a group of agents is specified whose members then all adopt the local majority state.
Physical Review EMethod to find community structures based on information centrality
294 Citations2004Santo Fortunato, Vito Latora +1 more
An algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality is developed that is very effective especially when the communities are very mixed and hardly detectable by the other methods.
Physical Review ELocal method for detecting communities
292 Citations2005James P. Bagrow, Erik M. Bollt
A method of community detection that is computationally inexpensive and possesses physical significance to a member of a social network is proposed and is local in the sense that a community can be detected within a network without requiring knowledge of the entire network.
Physical Review LettersBreaking the Symmetry between Interaction and Replacement in Evolutionary Dynamics on Graphs
275 Citations2007Hisashi Ohtsuki, Martin A. Nowak +1 more
It is found it is always harder for cooperators to evolve whenever the two graphs do not coincide, and the dynamics on both graphs is given by a replicator equation with a rescaled payoff matrix in a rescaling time.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsDistance, dissimilarity index, and network community structure
271 Citations2003Haijun Zhou
This work calculates the dissimilarity index between nearest-neighboring vertices of a network and design an algorithm to partition these vertices into communities that are hierarchically organized, and identifies many clusters that have well defined biological functions.
Physical Review EDetecting complex network modularity by dynamical clustering
230 Citations2007Stefano Boccaletti, Mikhail Ivanchenko +3 more
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsMajority versus minority dynamics: Phase transition in an interacting two-state spin system
118 Citations2003Mauro Mobilia, S. Redner
In one dimension and within a Kirkwood decoupling scheme, the final magnetization in a finite-length system has a nontrivial dependence on the initial magnetization for all p not equal p(c), in agreement with numerical results.
Physica D Nonlinear PhenomenaWhen are networks truly modular?
117 Citations2006Jörg Reichardt, Stefan Bornholdt
The mapping of the community detection problem onto finding the ground state of a spin glass is exploited in order to derive analytical expressions for the expected modularity in random graphs and assess the theoretical limits to community detection.
Physical Review EMajority model on a network with communities
111 Citations2007Renaud Lambiotte, Marcel Ausloos +1 more
This work focuses on the majority model in a topology consisting of two coupled fully connected networks, thereby mimicking the existence of communities in social networks, and shows that a transition takes place at a value of the interconnectivity parameter.
Physica A Statistical Mechanics and its ApplicationsReal space renormalization group and totalitarian paradox of majority rule voting
98 Citations2000Serge Galam