JWJiaheng Wang

Jiaheng Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jiaheng Wang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Can you link up with treewidth?

    by Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang

  • Open Access

    Approximate Counting for Spin Systems in Sub-Quadratic Time

    by Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang

    We present two randomised approximate counting algorithms with $\widetilde{O}(n^{2-c}/\varepsilon^2)$ running time for some constant $c>0$ and accuracy $\varepsilon$: (1) for the hard-core model with fugacity $\lambda$ on graphs with maximum degree $\Delta$ when $\lambda=O(\Delta^{-1.5-c_1})$ where $c_1=c/(2-2c)$; (2) for spin systems with strong spatial mixing (SSM) on planar graphs with quadratic growth, such as $\mathbb{Z}^2$. For the hard-core model, Weitz's algorithm (STOC, 2006) achieves sub-quadratic running time when correlation decays faster than the neighbourhood growth, namely when $\lambda = o(\Delta^{-2})$. Our first algorithm does not require this property and extends the range where sub-quadratic algorithms exist. Our second algorithm appears to be the first to achieve sub-quadratic running time up to the SSM threshold, albeit on a restricted family of graphs. It also extends to (not necessarily planar) graphs with polynomial growth, such as $\mathbb{Z}^d$, but with a running time of the form $\widetilde{O}\left(n^2\varepsilon^{-2}/2^{c(\log n)^{1/d}}\right)$ where $d$ is the exponent of the polynomial growth and $c>0$ is some constant.Comment: 27 pages. This is the TheoretiCS journal version

  • Open Access

    Towards derandomising Markov chain Monte Carlo

    by Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin

    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 distributions. For the latter task, we introduce a method called coupling towards the past that can, in logarithmic time, evaluate one or a constant number of variables from a stationary Markov chain state. Since there are at most logarithmic random choices, this leads to very simple derandomisation. We provide two applications of this framework, namely efficient deterministic approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type conditions matching, up to lower order factors, their state-of-the-art randomised counterparts.

  • Open Access

    Inapproximability of Counting Hypergraph Colourings

    by Andreas Galanis, Heng Guo, Jiaheng Wang

    Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction problems (CSPs) with large arities, using connections to the Lovász Local Lemma. Nevertheless, the boundaries of these methods for CSPs with non-Boolean domain are not well-understood. Our goal in this article is to fill in this gap and obtain strong inapproximability results by studying the prototypical problem in this class of CSPs, hypergraph colourings. More precisely, we focus on the problem of approximately counting q -colourings on K -uniform hypergraphs with bounded degree Δ. An efficient algorithm exists if \({{\Delta \lesssim \frac{q^{K/3-1}}{4^KK^2}}}\) [Jain et al. 25 ; He et al. 23 ]. Somewhat surprisingly however, a hardness bound is not known even for the easier problem of finding colourings. For the counting problem, the situation is even less clear and there is no evidence of the right constant controlling the growth of the exponent in terms of K . To this end, we first establish that for general q computational hardness for finding a colouring on simple/linear hypergraphs occurs at Δ ≳ Kq K , almost matching the algorithm from the Lovász Local Lemma. Our second and main contribution is to obtain a far more refined bound for the counting problem that goes well beyond the hardness of finding a colouring and which we conjecture is asymptotically tight (up to constant factors). We show in particular that for all even q ≥ 4 it is NP -hard to approximate the number of colourings when Δ ≳ q K/2 . Our approach is based on considering an auxiliary weighted binary CSP model on graphs, which is obtained by “halving” the K -ary hypergraph constraints. This allows us to utilise reduction techniques available for the graph case, which hinge upon understanding the behaviour of random regular bipartite graphs that serve as gadgets in the reduction. The major challenge in our setting is to analyse the induced matrix norm of the interaction matrix of the new CSP which captures the most likely solutions of the system. In contrast to previous analyses in the literature, the auxiliary CSP demonstrates both symmetry and asymmetry, making the analysis of the optimisation problem severely more complicated and demanding the combination of delicate perturbation arguments and careful asymptotic estimates.