Voting models in random networks

A crucial problem of Social Sciences is under what conditions agreement, or disagreement, emerge in a network of interacting agents. This topic has application in many contexts, including business and marketing decisions, with potential impact on information and technological networks. In this paper we consider a particular model of interaction between a group of individuals connected through a network of acquaintances. In the first model, a node waits an exponentially time with parameter one, and when it expires it chooses one of its neighbors' at random and adopts its decision. In the second one, the node chooses the opinion which is the most adopted by its neighbors (hence, majority rule). We show how different updating rule of the agent' state lead to different emerging patterns, namely, agreement and disagreement. In addition, in the case of agreement, we provide bounds on the time to convergence for various types of graphs.

[1]  Fan Chung Graham,et al.  The Spectra of Random Graphs with Given Expected Degrees , 2004, Internet Math..

[2]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[3]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[4]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[5]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  J. Kleinberg.  Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[8]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  T. Murata,et al.  Advanced modularity-specialized label propagation algorithm for detecting communities in networks , 2009, 0910.1154.

[10]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[12]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[13]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[14]  Stefan Grosskinsky Warwick,et al.  Interacting Particle Systems , 2016 .

[15]  J. Kertész,et al.  On the equivalence of the label propagation method of community detection and a Potts model approach , 2008, 0803.2804.