Related papers: Sharp Poincar\'e and log-Sobolev inequalities for …

We determine the log-Sobolev constant of the multi-urn Bernoulli-Laplace diffusion model with arbitrary parameters, up to a small universal multiplicative constant. Our result extends a classical estimate of Lee and Yau (1998) and confirms…

We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to…

We prove a lower bound on the sharp Poincar\'e-Sobolev embedding constants for general open sets, in terms of their inradius. We consider the following two situations: planar sets with given topology; open sets in any dimension, under the…

The continuum $\varphi^4_2$ and $\varphi^4_3$ measures are shown to satisfy a log-Sobolev inequality uniformly in the lattice regularisation under the optimal assumption that their susceptibility is bounded. In particular, this applies to…

A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…

Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…

In this paper we establish some explicit and sharp estimates of the spectral gap and the log-Sobolev constant for mean field particles system, uniform in the number of particles, when the confinement potential have many local minimums. Our…

Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for…

In this paper, we are concerned with the stability problem for endpoint conformally invariant cases of the Sobolev inequality on the sphere $\mathbb{S}^n$. Namely, we will establish the stability for Beckner's log-Sobolev inequality and…

Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete…

We prove some results about the super Poincar\'e inequality (SPI) and its relation to the spectrum of an operator: we show that it can be alternatively written with Orlicz norms instead of L1 norms, and we use this to give an alternative…

Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…

We prove the one-dimensional almost sure invariance principle with essentially optimal rates for slowly (polynomially) mixing deterministic dynamical systems, such as Pomeau-Manneville intermittent maps, with H\"older continuous…

The quasi-invariance is proved for the distributions of Poisson point processes under a random shift map on the path space. This leads to a natural Dirichlet form of jump type on the path space. Differently from the O-U Dirichlet form on…

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…

Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…

This paper presents an elementary proof of stochastic stability of a discrete-time reversible Markov chain starting from a Foster-Lyapunov drift condition. Besides its relative simplicity, there are two salient features of the proof: (i) it…

In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…

To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $\#P$ hard, so only approximations are envisageable. A Markov chain allowing uniform sampling of all possible solutions is given by Luby, Randall…

We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem proven by Gurvits and…