相关论文: On Mixing Properties of Reversible Markov Chains
This paper will provide several classes of strictly stationary, countable-state, irreducible, aperiodic Markov chains that are reversible and have finite second moments, such that the central limit theorem fails to hold. The main purpose is…
A class of nonlinear ARCH processes is introduced and studied. The existence of a strictly stationary and $\beta$-mixing solution is established under a mild assumption on the density of the underlying independent process. We give…
A family $\{Q_{\beta}\}_{\beta \geq 0}$ of Markov chains is said to exhibit $\textit{metastable mixing}$ with $\textit{modes}$ $S_{\beta}^{(1)},\ldots,S_{\beta}^{(k)}$ if its spectral gap (or some other mixing property) is very close to the…
We provide explicit expressions for the constants involved in the characterisation of ergodicity of sub-geometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation…
Strictly stationary INAR(1) ("integer-valued autoregressive processes of order 1") with Poisson innovations are "interlaced rho-mixing".
In this short note we prove ``effective" geometric ergodicity (i.e a Perron-Frobenius theorem) for Markov chains in random mixing dynamical environment satisfying a random non-uniform version of the Doeblin condition. Effectivity here means…
Improved rates of convergence for ergodic Markov chains and relaxed conditions for them, as well as analogous convergence results for some non-homogeneous Markov chains are studied. The setting from the previous works is extended. Examples…
In this work we present different results concerning mixing properties of multivariate infinitely divisible (ID) stationary random fields. First, we derive some necessary and sufficient conditions for mixing of stationary ID multivariate…
In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These…
The hitting and mixing times are two fundamental quantities associated with Markov chains. In Peres and Sousi[PS2015] and Oliveira[Oli2012], the authors show that the mixing times and "worst-case" hitting times of reversible Markov chains…
We consider general Markov chains with discrete time in an arbitrary measurable (phase) space and homogeneous in time. Markov chains are defined by the classical transition function which within the framework of the operator treatment…
We obtain a perfect sampling characterization of weak ergodicity for backward products of finite stochastic matrices, and equivalently, simultaneous tail triviality of the corresponding nonhomogeneous Markov chains. Applying these ideas to…
Improved rates of convergence for ergodic homogeneous Markov chains are studied. In comparison to the earlier papers the setting is also generalised to the case without a unique dominated measure. Examples are provided where the new bound…
This pedagogical document explains three variational representations that are useful when comparing the efficiencies of reversible Markov chains: (i) the Dirichlet form and the associated variational representations of the spectral gaps;…
For a stochastically monotone Markov chain taking values in a Polish space, we present a number of conditions for existence and for uniqueness of its stationary regime, as well as for closeness of its transient trajectories. In particular,…
We study two types of Metropolis-Hastings (MH) reversiblizations for non-reversible Markov chains with Markov kernel $P$. While the first type is the classical Metropolised version of $P$, we introduce a new self-adjoint kernel which…
We prove exponential decay of pair correlations for 1D stationary point processes when spacings satisfy a Markov condition, geometric ergodicity, and a condition on exponential moments. The conditions are phrased for stationary sequences of…
We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain $M$ on a state space $\Omega$ with stationary distribution $\pi$ and a monotone set $A \subset \Omega$. We consider the chain…
For a general attractive Probabilistic Cellular Automata on S Z d , we prove that the (time-) convergence towards equilibrium of this Markovian parallel dynamics, exponentially fast in the uniform norm, is equivalent to a condition (A).…
Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones…