Related papers: Quasi Markovian behavior in mixing maps
We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also…
This paper aims to provide some tools coming from functional inequalities to deal with quasi-stationarity for absorbed Markov processes. First, it is shown how a Poincar\'e inequality related to a suitable Doob transform entails exponential…
We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain…
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…
The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time…
We consider tilings of a closed region of the Kagome lattice (partition of the plane into regular hexagons and equilateral triangles such that each edge is shared by one triangle and one hexagon). We are interested in the rate of…
Let $Y$ be an Ornstein-Uhlenbeck diffusion governed by an ergodic finite state Markov process $X$: $dY_t=-\lambda(X_t)Y_tdt+\sigma(X_t)dB_t$, $Y_0$ given. Under ergodicity condition, we get quantitative estimates for the long time behavior…
A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…
This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…
This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed…
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
We prove distributional limit theorems (conditional and integrated) for the occupation times of certain weakly mixing, pointwise dual ergodic transformations at "tied-down" times immediately after "excursions". The limiting random variables…
We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…
We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the…
Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$…
The standard coalescent is widely used in evolutionary biology and population genetics to model the ancestral history of a sample of molecular sequences as a rooted and ranked binary tree. In this paper, we present a representation of the…
We study the asymptotic behavior of continuous-time, time-inhomogeneous Markovian quantum dynamics in a stationary random environment. Under mild faithfulness and eventually positivity-improving assumptions, the normalized evolution…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
This paper is a survey of various proofs of the so called {\em fundamental theorem of Markov chains}: every ergodic Markov chain has a unique positive stationary distribution and the chain attains this distribution in the limit independent…