Related papers: On some limit theorems following from Smith's Theo…
We study time-changed Markov processes to speed up the convergence of Markov chain Monte Carlo (MCMC) algorithms. The time-changed process is defined by adjusting the speed of time of a base process via a user-chosen, state-dependent…
We consider a time-homogeneous Markov chain $X_n$, $n\ge0$, valued in ${\bf R}$. Suppose that this chain is transient, that is, $X_n$ generates a $\sigma$-finite renewal measure. We prove the key renewal theorem under condition that this…
The exponential rate of convergence and the Central Limit Theorem for some Markov operators are established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell cycle model given by…
Dynamical systems that are contracting on a subspace are said to be semicontracting. Semicontraction theory is a useful tool in the study of consensus algorithms and dynamical flow systems such as Markov chains. To develop a comprehensive…
We study a G/GI/1 single-server queuing model with i.i.d.\ service times that are independent of a stationary process of inter-arrival times. We show that the distribution of the waiting time converges to a stationary law as time tends to…
A simple model of the new notion of "Markov up" processes is proposed; its positive recurrence and ergodic properties are shown under the appropriate conditions.
We consider reversible ergodic Markov chains with finite state space, and we introduce a new notion of quasi-stationary distribution that does not require the presence of any absorbing state. In our setting, the hitting time of the…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
We generalise the Erdos-Renyi limit theorem on the maximum of the partial sums of random variables to the case when the number of terms in these sums is randomly distributed. Certain relations between the limiting theorems of this type and…
We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.
The main objective of this article is to establish a central limit theorem for additive three-variable functionals of bifurcating Markov chains. We thus extend the central limit theorem under point-wise ergodic conditions studied in…
We consider the problem of estimating the joint distribution of a continuous-time perpetuity and the underlying factors which govern the cash flow rate, in an ergodic Markov model. Two approaches are used to obtain the distribution. The…
We consider random fields indexed by finite subsets of an amenable discrete group, taking values in the Banach-space of bounded right-continuous functions. The field is assumed to be equivariant, local, coordinate-wise monotone, and almost…
Consider an ergodic Markov chain on a countable state space for which the return times have exponential tails. We show that the stationary version of any such chain is a finitary factor of an i.i.d. process. A key step is to show that any…
We give a general method of deriving statistical limit theorems, such as the central limit theorem and its functional version, in the setting of ergodic measure preserving transformations. This method is applicable in situations where the…
In this paper, for a discontinuous skew-product transformation with the integrable observation function, we obtain uniform ergodic theorem and semi-uniform ergodic theorem. The main assumptions are that discontinuity sets of transformation…
We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…
We study weighted ensemble, an interacting particle method for sampling distributions of Markov chains that has been used in computational chemistry since the 1990s. Many important applications of weighted ensemble require the computation…
We prove an ergodic theorem for the rotation number of the composition of a sequence os stationary random homeomorphisms in $S^{1}$. In particular, the concept of rotation number of a matrix $g\in Gl^{+}(2,{\R})$ can be generalized to a…
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…