Location of Repository

The robustness of democracy in Markov chain models

By Fabio Fagnani A and Jean-charles Delvenne B

Abstract

A sequence of irreducible Markov chains with increasing state cardinality is called democratic if the sequence of corresponding invariant probabilities converges to 0 uniformly. Democracy is a relevant property which naturally shows up when we deal with opinion dynamic models and cooperative algorithms over a network: it says that each agent measure/opinion is going to play a negligeable role in the asymptotic behavior of the global system. In this paper we prove a general result which says that, under some technical assumptions, perturbing the transition probabilities from a finite number of vertices of a time-reversible democratic sequence of chains, democracy is preserved. We want to stress the fact that the local perturbation in general breaks the time-reversibility of the chains. The main technical assumption needed in our result is the irreducibility of the limit Markov chains and we show with an example that this assumption is indeed necessary. Keywords: Markov chain; consensus; perturbatio

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.415.1133
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://calvino.polito.it/~fagn... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.