Monotone mobility matrices
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in The Journal of Mathematical Sociology
- Vol. 15 (3-4) , 173-191
- https://doi.org/10.1080/0022250x.1990.9990068
Abstract
The transition matrix of a discrete Markov chain is called monotone if each row stochastically dominates the row above it. Monotonicity is an ideal assumption to impose on a Markov chain model of mobility. Monotonicity is behaviorally weak yet mathematically strong. It is behaviorally weak in the sense that it is theoretically plausible and is empirically supported. It is mathematically strong in the sense that monotone Markov chains have a number of convenient mathematical properties. This paper reviews the convenient properties and applies the monotonicity concept to immobility measurement.Keywords
This publication has 7 references indexed in Scilit:
- Comparative statics for markov chainsJournal of Economic Dynamics and Control, 1985
- Generalization of a fundamental matrixLinear Algebra and its Applications, 1981
- Eigenvalue immobility measures for Markov chains1The Journal of Mathematical Sociology, 1979
- The Measurement of MobilityEconometrica, 1978
- Monotone matrices and monotone Markov processesStochastic Processes and their Applications, 1977
- Income Mobility and the Markov AssumptionThe Economic Journal, 1976
- A Stochastic Analysis of the Size Distribution of FirmsJournal of the American Statistical Association, 1958