PNS90 Estimation of Markov Chain Transition Probabilities and Rates for Use As Inputs to Multistate Models

2021 ◽  
Vol 24 ◽  
pp. S189
Author(s):  
D. Epstein ◽  
D. Pérez-Troncoso
Keyword(s):  
Markov Chain ◽  
Transition Probabilities ◽  
Multistate Models

Data Mining Technique Applied To DNA Sequencing

2015 ◽  
Vol 2 (7) ◽  
pp. 18
Author(s):  
R. Jamuna
Keyword(s):  
Data Mining ◽  
Dna Methylation ◽  
Markov Chain ◽  
Human Genome ◽  
Transition Probabilities ◽  
Markov Chain Model ◽  
Effective Means ◽  
Cpg Islands ◽  
Chain Model ◽  
The Given

CpG islands (CGIs) play a vital role in genome analysis as genomic markers.  Identification of the CpG pair has contributed not only to the prediction of promoters but also to the understanding of the epigenetic causes of cancer. In the human genome [1] wherever the dinucleotides CG occurs the C nucleotide (cytosine) undergoes chemical modifications. There is a relatively high probability of this modification that mutates C into a T. For biologically important reasons the mutation modification process is suppressed in short stretches of the genome, such as ‘start’ regions. In these regions [2] predominant CpG dinucleotides are found than elsewhere. Such regions are called CpG islands. DNA methylation is an effective means by which gene expression is silenced. In normal cells, DNA methylation functions to prevent the expression of imprinted and inactive X chromosome genes. In cancerous cells, DNA methylation inactivates tumor-suppressor genes, as well as DNA repair genes, can disrupt cell-cycle regulation. The most current methods for identifying CGIs suffered from various limitations and involved a lot of human interventions. This paper gives an easy searching technique with data mining of Markov Chain in genes. Markov chain model has been applied to study the probability of occurrence of C-G pair in the given   gene sequence. Maximum Likelihood estimators for the transition probabilities for each model and analgously for the  model has been developed and log odds ratio that is calculated estimates the presence or absence of CpG is lands in the given gene which brings in many  facts for the cancer detection in human genome.

A review of multistate modelling approaches in monitoring disease progression: Bayesian estimation using the Kolmogorov-Chapman forward equations

2021 ◽  
pp. 096228022199750
Author(s):  
Zvifadzo Matsena Zingoni ◽  
Tobias F Chirwa ◽  
Jim Todd ◽  
Eustasius Musenge
Keyword(s):  
Bayesian Estimation ◽  
Transition Probabilities ◽  
Markov Property ◽  
Likelihood Estimation ◽  
Single Individual ◽  
Transition Rates ◽  
Multistate Models ◽  
Time To Event ◽  
Modeling Framework ◽  
Forward Equations

There are numerous fields of science in which multistate models are used, including biomedical research and health economics. In biomedical studies, these stochastic continuous-time models are used to describe the time-to-event life history of an individual through a flexible framework for longitudinal data. The multistate framework can describe more than one possible time-to-event outcome for a single individual. The standard estimation quantities in multistate models are transition probabilities and transition rates which can be mapped through the Kolmogorov-Chapman forward equations from the Bayesian estimation perspective. Most multistate models assume the Markov property and time homogeneity; however, if these assumptions are violated, an extension to non-Markovian and time-varying transition rates is possible. This manuscript extends reviews in various types of multistate models, assumptions, methods of estimation and data features compatible with fitting multistate models. We highlight the contrast between the frequentist (maximum likelihood estimation) and the Bayesian estimation approaches in the multistate modeling framework and point out where the latter is advantageous. A partially observed and aggregated dataset from the Zimbabwe national ART program was used to illustrate the use of Kolmogorov-Chapman forward equations. The transition rates from a three-stage reversible multistate model based on viral load measurements in WinBUGS were reported.

scholarly journals Calibration of Transition Intensities for a Multistate Model: Application to Long-Term Care

Risks ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 37
Author(s):  
Manuel L. Esquível ◽  
Gracinda R. Guerreiro ◽  
Matilde C. Oliveira ◽  
Pedro Corte Real
Keyword(s):  
Markov Chain ◽  
Continuous Time ◽  
Long Term Care ◽  
Transition Probabilities ◽  
Markov Chain Model ◽  
Chain Model ◽  
Chain Process ◽  
Term Care ◽  
National Network

We consider a non-homogeneous continuous time Markov chain model for Long-Term Care with five states: the autonomous state, three dependent states of light, moderate and severe dependence levels and the death state. For a general approach, we allow for non null intensities for all the returns from higher dependence levels to all lesser dependencies in the multi-state model. Using data from the 2015 Portuguese National Network of Continuous Care database, as the main research contribution of this paper, we propose a method to calibrate transition intensities with the one step transition probabilities estimated from data. This allows us to use non-homogeneous continuous time Markov chains for modeling Long-Term Care. We solve numerically the Kolmogorov forward differential equations in order to obtain continuous time transition probabilities. We assess the quality of the calibration using the Portuguese life expectancies. Based on reasonable monthly costs for each dependence state we compute, by Monte Carlo simulation, trajectories of the Markov chain process and derive relevant information for model validation and premium calculation.

scholarly journals A Bayesian model for binary Markov chains

2004 ◽  
Vol 2004 (8) ◽  
pp. 421-429 ◽  
Author(s):  
Souad Assoudou ◽  
Belkheir Essebbar
Keyword(s):  
Monte Carlo ◽  
Markov Chain ◽  
Markov Chains ◽  
Bayesian Estimation ◽  
Bayesian Model ◽  
Transition Probabilities ◽  
Simulated Data ◽  
Bayesian Estimator ◽  
Jeffreys Prior ◽  
Data Set

