The cutoff phenomenon for ergodic Markov processes.
The Kendall theorem and its application to the geometric ergodicity of Markov chains
We give an improved quantitative version of the Kendall theorem. The Kendall theorem states that under mild conditions imposed on a probability distribution on the positive integers (i.e. a probability sequence) one can prove convergence of its renewal sequence. Due to the well-known property (the first entrance last exit decomposition) such results are of interest in the stability theory of time-homogeneous Markov chains. In particular this approach may be used to measure rates of convergence of...
The stability of Markov operators on Polish spaces
A sufficient condition for the asymptotic stability of Markov operators acting on measures defined on Polish spaces is presented.
The theory of networks of single server queues and the tandem queue model.
Theoretical analysis of steady state genetic algorithms
Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions are...
Transient and stationary characteristics of a packet buffer modelled as an map/sm/1/b system
Two algorithms based on Markov chains and their application to recognition of protein coding genes in prokaryotic genomes
Methods based on the theory of Markov chains are most commonly used in the recognition of protein coding sequences. However, they require big learning sets to fill up all elements in transition probability matrices describing dependence between nucleotides in the analyzed sequences. Moreover, gene prediction is strongly influenced by the nucleotide bias measured by e.g. G+C content. In this paper we compare two methods: (i) the classical GeneMark algorithm, which uses a three-periodic non-homogeneous...
Two stationarity conditions in the dam