Scholar
Heng Guo
Google Scholar ID: 993eudcAAAAJ
University of Edinburgh
Citations & Impact
Citations
960
H-index
18
i10-index
32
Publications
20
Co-authors
37
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Paper 'Uniform sampling through the Lovász local lemma' (with Mark Jerrum and Jingcheng Liu), J. ACM 66(3):18, 2019
- Paper 'A polynomial-time approximation algorithm for all-terminal network reliability' (with Mark Jerrum), SIAM J. Comput. 48(3), 2019; Best Paper Award at ICALP 2018
- Introduced the 'partial rejection sampling' framework, confirming a conjecture by Gorodezky and Pak (2014), yielding the first polynomial-time approximation algorithm for all-terminal network reliability—a problem open since the 1980s
- Paper 'Random cluster dynamics for the Ising model is rapidly mixing' (with Mark Jerrum), Ann. Appl. Probab. 28(2), 2018; proved rapid mixing of the Swendsen-Wang algorithm for ferromagnetic Ising models, resolving a conjecture by Sokal from the 1990s
- Contributed to Holant complexity classification results, including key papers at FOCS 2015 and SIAM J. Comput. 2016
- Recipient of an ERC Starting Grant (NACS)
Background
- Reader in Algorithms and Complexity at the School of Informatics, University of Edinburgh
- Research focuses on algorithms from a complexity perspective, particularly computational counting and sampling
- Typical problems include computing marginal probabilities, expectations of random variables, and evaluating partition functions
- Aims to understand the boundary between problems with efficient algorithms and those without
- Hometown: Luoyang
