Monotone mobility matrices
Bibliographic Data
| ID | 10142395 |
|---|---|
| Authors | John Conlisk (University of California San Diego, corresponding author) |
| Year | 1990 |
| Volume | 15 |
| Issue | 3-4 |
| Pages | 173-191 |
| Publication date | 1990-01-01 |
| Peer Reviewed | Yes |
| Open Access | No |
| Type | ARTICLE |
| Venue | Journal of Mathematical Sociology (JOURNAL) |
| Journal identifiers | ISSN: 0022-250X • E-ISSN: 1545-5874 |
| Publisher | Taylor & Francis (PUBLISHER • GB) |
| DOI | 10.1080/0022250x.1990.9990068 |
| OpenAlex | W2004363029 |
| Language | EN |
| Citations received | 5 |
| References cited | 7 |
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
Balance equation · Chain (unit · Discrete mathematics · Ideal (ethics · Markov chain · Markov model · Markov process · Mathematical analysis · Mathematical economics · Monotone polygon · Monotonic function · Pure mathematics · Statistics · Stochastic matrix · Applied Mathematics · Mathematics · Probability and Risk Models · Random Matrices and Applications · Stochastic processes and statistical mechanics
| Unique citing works | 5 |
|---|---|
| Citations per year | 0.15 |
| Citation span | 1992 - 2008 (17) |
| Citation velocity | historical |
| Highly cited | No |
| Citation types | Neutral: 4 |