Zongchen
Chen

General Information

Email:
chenzongchen@gatech.edu
Phone:
404-894-8263
Location - Building:
KACB
Location - Room:
KACB 2134
Roles:
Professor (any rank)
Primary Unit:
School of Computer Science
Website URL
Homepage

Details

Degrees with subject and Postdoc Experience:
Degree Type
B.S.
Subject
Mathematics & Applied Mathematics
Year
2016
Institution
Shanghai Jiao Tong University
Location
Shanghai, China
Degree Type
Ph.D.
Subject
Algorithms, Combinatorics & Optimization
Year
2021
Institution
Georgia Institute of Technology
Location
Atlanta, GA
Degree Type
postdoctoral scholar
Subject
Mathematics
Year
2021-2023
Institution
Massachusetts Institute of Technology
Location
Cambridge, MA
Statement of Research Interests:

I have broad interests in randomized algorithms, discrete probability, and machine learning. Currently, my research focuses on Markov chain Monte Carlo (MCMC) methods, approximate counting and sampling, and learning and testing of high-dimensional distributions.

Statement of Teaching Interests:

I am interested in teaching undergraduate introductory courses, including algorithms, data structures, probability theory, and discrete math. I want to integrate mathematical backgrounds and practical applications to motivate students in these courses. For graduate courses, I am interested in teaching research-level courses on topics such as Markov chain Monte Carlo methods, approximate counting and sampling, and randomized algorithms.

Selection of recent research, scholarly, and creative activities:

Zongchen Chen and Tianhui Jiang. “Improved Mixing of Critical Hardcore Model.” In Proceedings of the 29th International Conference on Randomization and Computation (RANDOM), 2025.

Zongchen Chen, Dan Mikulincer, Daniel Reichman, and Alexander S. Wein. “Time Lower Bounds for the Metropolis Process and Simulated Annealing.” In Proceedings of the 29th International Conference on Randomization and Computation (RANDOM), 2025.

Xiaoyu Chen, Zejia Chen, Zongchen Chen, Yitong Yin, and Xinyuan Zhang. “Rapid Mixing on Random Regular Graphs Beyond Uniqueness.” In Proceedings of the 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2025.

Xiaoyu Chen, Zongchen Chen, Yitong Yin, and Xinyuan Zhang. “Rapid Mixing at the Uniqueness Threshold.” In Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing (STOC), 879–890, 2025.

Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, and Yitong Yin. “Counting random k-SAT near the satisfiability threshold.” In Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing (STOC), 867–878, 2025.

Zongchen Chen and Elchanan Mossel. “Influence Maximization in Ising Models.” In Proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS), 30:1–14, 2024.

Zongchen Chen. “Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems.” In Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 4988–5012, 2024.

Zongchen Chen and Yuzhou Gu. “Fast Sampling of b-Matchings and b-Edge Covers.” In Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 4972–4987, 2024.

Zongchen Chen, Kuikui Liu, Nitya Mani, and Ankur Moitra. “Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications.” In Proceedings of the 64th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 810–845, 2023.

Antonio Blanca, Zongchen Chen, Daniel Štefankovič, and Eric Vigoda. “Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling.” In Proceedings of the 36th Conference on Learning Theory (COLT), 1774–1790, 2023.