The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Marked continuous-time Markov chain modelling of burst behaviour for single ion channels.”

Central limit theorem for hitting times of functionals of Markov jump processes

Christian Paroissin, Bernard Ycart (2004)

ESAIM: Probability and Statistics

Similarity:

A sample of i.i.d. continuous time Markov chains being defined, the sum over each component of a real function of the state is considered. For this functional, a central limit theorem for the first hitting time of a prescribed level is proved. The result extends the classical central limit theorem for order statistics. Various reliability models are presented as examples of applications.

Loop-free Markov chains as determinantal point processes

Alexei Borodin (2008)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We show that any loop-free Markov chain on a discrete space can be viewed as a determinantal point process. As an application, we prove central limit theorems for the number of particles in a window for renewal processes and Markov renewal processes with Bernoulli noise.

Survival probabilities for HIV infected patients through semi-Markov processes

Giovanni Masala, Giuseppina Cannas, Marco Micocci (2014)

Biometrical Letters

Similarity:

In this paper we apply a parametric semi-Markov process to model the dynamic evolution of HIV-1 infected patients. The seriousness of the infection is rendered by the CD4+ T-lymphocyte counts. For this purpose we introduce the main features of nonhomogeneous semi-Markov models. After determining the transition probabilities and the waiting time distributions in each state of the disease, we solve the evolution equations of the process in order to estimate the interval transition probabilities....

Accurate calculations of Stationary Distributions and Mean First Passage Times in Markov Renewal Processes and Markov Chains

Jeffrey J. Hunter (2016)

Special Matrices

Similarity:

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30, 197–207, (1986) procedure. The technique is numerically stable in that it doesn’t involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived.Aconsequence of the procedure is that the stationary distribution of the...

Single-use reliability computation of a semi-Markovian system

Guglielmo D'Amico (2014)

Applications of Mathematics

Similarity:

Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation...

A Markov chain model for traffic equilibrium problems

Giandomenico Mastroeni (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous...