Cover Image

Fast Mixing in Sparse Random Ising Models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Kuikui, Mohanty, Sidhanth, Rajaraman, Amit, Wu, David X.
Format:	Preprint
Published:	2024
Subjects:	Probability Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses
by: Huang, Brice, et al.
Published: (2024)

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

Markov Chains Approximate Message Passing
by: Rajaraman, Amit, et al.
Published: (2025)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Eigenvalue Bounds for Random Matrices via Zerofreeness
by: Mohanty, Sidhanth, et al.
Published: (2025)

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

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

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

The Metric Dimension of Sparse Random Graphs
by: Díaz, Josep, et al.
Published: (2025)

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

Sparsifying Cayley Graphs on Every Group
by: Hsieh, Jun-Ting, et al.
Published: (2025)

Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024)

Heights of butterfly trees
by: Peca-Medlin, John, et al.
Published: (2025)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
by: Koehler, Frederic, et al.
Published: (2025)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
by: Shao, Shuai, et al.
Published: (2025)

The Horton-Strahler number of butterfly trees
by: Peca-Medlin, John
Published: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

Sampling from convex sets with a cold start using multiscale decompositions
by: Narayanan, Hariharan, et al.
Published: (2022)

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

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

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
by: Hsieh, Jun-Ting, et al.
Published: (2026)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

Distance Reconstruction of Sparse Random Graphs
by: Bastide, Paul
Published: (2024)

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

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

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

Fast relaxation of the random field Ising dynamics
by: Alaoui, Ahmed El, et al.
Published: (2023)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)

Some easy optimization problems have the overlap-gap property
by: Li, Shuangping, et al.
Published: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Polynomial-time sampling despite disorder chaos
by: Ma, Eric, et al.
Published: (2025)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
by: Gaudio, Julia, et al.
Published: (2026)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Approximate Counting in Local Lemma Regimes
by: Mann, Ryan L., et al.
Published: (2025)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)