◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Heng Guo

35 papers hereh-index 201.1k citations76 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author14
  • middle author18
  • last author1

Across the 33 of 35 papers where every author was matched, so the position is known.

fields
  • cs.DS21
  • cs.CC11
  • math.PR2
  • cs.LG1
same name
  • Heng Guo — 14 papers, h 5
  • Heng Guo — 8 papers, h 3
  • Heng Guo — 7 papers, h 2
  • Heng Guo — 7 papers, h 2
  • Heng Guo — 6 papers, h 3
  • Heng Guo — 6 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20122026
most cited#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region

37 citations · 171 across the 30 of their papers we have counts for

collaborators
Showing 2022Show all

4 papers · 1 filter

cs.DS2022

Towards derandomising Markov chain Monte Carlo

Weiming Feng, Heng Guo, Chunyang Wang +2

We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of marginal…

cs.DS2022

Fast sampling of satisfying assignments from random k-SAT with applications to connectivity

Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +4

We give a nearly linear-time algorithm to approximately sample satisfying assignments in the random k-SAT model when the density of the formula scales exponentially with k. The…

cs.DS2022

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields

Weiming Feng, Heng Guo, Jiaheng Wang

We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand m…

cs.DS2022

Improved bounds for randomly colouring simple hypergraphs

Weiming Feng, Heng Guo, Jiaheng Wang

We study the problem of sampling almost uniform proper q-colourings in k-uniform simple hypergraphs with maximum degree Δ. For any δ>0, if k≥δ20(1+δ)​ and $q \…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.