Identifying Markov Chain Models from Time-to-Event Data: An Algebraic Approach

Guardado en:
Detalles Bibliográficos
Publicado en:Bulletin of Mathematical Biology vol. 87, no. 1 (Jan 2025), p. 11
Autor principal: Radulescu, Ovidiu
Otros Autores: Grigoriev, Dima, Seiss, Matthias, Douaihy, Maria, Lagha, Mounia, Bertrand, Edouard
Publicado:
Springer Nature B.V.
Materias:
Acceso en línea:Citation/Abstract
Full Text
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Resumen:Many biological and medical questions can be modeled using time-to-event data in finite-state Markov chains, with the phase-type distribution describing intervals between events. We solve the inverse problem: given a phase-type distribution, can we identify the transition rate parameters of the underlying Markov chain? For a specific class of solvable Markov models, we show this problem has a unique solution up to finite symmetry transformations, and we outline a recursive method for computing symbolic solutions for these models across any number of states. Using the Thomas decomposition technique from computer algebra, we further provide symbolic solutions for any model. Interestingly, different models with the same state count but distinct transition graphs can yield identical phase-type distributions. To distinguish among these, we propose additional properties beyond just the time to the next event. We demonstrate the method’s applicability by inferring transcriptional regulation models from single-cell transcription imaging data.
ISSN:0092-8240
1522-9602
0007-4985
DOI:10.1007/s11538-024-01385-y
Fuente:Science Database