:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Xiaoyu, Feng, Weiming
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Probability
Online Access:	https://arxiv.org/abs/2407.04672
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Rapid Mixing at the Uniqueness Threshold
by: Chen, Xiaoyu, et al.
Published: (2024)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
by: Chen, Xiaoyu, et al.
Published: (2025)

Edge-Tilting Field Dynamics: Rapid Mixing at the Uniqueness Threshold and Optimal Mixing for Swendsen-Wang Dynamics
by: Chen, Xiaoyu, et al.
Published: (2026)

Faster Mixing of the Jerrum-Sinclair Chain
by: Chen, Xiaoyu, et al.
Published: (2025)

Rapid mixing in positively weighted restricted Boltzmann machines
by: Feng, Weiming, et al.
Published: (2026)

Spectral Independence Beyond Total Influence on Trees and Related Graphs
by: Chen, Xiaoyu, et al.
Published: (2024)

Subquadratic Counting via Perfect Marginal Sampling
by: Chen, Xiaoyu, et al.
Published: (2026)

On approximating the $f$-divergence between two Ising models
by: Feng, Weiming, et al.
Published: (2025)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

Approximating the Total Variation Distance between Gaussians
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)

Improved Mixing of Critical Hardcore Model
by: Chen, Zongchen, et al.
Published: (2025)

On Computing Total Variation Distance Between Mixtures of Product Distributions
by: Feng, Weiming, et al.
Published: (2026)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
by: He, Yuchen, et al.
Published: (2026)

Mixing of general biased adjacent transposition chains
by: Gheissari, Reza, et al.
Published: (2025)

The Mixed Birth-death/death-Birth Moran Process
by: Brewster, David A., et al.
Published: (2025)

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
by: Liu, Kuikui, et al.
Published: (2024)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2024)

Mixing on Generalized Associahedra
by: Chang, William, et al.
Published: (2024)

Fast Mixing in Sparse Random Ising Models
by: Liu, Kuikui, et al.
Published: (2024)

Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)

Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

Counterexamples to a Weitz-Style Reduction for Multispin Systems
by: Liu, Kuikui, et al.
Published: (2024)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
by: Sellke, Mark
Published: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)

Semirandom Planted Clique via 1-norm Isometry Property
by: Guruswami, Venkatesan, et al.
Published: (2025)

A Unified Construction of Streaming Sketches via the Lévy-Khintchine Representation Theorem
by: Pettie, Seth, et al.
Published: (2024)

Decay of correlation for edge colorings when $q>3Δ$
by: Chen, Zejia, et al.
Published: (2025)

Perfect Sampling for Hard Spheres from Strong Spatial Mixing
by: Anand, Konrad, et al.
Published: (2023)

Strong Low Degree Hardness for the Number Partitioning Problem
by: Mallarapu, Rushil, et al.
Published: (2025)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
by: Sohn, Youngtak, et al.
Published: (2025)

Approximate Counting for Spin Systems in Sub-Quadratic Time
by: Anand, Konrad, et al.
Published: (2023)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
by: Shao, Shuai, et al.
Published: (2024)

Robust recovery for stochastic block models, simplified and generalized
by: Mohanty, Sidhanth, et al.
Published: (2024)

Reconstruction of geometric random graphs with the Simple algorithm
by: Stegehuis, Clara, et al.
Published: (2024)

On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)

Convergence Properties of the Asynchronous Maximum Model
by: Larkin, John
Published: (2024)