Related papers: Bounding the convergence time of local probabilist…

We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as…

Statistical divergences are important tools in data analysis, information theory, and statistical physics, and there exist well known inequalities on their bounds. However, in many circumstances involving temporal evolution, one needs…

This survey is an in-depth development of the theoretical aspects of the method of Evolving Sets, a method which has been used in several of my papers. It is fairly esoteric as to a large degree it stems from my efforts to ascertain whether…

In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then…

It is well known that isoperimetric inequalities imply in a very general measure-metric-space setting appropriate concentration inequalities. The former bound the boundary measure of sets as a function of their measure, whereas the latter…

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.

The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…

In this paper we consider the field of local times of a discrete-time Markov chain on a general state space, and obtain uniform (in time) upper bounds on the total variation distance between this field and the one of a sequence of $n$…

Arguing about the equilibrium distribution of continuous-time Markov chains can be vital for showing properties about the underlying systems. For example in biological systems, bistability of a chemical reaction network can hint at its…

Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while…

We consider for the full time-dependent Maxwell's equations the inverse problem of identifying locations and certain properties of small electromagnetic inhomogeneities in a homogeneous background medium from dynamic boundary measurements…

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…

Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…

We prove weighted isoperimetric inequalities for smooth, bounded, and simply connected domains. More precisely, we show that the moment of inertia of inner parallel curves for domains with fixed perimeter attains its maximum for a disk.…

We study time-inhomogeneous Markov chains to obtain quantitative results on their asymptotic behavior. We use Poincar\'e, Nash, and logarithmic-Sobolev inequalities. We assume that our Markov chain admits a finite invariant measure at each…

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…

We establish a family of parametric isoperimetric-type inequalities with multiple geometric quantities for closed convex curves. These inequalities hold under certain parameter conditions. We also prove the equality conditions. Some new…

We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…

We give a complete expansion, at any accuracy order, for the iterated convolution of a complex valued integrable sequence in one space dimension. The remainders are estimated sharply with generalized Gaussian bounds. The result applies in…

This paper is an adaptation of a method used in \cite{K} to the model of random quadrangulations. We prove local weak convergence of uniform measures on quadrangulations and show that the local growth of quadrangulation is governed by…