Asymptotics of a matrix valued Markov chain arising in sociology
We consider a discrete time Markov chain whose state space is the set of all NxN stochastic matrices with zero diagonal entries. This chain models the evolution of relationships among N individuals who exchange gifts according to probabilities determined by previous exchanges. We determine the stable equilibria for this chain, and prove convergence to a mixture of these. In particular, we show that for generic initial states, the chain converges to a randomly chosen set of constellations made up of disjoint stars. Each star has a center, which is the recipient of all gifts from the other individuals in that star, while the center distributes his gifts only to members of his own star.
Year of publication: |
2003
|
---|---|
Authors: | Bonacich, Phillip ; Liggett, Thomas M. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 104.2003, 1, p. 155-171
|
Publisher: |
Elsevier |
Keywords: | Markov chains Exchange networks Reciprocity Randomly chosen maps |
Saved in:
Saved in favorites
Similar items by person
-
The common structure graph : common structural features of a set of graphs
Bonacich, Phillip, (1982)
-
Liggett, Thomas M., (1985)
-
Introduction to mathematical sociology
Bonacich, Phillip, (2012)
- More ...