English
Related papers

Related papers: Evolving sets, mixing and heat kernel bounds

200 papers

We study the relationship between functional inequalities for a Markov kernel on a metric space $X$ and inequalities of transportation distances on the space of probability measures $\mathcal{P}(X)$. Extending results of Luise and Savar\'e…

Functional Analysis · Mathematics 2025-08-06 Fabrice Baudoin , Nathaniel Eldredge

We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.

Probability · Mathematics 2009-10-16 Yevgeniy Kovchegov

We apply the shifted composition rule -- an information-theoretic principle introduced in our earlier work [AC23] -- to establish shift Harnack inequalities for the Langevin diffusion. We obtain sharp constants for these inequalities for…

Probability · Mathematics 2024-01-02 Jason M. Altschuler , Sinho Chewi

We improve upon all known lower bounds on the critical fugacity and critical density of the hard sphere model in dimensions two and higher. As the dimension tends to infinity our improvements are by factors of $2$ and $1.7$, respectively.…

Probability · Mathematics 2021-07-22 Tyler Helmuth , Will Perkins , Samantha Petti

Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this…

Information Theory · Computer Science 2022-11-22 Artemy Kolchinsky , Brendan D. Tracey

In this paper, we study purely discontinuous symmetric Markov processes on closed subsets of ${\mathbb R}^d$, $d\ge 1$, with jump kernels of the form $J(x,y)=|x-y|^{-d-\alpha}{\mathcal B}(x,y)$, $\alpha\in (0,2)$, where the function…

Probability · Mathematics 2026-01-01 Soobin Cho , Panki Kim , Renming Song , Zoran Vondraček

A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…

Probability · Mathematics 2007-05-23 Ravi Kannan

We study heat kernel estimates for symmetric pure jump processes on general metric measure spaces. Building on recent progress in the local setting due to S.~Eriksson-Bique, we develop a non-local version of the Whitney blending technique…

Probability · Mathematics 2026-02-09 Mathav Murugan

Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use…

Information Theory · Computer Science 2025-01-24 Lugaoze Feng , Xunan Li , Guocheng Lv , Ye jin

We discuss a probabilistic approximation framework for the three-dimensional attractive point interaction on a finite time horizon. By iterating the Doob transforms of the explicit heat kernel associated with the singular Schr\"odinger…

Probability · Mathematics 2026-05-26 Barkat Mian

We consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random…

Probability · Mathematics 2025-04-30 Andreas Galanis , Leslie Ann Goldberg , Paulina Smolarova

We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…

Probability · Mathematics 2022-10-13 Adrian Riekert

Consider a sequence of continuous-time irreducible reversible Markov chains and a sequence of initial distributions, $\mu_n$. The sequence is said to exhibit $\mu_n$-cutoff if the convergence to stationarity in total variation distance is…

Probability · Mathematics 2018-02-27 Jonathan Hermon

Mixing rates and decay of correlations for dynamics defined by potentials with summable variations are well understood, but little is known for non-summable variations. In this paper, we exhibit upper bounds for these quantities in the case…

Dynamical Systems · Mathematics 2021-06-17 Christophe Gallesco , Daniel Y. Takahashi

Mixture distributions provide a versatile and widely used framework for modeling random phenomena, and are particularly well-suited to the analysis of geoscientific processes and their attendant risks to society. For continuous mixtures of…

Machine Learning · Statistics 2025-06-18 Michael R. Powers , Jiaxin Xu

We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more…

Discrete Mathematics · Computer Science 2025-03-05 Charilaos Efthymiou , Thomas P. Hayes , Daniel Stefankovic , Eric Vigoda

We establish general quantitative conditions for stochastic evolution equations with locally monotone drift and degenerate additive Wiener noise in variational formulation resulting in the existence of a unique invariant probability measure…

Probability · Mathematics 2026-05-21 Gerardo Barrera , Jonas M. Tölle

We establish heat kernel upper bounds for a continuous-time random walk under unbounded conductances satisfying an integrability assumption, where we correct and extend recent results by the authors to a general class of speed measures. The…

Probability · Mathematics 2019-01-17 Sebastian Andres , Jean-Dominique Deuschel , Martin Slowik

In this paper, we consider a symmetric pure jump Markov process $X$ on a metric measure space with volume doubling conditions. Our focus is on estimating the transition density $p(t,x,y)$ of $X$ and studying its stability when the jumping…

Probability · Mathematics 2023-06-05 Joohak Bae , Jaehoon Kang , Panki Kim , Jaehun Lee

The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…

Information Theory · Computer Science 2025-04-02 Ian George , Alice Zheng , Akshay Bansal