default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZongchen Chen
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra:
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity. SIAM J. Discret. Math. 38(4): 2750-2811 (2024)- [j11]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. TheoretiCS 3 (2024) - [c21]Zongchen Chen, Elchanan Mossel:
Influence Maximization in Ising Models. ITCS 2024: 30:1-30:14 - [c20]Zongchen Chen, Yuzhou Gu:
Fast Sampling of b-Matchings and b-Edge Covers. SODA 2024: 4972-4987 - [c19]Zongchen Chen:
Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems. SODA 2024: 4988-5012 - [i24]Zongchen Chen, Conor Sheehan, Ilias Zadik:
On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule. CoRR abs/2408.00746 (2024) - [i23]Pietro Caputo, Zongchen Chen, Yuzhou Gu, Yury Polyanskiy:
Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time. CoRR abs/2409.07689 (2024) - [i22]Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin:
Counting random k-SAT near the satisfiability threshold. CoRR abs/2411.02980 (2024) - [i21]Xiaoyu Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang:
Rapid Mixing at the Uniqueness Threshold. CoRR abs/2411.03413 (2024) - 2023
- [j10]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang dynamics on trees. Random Struct. Algorithms 62(4): 791-831 (2023) - [j9]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. SIAM J. Comput. 52(1): 196-237 (2023) - [c18]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT 2023: 1774-1790 - [c17]Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra:
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications. FOCS 2023: 810-845 - [c16]Zongchen Chen, Nitya Mani:
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT. SODA 2023: 3437-3470 - [c15]Zongchen Chen, Elchanan Mossel, Ilias Zadik:
Almost-Linear Planted Cliques Elude the Metropolis Process. SODA 2023: 4504-4539 - [i20]Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra:
Strong spatial mixing for colorings on trees and its algorithmic applications. CoRR abs/2304.01954 (2023) - [i19]Zongchen Chen, Yuzhou Gu:
Fast Sampling of b-Matchings and b-Edge Covers. CoRR abs/2304.14289 (2023) - [i18]Zongchen Chen:
Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems. CoRR abs/2307.08212 (2023) - [i17]Zongchen Chen, Elchanan Mossel:
Influence Maximization in Ising Models. CoRR abs/2309.05206 (2023) - [i16]Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein:
Time Lower Bounds for the Metropolis Process and Simulated Annealing. CoRR abs/2312.13554 (2023) - 2022
- [j8]Zongchen Chen, Santosh S. Vempala:
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. Adv. Math. Commun. 18: 1-18 (2022) - [c14]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. SODA 2022: 2198-2207 - [c13]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. SODA 2022: 3670-3692 - [i15]Zongchen Chen, Elchanan Mossel, Ilias Zadik:
Almost-Linear Planted Cliques Elude the Metropolis Process. CoRR abs/2204.01911 (2022) - [i14]Zongchen Chen, Nitya Mani, Ankur Moitra:
From algorithms to connectivity and back: finding a giant component in random k-SAT. CoRR abs/2207.02841 (2022) - [i13]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR abs/2207.09102 (2022) - 2021
- [j7]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. 22: 152:1-152:56 (2021) - [j6]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - [c12]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM 2021: 43:1-43:15 - [c11]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. FOCS 2021: 149-160 - [c10]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. SODA 2021: 1548-1557 - [c9]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. STOC 2021: 1537-1550 - [i12]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR abs/2103.07459 (2021) - [i11]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR abs/2105.01784 (2021) - [i10]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. CoRR abs/2106.03366 (2021) - 2020
- [j5]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. J. Mach. Learn. Res. 21: 25:1-25:62 (2020) - [j4]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang dynamics for general graphs in the tree uniqueness region. Random Struct. Algorithms 56(2): 373-400 (2020) - [j3]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-Colorings. ACM Trans. Algorithms 16(3): 36:1-36:28 (2020) - [c8]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT 2020: 514-529 - [c7]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. FOCS 2020: 1307-1318 - [i9]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. CoRR abs/2004.09083 (2020) - [i8]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR abs/2004.10805 (2020) - [i7]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. CoRR abs/2007.08058 (2020) - [i6]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. CoRR abs/2007.08068 (2020) - [i5]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion. CoRR abs/2011.02075 (2020)
2010 – 2019
- 2019
- [c6]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins
, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [c5]Zongchen Chen, Santosh S. Vempala:
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. APPROX-RANDOM 2019: 64:1-64:12 - [c4]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - [i4]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR abs/1901.07361 (2019) - [i3]Zongchen Chen, Santosh S. Vempala:
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. CoRR abs/1905.02313 (2019) - 2018
- [j2]Xiaofeng Gao, Tao Chen, Zongchen Chen, Guihai Chen:
NEMO: Novel and efficient multicast routing schemes for Hybrid Data Center Networks. Comput. Networks 138: 149-163 (2018) - [c3]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of ${H}$-colorings. ALT 2018: 152-185 - [c2]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. APPROX-RANDOM 2018: 32:1-32:18 - [i2]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. CoRR abs/1806.04602 (2018) - 2017
- [j1]Zongchen Chen, Da Zhao:
On symmetric BIBDs with the same 3-concurrence. Des. Codes Cryptogr. 85(3): 425-436 (2017) - [i1]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-colorings. CoRR abs/1708.05118 (2017) - 2015
- [c1]Xiaofeng Gao, Binjie Li, Zongchen Chen, Maofan Yin, Guihai Chen, Yaohui Jin:
FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system. ICC 2015: 301-306
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
