On stepwise increasing roots of transition matrices

Philippe Carette, Marie Guerry

Research output: Chapter in Book/Report/Conference proceedingMeeting abstract (Book)

129 Downloads (Pure)


In Markov chain models, given an empirically observed transition matrix over a certain time interval, it may be needed to extract information about the transition probabilities over some shorter time interval. This is called an embedding problem. In a discrete time setting this problem comes down to finding a transition matrix Q which is a stochastic p-th root (p is an integer) of a given transition matrix P. It is known that an embedding problem need not have a unique solution, so the question arises as to identify those solutions that can be retained for further modelling purposes. In manpower planning applications, it is reasonable to assume that promotion prospects decrease over shorter periods of time. Therefore, we focus on transition matrices Q which have off-diagonal elements that are not exceeding the corresponding elements of P and call those matrices
stepwise increasing. In this paper, we present some results about stepwise increasing stochastic square roots (p = 2) of a given transition matrix for the two- and three-state case.
Original languageEnglish
Title of host publicationSMTDA2016 Book of abstracts 4th Stochastic Modeling Techniques & Data Analysis International Conference
EditorsChristos H. Skiadas
PublisherISAST: International Society for the Advancement of Science and Technology.
Number of pages1
ISBN (Electronic)978-618-5180-15-7
ISBN (Print)978-618-5180-14-0
Publication statusPublished - 2016
EventStochastic Modeling Techniques and Data Analysis International Conference - University of Malta, Valetta, Malta
Duration: 1 Jun 20164 Jun 2016


ConferenceStochastic Modeling Techniques and Data Analysis International Conference
Abbreviated titleSMTDA2016
Internet address


  • Markov chain models


Dive into the research topics of 'On stepwise increasing roots of transition matrices'. Together they form a unique fingerprint.

Cite this