Sledovat
Zongchen Chen
Zongchen Chen
E-mailová adresa ověřena na: mit.edu - Domovská stránka
Název
Citace
Citace
Rok
Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion
Z Chen, K Liu, E Vigoda
The 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), 1537–1550, 2021
622021
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
Z Chen, SS Vempala
Theory of Computing 18 (1), 1–18, 2022
522022
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
Z Chen, K Liu, E Vigoda
The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS …, 2020
452020
Rapid mixing for colorings via spectral independence
Z Chen, A Galanis, D Štefankovič, E Vigoda
The 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1548–1557, 2021
392021
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
A Blanca, P Caputo, Z Chen, D Parisi, D Štefankovič, E Vigoda
The 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3670–3692, 2022
352022
Fast algorithms at low temperatures via Markov chains
Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda
Random Structures & Algorithms 58 (2), 294–321, 2021
232021
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.
I Bezáková, A Blanca, Z Chen, D Štefankovič, E Vigoda
Journal of Machine Learning Research 21 (25), 1–62, 2020
192020
Spectral Independence via Stability and Applications to Holant-Type Problems
Z Chen, K Liu, E Vigoda
The 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS …, 2022
122022
FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system
X Gao, B Li, Z Chen, M Yin, G Chen, Y Jin
2015 IEEE International Conference on Communications (ICC), 301–306, 2015
102015
NEMO: novel and efficient multicast routing schemes for hybrid data center networks
X Gao, T Chen, Z Chen, G Chen
Computer Networks 138, 149–163, 2018
82018
Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
A Blanca, Z Chen, E Vigoda
Random Structures & Algorithms 56 (2), 373–400, 2020
72020
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
Z Chen, A Galanis, D Štefankovič, E Vigoda
The 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2198–2207, 2022
42022
Structure Learning of H-Colorings
A Blanca, Z Chen, D Štefankovič, E Vigoda
ACM Transactions on Algorithms (TALG) 16 (3), 1–28, 2020
32020
Almost-Linear Planted Cliques Elude the Metropolis Process
Z Chen, E Mossel, I Zadik
arXiv preprint arXiv:2204.01911, 2022
22022
The Swendsen-Wang Dynamics on Trees
A Blanca, Z Chen, D Štefankovič, E Vigoda
The 25th International Conference on Randomization and Computation (RANDOM …, 2021
22021
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
A Blanca, Z Chen, D Štefankovič, E Vigoda
The 33rd Conference on Learning Theory (COLT) 125, 514–529, 2020
22020
Identity Testing for High-Dimensional Distributions via Entropy Tensorization
A Blanca, Z Chen, D Štefankovič, E Vigoda
arXiv preprint arXiv:2207.09102, 2022
12022
From algorithms to connectivity and back: finding a giant component in random k-SAT
Z Chen, N Mani, A Moitra
arXiv preprint arXiv:2207.02841, 2022
12022
On symmetric BIBDs with the same 3-concurrence
Z Chen, D Zhao
Designs, Codes and Cryptography 85 (3), 425–436, 2017
2017
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–19