Zongchen Chen

According to our database1, Zongchen Chen authored at least 30 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity.
SIAM J. Discret. Math., 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
The Swendsen-Wang dynamics on trees.
Random Struct. Algorithms, July, 2023

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction.
SIAM J. Comput., February, 2023

Time Lower Bounds for the Metropolis Process and Simulated Annealing.
CoRR, 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
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions.
Adv. Math. Commun., 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
Fast algorithms at low temperatures via Markov chains.
Random Struct. Algorithms, 2021

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models.
J. Mach. Learn. Res., 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

2020
Structure Learning of H-Colorings.
ACM Trans. Algorithms, 2020

Swendsen-Wang dynamics for general graphs in the tree uniqueness region.
Random Struct. Algorithms, 2020

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.
J. Mach. Learn. Res., 2020

2018
NEMO: Novel and efficient multicast routing schemes for Hybrid Data Center Networks.
Comput. Networks, 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...