TY - GEN
T1 - Voting models in random networks
AU - Yildiz, Mehmet E.
AU - Pagliari, Roberto
AU - Ozdaglar, Asuman
AU - Scaglione, Anna
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77952677274&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952677274&partnerID=8YFLogxK
U2 - 10.1109/ITA.2010.5454090
DO - 10.1109/ITA.2010.5454090
M3 - Conference contribution
AN - SCOPUS:77952677274
SN - 9781424470143
T3 - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
SP - 419
EP - 425
BT - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
T2 - 2010 Information Theory and Applications Workshop, ITA 2010
Y2 - 31 January 2010 through 5 February 2010
ER -