activity
20202026
most citedOptimal Mixing Time for the Ising Model in the Uniqueness Regime

4 citations · 6 across the 13 of their papers we have counts for

collaborators
Showing cs.DSShow all

9 papers · 1 filter

cs.DS2026

Subgaussian Vector Balancing by an Ising Model

Heng Guo, Daniel A. Spielman, Xinyuan Zhang

We show that the guaranties of the Gram-Schmidt Walk Algorithm of Bansal, Dadush, Garg, and Lovett can be achieved by an Ising model. Given vectors of norm less…

cs.DS2025

Efficient Parallel Ising Samplers via Localization Schemes

Xiaoyu Chen, Hongyang Liu, Yitong Yin +1

We introduce efficient parallel algorithms for sampling from the Gibbs distribution and estimating the partition function of Ising models. These algorithms achieve parallel efficie…

cs.DS2025

Faster Mixing of the Jerrum-Sinclair Chain

Xiaoyu Chen, Weiming Feng, Zhe Ju +3

We show that the Jerrum-Sinclair Markov chain on matchings mixes in time on any graph with vertices, edges, and maximum degree , for any constant…

cs.DS2025

Rapid Mixing on Random Regular Graphs beyond Uniqueness

Xiaoyu Chen, Zejia Chen, Zongchen Chen +2

The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree , a we…

cs.DS2024

Rapid Mixing at the Uniqueness Threshold

Xiaoyu Chen, Zongchen Chen, Yitong Yin +1

Over the past decades, a fascinating computational phase transition has been identified in sampling from Gibbs distributions. Though, the computational complexity at the critical p…

cs.DS2024★ 1 cited

Deterministic counting from coupling independence

Xiaoyu Chen, Weiming Feng, Heng Guo +2

We show that spin systems with bounded degrees and coupling independence admit fully polynomial time approximation schemes (FPTAS). We design a new recursive deterministic counting…

cs.DS2024

Spectral Independence Beyond Total Influence on Trees and Related Graphs

Xiaoyu Chen, Xiongxin Yang, Yitong Yin +1

We study how to establish , a key concept in sampling, without relying on total influence bounds, by applying an of t…

cs.DS2022

Polynomial-Time Approximation of Zero-Free Partition Functions

Penghui Yao, Yitong Yin, Xinyuan Zhang

Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-…

cs.DS2021

Rapid mixing of Glauber dynamics via spectral independence for all degrees

Xiaoyu Chen, Weiming Feng, Yitong Yin +1

We prove an optimal lower bound on the spectral gap of Glauber dynamics for anti-ferromagnetic two-spin systems with vertices in the tree uniqueness regime. This sp…