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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
