English
Related papers

Related papers: Mixing Time Bounds for the Gibbs Sampler under Iso…

200 papers

The purpose of this paper is to analyze the isoperimetric inequality for symmetric log-convex probability measures on the line. Using geometric arguments we first re-prove that extremal sets in the isoperimetric inequality are intervals or…

Differential Geometry · Mathematics 2014-01-06 F. Feo , M. R. Posteraro , C. Roberto

Over the past decades, a fascinating computational phase transition has been identified in sampling from Gibbs distributions. Though, the computational complexity at the critical point remains poorly understood, as previous algorithmic and…

Data Structures and Algorithms · Computer Science 2026-01-08 Xiaoyu Chen , Zongchen Chen , Yitong Yin , Xinyuan Zhang

We prove finite sample complexities for sequential Monte Carlo (SMC) algorithms which require only local mixing times of the associated Markov kernels. Our bounds are particularly useful when the target distribution is multimodal and global…

Computation · Statistics 2022-08-16 Joseph Mathews , Scott C. Schmidler

The objective of this paper is to study the Gibbs sampling for computing the mean of observable in very high dimension - a powerful Markov chain Monte Carlo method. Under the Dobrushin's uniqueness condition, we establish some explicit and…

Statistics Theory · Mathematics 2014-10-17 Neng-Yi Wang , Liming Wu

Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. Applications include Markov Chain Monte Carlo (MCMC) simulation and distributed scheduling for wireless networks. In…

Probability · Mathematics 2010-04-06 Mathieu Leconte , Jian Ni , R. Srikant

We consider the long time statistics of a one-dimensional stochastic Ginzburg-Landau equation with cubic nonlinearity while being subjected to random perturbations via an additive Gaussian noise. Under the assumption that sufficiently many…

Probability · Mathematics 2024-05-21 Hung D. Nguyen

We consider the problem of sampling a multimodal distribution with a Markov chain given a small number of samples from the stationary measure. Although mixing can be arbitrarily slow, we show that if the Markov chain has a $k$th order…

Machine Learning · Computer Science 2024-11-15 Frederic Koehler , Holden Lee , Thuy-Duong Vuong

Motivated by de Finetti's representation theorem for almost exchangeable arrays, we want to sample $\mathbf p \in [0,1]^d$ from a distribution with density proportional to $\exp(-A^2\sum_{i<j}c_{ij}(p_i-p_j)^2)$, where $A$ is large and…

Probability · Mathematics 2020-12-22 Balázs Gerencsér , Andrea Ottolini

We prove that if ${(P_x)}_{x\in \mathscr X}$ is a family of probability measures which satisfy the log-Sobolev inequality and whose pairwise chi-squared divergences are uniformly bounded, and $\mu$ is any mixing distribution on $\mathscr…

Probability · Mathematics 2021-03-08 Hong-Bin Chen , Sinho Chewi , Jonathan Niles-Weed

This paper presents a new Markov chain Monte Carlo method to sample from the posterior distribution of conjugate mixture models. This algorithm relies on a flexible split-merge procedure built using the particle Gibbs sampler. Contrary to…

Computation · Statistics 2017-05-30 Alexandre Bouchard-Côté , Arnaud Doucet , Andrew Roth

In in this paper we establish an explicit and sharp estimate of the spectral gap (Poincar\'{e} inequality) and the transportation inequality for Gibbs measures, under the Dobrushin uniqueness condition. Moreover, we give a generalization of…

Probability · Mathematics 2007-05-23 Liming Wu

We study the infinite-dimensional log-Sobolev inequality for spin systems on $\mathbb{Z}^d$ with interactions of power higher than quadratic. We assume that the one site measure without a boundary $e^{-\phi(x)}dx/Z$ satisfies a log-Sobolev…

Probability · Mathematics 2025-01-07 Takis Konstantopoulos , Ioannis Papageorgiou

Many finite-state reversible Markov chains can be naturally decomposed into "projection" and "restriction" chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties…

Probability · Mathematics 2016-02-04 Natesh S. Pillai , Aaron Smith

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…

Computation · Statistics 2016-04-20 Olivier Féron , François Orieux , Jean-François Giovannelli

This article proves that, in terms of local times, the rescaled and recentered cover times of finite subsets of the discrete cylinder by simple random walk converge in law to the Gumbel distribution, as the cardinality of the set goes to…

Probability · Mathematics 2011-03-11 David Belius

We consider Ising models on the hypercube with a general interaction matrix $J$, and give a polynomial time sampling algorithm when all but $O(1)$ eigenvalues of $J$ lie in an interval of length one, a situation which occurs in many models…

Data Structures and Algorithms · Computer Science 2022-02-21 Frederic Koehler , Holden Lee , Andrej Risteski

We establish universal modified log-Sobolev inequalities for reversible Markov chains on the boolean lattice $\{0,1\}^n$, under the only assumption that the invariant law $\pi$ satisfies a form of negative dependence known as the stochastic…

Probability · Mathematics 2020-02-28 Jonathan Hermon , Justin Salez

In this paper, we study the Gibbs measures for periodic generalized Korteweg-de Vries equations (gKdV) with quartic or higher nonlinearities. In order to bypass the analytical ill-posedness of the equation in the Sobolev support of the…

Analysis of PDEs · Mathematics 2022-02-28 Andreia Chapouto , Nobu Kishimoto

Can the joint measures of quenched disordered lattice spin models (with finite range) on the product of spin-space and disorder-space be represented as (suitably generalized) Gibbs measures of an ``annealed system''? - We prove that there…

Mathematical Physics · Physics 2007-05-23 Christof Kuelske

Using the framework of weak Poincar\'{e} inequalities, we analyze the convergence properties of deterministic-scan Metropolis-within-Gibbs samplers, an important class of Markov chain Monte Carlo algorithms. Our analysis applies to…

Computation · Statistics 2026-02-17 Mengxi Gao , Gareth O. Roberts , Andi Q. Wang