This note is concerned with Bayesian estimation of the transition probabilities of a binary Markov chain observed from heterogeneous individuals. The model is founded on the Jeffreys' prior which allows for transition probabilities to be correlated. The Bayesian estimator is approximated by means of Monte Carlo Markov chain (MCMC) techniques. The performance of the Bayesian estimates is illustrated by analyzing a small simulated data set.

scholarly journals Infinitely divisible random transition probabilities with application to dependent Markov chains

1984 ◽  
Vol 25 (4) ◽  
pp. 463-472
Author(s):  
Peter L. Chesson
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
White Noise ◽  
Transition Probabilities ◽  
Transition Probability ◽  
Transition Rates ◽  
Infinitely Divisible ◽  
Random Transition ◽  
Transition Probability Matrices ◽  
Probability Matrices

AbstractRandom transition probability matrices with stationary independent factors define “white noise” environment processes for Markov chains. Two examples are considered in detail. Such environment processes can be used to construct several Markov chains which are dependent, have the same transition probabilities and are jointly a Markov chain. Transition rates for such processes are evaluated. These results have application to the study of animal movements.

scholarly journals On a non-homogeneous difference equation from probability theory

2009 ◽  
Vol 43 (1) ◽  
pp. 81-90 ◽  
Author(s):  
Jean-Luc Guilbault ◽  
Mario Lefebvre
Keyword(s):  
Probability Theory ◽  
Markov Chain ◽  
Difference Equation ◽  
Mathematical Expectation ◽  
Transition Probabilities ◽  
Current State ◽  
Constant Coefficients ◽  
Gambler’S Ruin ◽  
Gambler's Ruin Problem ◽  
Ruin Problem

Abstract The so-called gambler’s ruin problem in probability theory is considered for a Markov chain having transition probabilities depending on the current state. This problem leads to a non-homogeneous difference equation with non-constant coefficients for the expected duration of the game. This mathematical expectation is computed explicitly.

Perturbation theory and finite Markov chains

1968 ◽  
Vol 5 (2) ◽  
pp. 401-413 ◽  
Author(s):  
Paul J. Schweitzer
Keyword(s):  
Perturbation Theory ◽  
Markov Chain ◽  
Markov Chains ◽  
Stationary Distribution ◽  
Fundamental Matrix ◽  
Transition Probabilities ◽  
Semi Group ◽  
Partial Derivatives ◽  
Finite Markov Chains ◽  
Derivatives Of

A perturbation formalism is presented which shows how the stationary distribution and fundamental matrix of a Markov chain containing a single irreducible set of states change as the transition probabilities vary. Expressions are given for the partial derivatives of the stationary distribution and fundamental matrix with respect to the transition probabilities. Semi-group properties of the generators of transformations from one Markov chain to another are investigated. It is shown that a perturbation formalism exists in the multiple subchain case if and only if the change in the transition probabilities does not alter the number of, or intermix the various subchains. The formalism is presented when this condition is satisfied.

Single-shelf library-type Markov chains with infinitely many books

1977 ◽  
Vol 14 (02) ◽  
pp. 298-308 ◽  
Author(s):  
Peter R. Nelson
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Transition Probabilities ◽  
Natural Order ◽  
Order Book ◽  
Exit Boundary ◽  
One Step ◽  
Step Transition ◽  
The Right ◽  
Positive Recurrent

In a single-shelf library having infinitely many books B 1 , B 2 , …, the probability of selecting each book is assumed known. Books are removed one at a time and replaced in position k prior to the next removal. Books are moved either to the right or the left as is necessary to vacate position k. Those arrangements of books where after some finite position all the books are in natural order (book i occupies position i) are considered as states in an infinite Markov chain. When k > 1, we show that the chain can never be positive recurrent. When k = 1, we find the limits of ratios of one-step transition probabilities; and when k = 1 and the chain is transient, we find the Martin exit boundary.

scholarly journals Will this search end up with booking? Modeling airline booking conversion of anonymous visitors

2020 ◽  
Vol 27 (2) ◽  
pp. 237-250
Author(s):  
Misuk Lee
Keyword(s):  
Markov Chain ◽  
Transition Probabilities ◽  
Markov Chain Model ◽  
Distribution Channel ◽  
Stochastic Approach ◽  
Tourism Industry ◽  
Chain Model ◽  
Online Search ◽  
Clickstream Data ◽  
Content Type

Purpose Over the past two decades, online booking has become a predominant distribution channel of tourism products. As online sales have become more important, understanding booking conversion behavior remains a critical topic in the tourism industry. The purpose of this study is to model airline search and booking activities of anonymous visitors. Design/methodology/approach This study proposes a stochastic approach to explicitly model dynamics of airline customers’ search, revisit and booking activities. A Markov chain model simultaneously captures transition probabilities and the timing of search, revisit and booking decisions. The suggested model is demonstrated on clickstream data from an airline booking website. Findings Empirical results show that low prices (captured as discount rates) lead to not only booking propensities but also overall stickiness to a website, increasing search and revisit probabilities. From the decision timing of search and revisit activities, the author observes customers’ learning effect on browsing time and heterogeneous intentions of website visits. Originality/value This study presents both theoretical and managerial implications of online search and booking behavior for airline and tourism marketing. The dynamic Markov chain model provides a systematic framework to predict online search, revisit and booking conversion and the time of the online activities.

Sign in / Sign up

Export Citation Format

Share Document