growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. in this paper, sensitivity and specificity of the first and second markov chains for prediction of genes was evaluated using the complete double stranded  dna virus. there were two approaches for prediction of each markov model parameter,...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

in this paper at rst, a history of mathematical models is given.next, some basic information about random variables, stochastic processesand markov chains is introduced. as follows, the entropy for a discrete timemarkov process is mentioned. after that, the entropy for sis stochastic modelsis computed, and it is proved that an epidemic will be disappeared after a longtime.

Motivated by problems arising in time-dependent queues and dynamic systems with random environment, this work develops moderate deviations principles for dynamic systems driven by a fast-varying nonhomogeneous Markov chain in continuous time. A distinct feature is that the Markov chain is time dependent or inhomogeneous so are the dynamic systems. Under irreducibility of the nonhomogeneous Mark...

For each n let Y n t be a continuous time symmetric Markov chain with state space n −1 Z d. A condition in terms of the conductances is given for the convergence of the Y n t to a symmetric Markov process Yt on R d. We have weak convergence of {Y n t : t ≤ t0} for every t0 and every starting point. The limit process Y has a continuous part and may also have jumps.

In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...

In this paper, we formulate six different resolutions of a continuous-time approximation of the Wright-Fisher sample genealogical process. We derive Markov chains for the six different approximations in the spirit of J.F.C. Kingman. These Markov chains are essential for inference methods. One of the resolutions is the well-known n-coalescent due to Kingman. The second resolution was mentioned b...

In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state continuous-time Markov chains, to an important class of infinite-state Markov chains. We present synta...

For each n let Y (n) t be a continuous time symmetric Markov chain with state space n −1 Z d. Conditions in terms of the conductances are given for the convergence of the Y (n) t to a symmetric Markov process Yt on R d. We have weak convergence of {Y (n) t : t ≤ t0} for every t0 and every starting point. The limit process Y has a continuous part and may also have jumps.