A method of constructing Markov chains on finite state spaces is provided. The chain is specified by three constraints: stationarity, dependence and marginal distributions. The generalized Pythagorean theorem in information geometry plays a central role in the construction. An algorithm for obtaining the desired Markov chain is described. Integer-valued autoregressive processes are considered for illustration.
No takes yet. Share an insight, caveat, or question.
Tomonari Sei (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: