Related papers: Sharp Poincar\'e and log-Sobolev inequalities for …
Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically…
We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…
We establish a simple variance inequality for U-statistics whose underlying sequence of random variables is an ergodic Markov Chain. The constants in this inequality are explicit and depend on computable bounds on the mixing rate of the…
We study settings in which mixture and joint distributions satisfy a Poincar\'{e} (or log-Sobolev) inequality induced by a marginal and a collection of conditional distributions that are assumed to satisfy Poincar\'{e} (or log-Sobolev,…
We prove an upper bound on the total variation mixing time of a finite Markov chain in terms of the absolute spectral gap and the number of elements in the state space. Unlike results requiring reversibility or irreducibility, this bound is…
We consider spin systems with nearest-neighbor interactions on an $n$-vertex $d$-dimensional cube of the integer lattice graph $\mathbb{Z}^d$. We study the effects that exponential decay with distance of spin correlations, specifically the…
This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants…
We investigate quasi-Monte Carlo rules for the numerical integration of multivariate periodic functions from Besov spaces $S^r_{p,q}B(\mathbb{T}^d)$ with dominating mixed smoothness $1/p<r<2$. We show that order 2 digital nets achieve the…
Chaining algorithms aim to form a semi-global alignment of two sequences based on a set of anchoring local alignments as input. Depending on the optimization criteria and the exact definition of a chain, there are several $O(n \log n)$ time…
The renormalization group (RG) method is an important tool for studying critical phenomena. In this paper, we employ stochastic analysis techniques to investigate the stochastic partial differential equation (SPDE) derived by regularizing…
We give a simple proof that every $n$-vertex graph $d$-regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size $\Omega((n/d)(\log d))$.
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We present a class of modified logarithmic Sobolev inequality, interpolating between Poincar\'e and logarithmic Sobolev inequalities, suitable for measures of the type $\exp(-|x|^\al)$ or more complex $\exp(-|x|^\al\log^\beta(2+|x|))$…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
Many systems in biology, physics and chemistry can be modeled through ordinary differential equations, which are piecewise smooth, but switch between different states according to a Markov jump process. In the fast switching limit, the…
Consider the semigroup of random walk on a complete graph, which we call the Potts semigroup. Diaconis and Saloff-Coste computed the maximum of the ratio of the relative entropy and the Dirichlet form obtaining the constant $\alpha_2$ in…
In this paper, we propose a new Markov chain which generalizes random-to-random shuffling on permutations to random-to-random shuffling on linear extensions of a finite poset of size $n$. We conjecture that the second largest eigenvalue of…
On a convex set, we prove that the Poincar\'e-Sobolev constant for functions vanishing at the boundary can be bounded from above by the ratio between the perimeter and a suitable power of the $N-$dimensional measure. This generalizes an old…
Given a bounded convex open set $\Omega\subseteq \mathbb R^N$, we prove that the Poincar\'e-Sobolev constants $\lambda_{p,q}(\Omega)$ can be bounded from below by the $p$-power of the ratio between the perimeter of $\Omega$ and a suitable…
We study the limit behaviour of a generally non-linear ordinary differential equation whose solution is a superadditive generalisation of a stochastic matrix, and provide necessary and sufficient conditions for this solution to be ergodic,…