Stability and monotonicity for interactive Markov chains

Citations Over Time

Abstract

In a Markov chain model of a social process, interest often centers on the distribution of the population by state. One question, the stability question, is whether this distribution converges to an equilibrium value. For an ordinary Markov chain (a chain with constant transition probabilities), complete answers are available. For an interactive Markov chain (a chain which allows the transition probabilities governing each individual to depend on the locations by state of the rest of the population), few stability results are available. This paper presents new results. Roughly, the main result is that an interactive Markov chain with unique equilibrium will be stable if the chain satisfies a certain monotonicity property. The property is a generalization to interactive Markov chains of the standard definition of monotonicity for ordinary Markov chains.

Related Papers

• → An Introduction to Markov Chains(2019)22 cited
• → Weak lumpability in finite Markov chains(1982)23 cited
• → Some Results on the Embeddable Problem for Discrete-Time Markov Models in Manpower Planning(2014)19 cited
• → Stability and monotonicity for interactive Markov chains(1992)21 cited
• → Weak lumpability in finite Markov chains(1982)4 cited