Voting models in random networks

Mehmet E. Yildiz, Roberto Pagliari, Asuman Ozdaglar, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages419-425
Number of pages7
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
CountryUnited States
CitySan Diego, CA
Period1/31/102/5/10

Fingerprint

Social sciences
Marketing
Industry

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Yildiz, M. E., Pagliari, R., Ozdaglar, A., & Scaglione, A. (2010). Voting models in random networks. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings (pp. 419-425). [5454090] https://doi.org/10.1109/ITA.2010.5454090

Voting models in random networks. / Yildiz, Mehmet E.; Pagliari, Roberto; Ozdaglar, Asuman; Scaglione, Anna.

2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 419-425 5454090.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yildiz, ME, Pagliari, R, Ozdaglar, A & Scaglione, A 2010, Voting models in random networks. in 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings., 5454090, pp. 419-425, 2010 Information Theory and Applications Workshop, ITA 2010, San Diego, CA, United States, 1/31/10. https://doi.org/10.1109/ITA.2010.5454090
Yildiz ME, Pagliari R, Ozdaglar A, Scaglione A. Voting models in random networks. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 419-425. 5454090 https://doi.org/10.1109/ITA.2010.5454090
Yildiz, Mehmet E. ; Pagliari, Roberto ; Ozdaglar, Asuman ; Scaglione, Anna. / Voting models in random networks. 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. pp. 419-425
@inproceedings{9e300b9547d6448ab6c88a49911d34c5,
title = "Voting models in random networks",
abstract = "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.",
author = "Yildiz, {Mehmet E.} and Roberto Pagliari and Asuman Ozdaglar and Anna Scaglione",
year = "2010",
doi = "10.1109/ITA.2010.5454090",
language = "English (US)",
isbn = "9781424470143",
pages = "419--425",
booktitle = "2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings",

}

TY - GEN

T1 - Voting models in random networks

AU - Yildiz, Mehmet E.

AU - Pagliari, Roberto

AU - Ozdaglar, Asuman

AU - Scaglione, Anna

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

SP - 419

EP - 425

BT - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

ER -