.png){kind=icon}
.png){kind=icon}
Return
On sociologically derived mathematics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ssresearch.2024.103124.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by empirical studies of labor mobility, in 1970 Sy Spilerman approached me with a question about when a given stochastic matrix, P , can be reached from the identity matrix, I , in a prescribed period of time via the Kolmogorov forward and backward differential equations. A complete answer to this question for time-homogeneous Markov chains was provided in 1976-summarized herein-and a diversity of timeinhomogeneous cases have been studied since then and are reviewed in the present paper. Of particular interest for the future would be solutions for this reachability/embedding problem for mixtures of Markov chains. Also for the future would be studies of partial identifiability of mixtures of Markov chains when their observed transitions do not satisfy reachability/embedding conditions.
Keywords:
EMBEDDING PROBLEM
MARKOV
REPRESENTATION
NUMBER
Journal
IF:
3.5
Papers:
2.6K
Citations:
6.6K
