Zongchen Chen

Orcid: 0009-0003-6112-2888

According to our database1, Zongchen Chen authored at least 37 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Rapid Mixing on Random Regular Graphs beyond Uniqueness.
CoRR, April, 2025

Factorizations of relative entropy using stochastic localization.
CoRR, March, 2025

Counting Random k-SAT near the Satisfiability Threshold.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Rapid Mixing at the Uniqueness Threshold.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Time Lower Bounds for the Metropolis Process and Simulated Annealing.
Proceedings of the Approximation, 2025

Improved Mixing of Critical Hardcore Model.
Proceedings of the Approximation, 2025

2024
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity.
SIAM J. Discret. Math., 2024

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

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

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

Fast Sampling of <i>b</i>-Matchings and <i>b</i>-Edge Covers.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Influence Maximization in Ising Models.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Fast Sampling of b-Matchings and b-Edge Covers.
CoRR, 2023

Almost-Linear Planted Cliques Elude the Metropolis Process.
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.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Identity Testing for High-Dimensional Distributions via Entropy Tensorization.
CoRR, 2022

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

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Optimal Mixing of Markov Chains for Spin Systems via Spectral Independence.
PhD thesis, 2021

Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Rapid Mixing for Colorings via Spectral Independence.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Spectral Independence via Stability and Applications to Holant-Type Problems.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

The Swendsen-Wang Dynamics on Trees.
Proceedings of the Approximation, 2021

2020
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models.
Proceedings of the Conference on Learning Theory, 2020

2019
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models.
Proceedings of the Conference on Learning Theory, 2019

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions.
Proceedings of the Approximation, 2019

Fast Algorithms at Low Temperatures via Markov Chains.
Proceedings of the Approximation, 2019

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

Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region.
Proceedings of the Approximation, 2018

Structure Learning of ${H}$-colorings.
Proceedings of the Algorithmic Learning Theory, 2018

2017
On symmetric BIBDs with the same 3-concurrence.
Des. Codes Cryptogr., 2017

2015
FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system.
Proceedings of the 2015 IEEE International Conference on Communications, 2015


  Loading...