相关论文: Geometric Ergodicity and Perfect Simulation

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 show how to map the states of an ergodic Markov chain to Euclidean space so that the squared distance between states is the expected commuting time. We find a minimax characterization of commuting times, and from this we get monotonicity…

Consider a Markov process $\{\Phi(t) : t\geq 0\}$ evolving on a Polish space ${\sf X}$. A version of the $f$-Norm Ergodic Theorem is obtained: Suppose that the process is $\psi$-irreducible and aperiodic. For a given function $f\colon{\sf…

We study the optimization of ergodic averages for multi-valued dynamical systems, i.e. where points may have multiple different forward orbits. Under upper semi-continuity assumptions, we show that the maximum space average with respect to…

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 study the relationship between two classical approaches for quantitative ergodic properties : the first one based on Lyapunov type controls and popularized by Meyn and Tweedie, the second one based on functional inequalities (of…

In this expository paper, we survey nowadays classical tools or criteria used in problems of convergence everywhere to build counterexamples: the Stein continuity principle, Bourgain's entropy criteria and Kakutani-Rochlin lemma, most…

The analysis of classical consensus algorithms relies on contraction properties of adjoints of Markov operators, with respect to Hilbert's projective metric or to a related family of seminorms (Hopf's oscillation or Hilbert's seminorm). We…

The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…

Petersen's theorem, one of the earliest results in graph theory, states that any bridgeless cubic multigraph contains a perfect matching. While the original proof was neither constructive nor algorithmic, Biedl, Bose, Demaine, and Lubiw [J.…

From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples…

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).…

We proved that for the countably infinite number of one-parameterized one dimensional dynamical systems, they preserve the Lebesgue measure and they are ergodic for the measure (infinite ergodicity). Considered systems connect the parameter…

The method of 'coupling from the past' permits exact sampling from the invariant distribution of a Markov chain on a finite state space. The coupling is successful whenever the stochastic dynamics are such that there is coalescence of all…

The objective of this paper is to characterize the structure of the set $\Theta$ for a continuous ergodic upper probability $\mathbb{V}=\sup_{P\in\Theta}P$ (Theorem \ref {main result}): . $\Theta$ contains a finite number of ergodic…

Consider a filtering process associated to a hidden Markov model with densities for which both the state space and the observation space are complete, separable, metric spaces. If the underlying, hidden Markov chain is strongly ergodic and…

We study ergodic properties of compositions of holomorphic endomorphisms of the complex projective space chosen independently at random according to some probability distribution. Along the way, we construct positive closed currents which…

We introduce an statistical mechanical formalism for the study of discrete-time stochastic processes with which we prove: (i) General properties of extremal chains, including triviality on the tail $\sigma$-algebra, short-range…

Consider a class of skew product transformations consisting of an ergodic or a periodic transformation on a probability space (M, B, m) in the base and a semigroup of transformations on another probability space (W,F,P) in the fibre. Under…

We prove an ergodic theorem for Markov chains indexed by the Ulam-Harris-Neveu tree over large subsets with arbitrary shape under two assumptions: with high probability, two vertices in the large subset are far from each other and have…