Departmental Papers (ESE)

Abstract

In this paper, we consider a consensus seeking process based on local averaging of opinions in a dynamic model of social network formation. At each time step, individual agents randomly choose another agent to interact with. The interaction is one-sided and results in the agent averaging her opinion with that of her randomly chosen neighbor. Once an agent chooses a neighbor, the probabilities of interactions are updated in such a way that prior interactions are reinforced and future interactions become more likely, resulting in a random consensus process in which networks are highly correlated with each other. Using results of Skyrm and Pemantle and utilizing the de Finetti representation theorem as well as properties of Polya urn processes, we show that this highly correlated process is equivalent to a mixture of i.i.d. processes whose parameters are drawn from a random limit distribution. Therefore, prior results on consensus on i.i.d. processes can be used to show consensus and to compute the statistics of the consensus value in terms of the initial conditions. We provide simple expressions for the mean and the variance of the asymptotic random consensus value in terms of the number of nodes. We also show that the variance converges to a factor of the empirical variance of the initial values that depends only on the size of the network and goes to zero as the size of the network grows.

Document Type

Conference Paper

Subject Area

GRASP

Date of this Version

12-2011

Comments

Fazeli, A. & Jadbabaie, A. (2011). On consensus in a correlated model of network formation based on a Polya urn process. Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), pp.2341-2346. doi: 10.1109/CDC.2011.6161392

© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Keywords

Consensus, Stochastic Process, Social Networks, Random Networks, Graph Theory

Share

COinS
 

Date Posted: 23 January 2013

This document has been peer reviewed.