Zongchen Chen

According to our database, Zongchen Chen authored at least 39 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Subquadratic Counting via Perfect Marginal Sampling.

Xiaoyu Chen, Zongchen Chen, Kuikui Liu, Xinyuan Zhang

CoRR, April, 2026

2025

Simulating Gaussian boson sampling on graphs in polynomial time.

Konrad Anand, Zongchen Chen, Mary Cryan, Graham Freifeld, Leslie Ann Goldberg, Heng Guo, Xinyuan Zhang

CoRR, November, 2025

Factorizations of relative entropy using stochastic localization.

Pietro Caputo, Zongchen Chen, Daniel Parisi

CoRR, March, 2025

Counting Random k-SAT near the Satisfiability Threshold.

Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Rapid Mixing at the Uniqueness Threshold.

Xiaoyu Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Rapid Mixing on Random Regular Graphs beyond Uniqueness.

Xiaoyu Chen, Zejia Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Time Lower Bounds for the Metropolis Process and Simulated Annealing.

Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein

Proceedings of the Approximation, 2025

Improved Mixing of Critical Hardcore Model.

Zongchen Chen, Tianhui Jiang

Proceedings of the Approximation, 2025

2024

Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity.

Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra

SIAM J. Discret. Math., 2024

Counting random <i>k</i>-SAT near the satisfiability threshold.

Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin

CoRR, 2024

Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time.

Pietro Caputo, Zongchen Chen, Yuzhou Gu, Yury Polyanskiy

CoRR, 2024

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule.

Zongchen Chen, Conor Sheehan, Ilias Zadik

CoRR, 2024

Fast Sampling of <i>b</i>-Matchings and <i>b</i>-Edge Covers.

Zongchen Chen, Yuzhou Gu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems.

Zongchen Chen

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Influence Maximization in Ising Models.

Zongchen Chen, Elchanan Mossel

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Fast Sampling of b-Matchings and b-Edge Covers.

Zongchen Chen, Yuzhou Gu

CoRR, 2023

Almost-Linear Planted Cliques Elude the Metropolis Process.

Zongchen Chen, Elchanan Mossel, Ilias Zadik

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

From Algorithms to Connectivity and Back: Finding a Giant Component in Random <i>k</i>-SAT.

Zongchen Chen, Nitya Mani

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications.

Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling.

Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Identity Testing for High-Dimensional Distributions via Entropy Tensorization.

Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

CoRR, 2022

From algorithms to connectivity and back: finding a giant component in random k-SAT.

Zongchen Chen, Nitya Mani, Ankur Moitra

CoRR, 2022

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region.

Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization.

Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Optimal Mixing of Markov Chains for Spin Systems via Spectral Independence.

Zongchen Chen

PhD thesis, 2021

Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion.

Zongchen Chen, Kuikui Liu, Eric Vigoda

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Rapid Mixing for Colorings via Spectral Independence.

Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Spectral Independence via Stability and Applications to Holant-Type Problems.

Zongchen Chen, Kuikui Liu, Eric Vigoda

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

The Swendsen-Wang Dynamics on Trees.

Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

Proceedings of the Approximation, 2021

2020

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction.

Zongchen Chen, Kuikui Liu, Eric Vigoda

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models.

Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

Proceedings of the Conference on Learning Theory, 2020

2019

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models.

Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

Proceedings of the Conference on Learning Theory, 2019

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions.

Zongchen Chen, Santosh S. Vempala

Proceedings of the Approximation, 2019

Fast Algorithms at Low Temperatures via Markov Chains.

Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda

Proceedings of the Approximation, 2019

2018

NEMO: Novel and efficient multicast routing schemes for Hybrid Data Center Networks.

Xiaofeng Gao, Tao Chen, Zongchen Chen, Guihai Chen

Comput. Networks, 2018

Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region.

Antonio Blanca, Zongchen Chen, Eric Vigoda

Proceedings of the Approximation, 2018

Structure Learning of ${H}$-colorings.

Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda

Proceedings of the Algorithmic Learning Theory, 2018

2017

On symmetric BIBDs with the same 3-concurrence.

Zongchen Chen, Da Zhao

Des. Codes Cryptogr., 2017

2015

FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system.

Xiaofeng Gao, Binjie Li, Zongchen Chen, Maofan Yin, Guihai Chen, Yaohui Jin

Proceedings of the 2015 IEEE International Conference on Communications, 2015