English
Related papers

Related papers: Evolving sets, mixing and heat kernel bounds

200 papers

We introduce a new partial order on the class of stochastically monotone Markov kernels having a given stationary distribution $\pi$ on a given finite partially ordered state space $\mathcal{X}$. When $K\preceq L$ in this partial order we…

Probability · Mathematics 2013-09-09 James Allen Fill , Jonas Kahn

Nash and Sobolev inequalities are known to be equivalent to ultracontractive properties of heat-like Markov semigroups, hence to uniform on-diagonal bounds on their kernel densities. In non ultracontractive settings, such bounds can not…

Functional Analysis · Mathematics 2014-07-28 François Bolley , Arnaud Guillin , Xinyu Wang

In this paper, we study a notion of local stationarity for discrete time Markov chains which is useful for applications in statistics. In the spirit of some locally stationary processes introduced in the literature, we consider triangular…

Statistics Theory · Mathematics 2016-10-06 Lionel Truquet

In this paper, we study the large time behavior of the heat kernel on complete Riemannian manifolds with nonnegative Ricci curvature, which was studied by P. Li with additional maximum volume growth assumption. Following Y. Ding's original…

Differential Geometry · Mathematics 2014-07-30 Guoyi Xu

We study discrete-time Markov chains on countably infinite state spaces, which are perturbed by rather general confining (i.e.\ growing at infinity) potentials. Using a discrete-time analogue of the classical Feynman--Kac formula, we obtain…

Probability · Mathematics 2025-04-28 Wojciech Cygan , Kamil Kaleta , René L. Schilling , Mateusz Śliwiński

We give a bound on the mixing time of a uniformly ergodic, reversible Markov chain in terms of the spectral radius of the transition operator. This bound has been established previously in finite state spaces, and is widely believed to hold…

Probability · Mathematics 2014-05-02 Dawn B. Woodard

The distribution of the "mixing time" or the "time to stationarity" in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the…

Probability · Mathematics 2014-03-05 Jeffrey J. Hunter

Nash or Sobolev inequalities are known to be equivalent to ultracontractive properties of Markov semigroups, hence to uniform bounds on their kernel densities. In this work we present a simple and extremely general method, based on weighted…

Probability · Mathematics 2013-09-19 Dominique Bakry , François Bolley , Ivan Gentil , Patrick Maheux

We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…

Probability · Mathematics 2020-02-17 A. I. Zeifman , Y. A. Satin , K. M. Kiseleva

We prove that the results regarding the Isoperimetric inequality and Cheeger constant formulated in terms of the Minkowski content, obtained by the authors in previous papers in the framework of essentially non-branching metric measure…

Metric Geometry · Mathematics 2019-05-08 Fabio Cavalletti , Andrea Mondino

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…

Probability · Mathematics 2012-06-19 David Bruce Wilson

We introduce a unified operator-theoretic framework for analyzing mixing times of finite-state ergodic Markov chains that applies to both reversible and non-reversible dynamics. The central object in our analysis is the projected transition…

Probability · Mathematics 2025-11-05 Muhammad Abdullah Naeem

Let $(X,d,\mu)$ be a $RCD^\ast(K, N)$ space with $K\in \mathbb{R}$ and $N\in [1,\infty]$. For $N\in [1,\infty)$, we derive the upper and lower bounds of the heat kernel on $(X,d,\mu)$ by applying the parabolic Harnack inequality and the…

Metric Geometry · Mathematics 2015-12-02 Renjin Jiang , Huaiqian Li , Huichun Zhang

We show a strict hierarchy among various edge and vertex expansion properties of Markov chains. This gives easy proofs of a range of bounds, both classical and new, on chi-square distance, spectral gap and mixing time. The 2-gradient is…

Probability · Mathematics 2009-04-03 Ravi Montenegro

We present a coupling framework to upper bound the total variation mixing time of various Metropolis-adjusted, gradient-based Markov kernels in the `high acceptance regime'. The approach uses a localization argument to boost local mixing of…

Probability · Mathematics 2024-06-24 Nawaf Bou-Rabee , Stefan Oberdörster

We survey existing techniques to bound the mixing time of Markov chains. The mixing time is related to a geometric parameter called conductance which is a measure of edge-expansion. Bounds on conductance are typically obtained by a…

Data Structures and Algorithms · Computer Science 2016-03-07 Venkatesan Guruswami

This article establishes sufficient conditions for a linear-in-time bound on the non-asymptotic variance of particle approximations of time-homogeneous Feynman-Kac formulae. These formulae appear in a wide variety of applications including…

Computation · Statistics 2012-02-14 Nick Whiteley , Nikolas Kantas , Ajay Jasra

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…

Probability · Mathematics 2021-05-21 Aleksandr Shchegolev

We extend several Cheeger-type isoperimetric bounds for convex sets in Euclidean space, due to Bobkov and Kannan-Lov\'asz-Simonovits, to Riemannian manifolds having non-negative Ricci curvature. In order to extend Bobkov's bound, we require…

Functional Analysis · Mathematics 2011-05-06 Emanuel Milman

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…

Probability · Mathematics 2009-09-29 Thomas P. Hayes , Alistair Sinclair