Voting models in random networks
Name
Yildiz-2010-Voting models in random networks.pdf
Size
661.29 KB
Format
Adobe PDF
Checksum (MD5)
97c1b8db61d5d682b96a1bb133a358ae
Author(s)
Ozdaglar, Asuman E.
Yildiz, Mehmet E.
Pagliari, Roberto
Scaglione, Anna
Date Issued
January 2010
Journal
Information Theory and Applications Workshop (ITA), 2010
Publisher
Institute of Electrical and Electronics Engineers
Citation
Yildiz, M.E. et al. “Voting models in random networks.” Information Theory and Applications Workshop (ITA), 2010. 2010. 1-7. ©2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITA.2010.5454090
