G. Korniss

2011

Physical Review E 84(1):011130, 2011

We show how the prevailing majority opinion in a population can be rapidly reversed by a small fraction p of randomly distributed committed agents who consistently proselytize the opposing opinion and are immune to influence. Specifically, we show that when the committed fraction ...MORE ⇓

We show how the prevailing majority opinion in a population can be rapidly reversed by a small fraction p of randomly distributed committed agents who consistently proselytize the opposing opinion and are immune to influence. Specifically, we show that when the committed fraction grows beyond a critical value p(c) ≈ 10%, there is a dramatic decrease in the time T(c) taken for the entire population to adopt the committed opinion. In particular, for complete graphs we show that when p < pc, T(c) ~ exp [α(p)N], whereas for p>p(c), T(c) ~ ln N. We conclude with simulation results for Erdős-Rényi random graphs and scale-free networks which show qualitatively similar behavior.

2009

The Naming Game in social networks: community formation and consensus engineeringPDF

Journal of Economic Interaction and Coordination 4(2):221--235, 2009

Abstract We study the dynamics of the Naming Game (Baronchelli et al. in J Stat Mech Theory Exp P06014, 2006b) in empirical social networks. This stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, ...

2008

Physical Review E 77(1):016111, 2008

We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game {[}Baronchelli , J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared ...MORE ⇓

We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game {[}Baronchelli , J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the naming games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a ``small-world''-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case.

2006

Naming Games in Spatially-Embedded Random NetworksPDF

Proc. AAAI Fall Symposium Series, Interaction and Emergent Phenomena in Societies of Agents, pages 148--155, 2006

We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic ...MORE ⇓

We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a ''small-world''-like network and yielding a significantly reduced time to reach global agreement.