Affiliation:
1. Department of Business Technology and Operations, Vrije Universiteit Brussel (VUB), Pleinlaan 2 , 1050 Brussels , Belgium
Abstract
Abstract
Monotone matrices are stochastic matrices that satisfy the monotonicity conditions as introduced by Daley in 1968. Monotone Markov chains are useful in modeling phenomena in several areas. Most previous work examines the embedding problem for Markov chains within the entire set of stochastic transition matrices, and only a few studies focus on the embeddability within a specific subset of stochastic matrices. This article examines the embedding in a discrete-time monotone Markov chain, i.e., the existence of monotone matrix roots. Monotone matrix roots of
(
2
×
2
)
\left(2\times 2)
monotone matrices are investigated in previous work. For
(
3
×
3
)
\left(3\times 3)
monotone matrices, this article proves properties that are useful in studying the existence of monotone roots. Furthermore, we demonstrate that all
(
3
×
3
)
\left(3\times 3)
monotone matrices with positive eigenvalues have an
m
m
th root that satisfies the monotonicity conditions (for all values
m
∈
N
,
m
≥
2
m\in {\mathbb{N}},m\ge 2
). For monotone matrices of order
n
>
3
n\gt 3
, diverse scenarios regarding the matrix roots are pointed out, and interesting properties are discussed for block diagonal and diagonalizable monotone matrices.
Subject
Geometry and Topology,Algebra and Number Theory
Reference29 articles.
1. G. Elfving, Zur theorie der Markoffschen ketten, Acta Social Sci. Fennicae n. Ser. A. 8 (1937), no. 2, 1–17.
2. J. F. C. Kingman, The imbedding problem for finite Markov chains, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 1 (1962), no. 1, 14–24.
3. B. Singer and S. Spilerman, The representation of social processes by Markov chains, Am. J. Sociol. 82 (1976), 1–54.
4. B. Singer and S. Spilerman, Social mobility models for heterogeneous populations, Sociological Methodology, Wiley, New Jersy, 5 (1973–1974) 356–401.
5. N. J. Higham, Functions of Matrices: Theory and Computation, 2008, SIAM, Philadelphia.