# Jiaheng Wang

## Contact

Room 5.34, Informatics Forum, 10 Crichton Street,
Edinburgh, EH8 9AB, Scotland, UK
Email: pw384 # hotmail # com OR jiaheng.wang # ed # ac # uk
CV: [Here] (Last update: 23/01/2023)
[Google Scholar] | [ORCID] | [dblp]

I am a third-year PhD student at the School of Informatics, University of Edinburgh. It is an honour for me to be supervised by Heng Guo. Prior to that, I obtained Bachelor of Science (summa cum laude) at Peking University, majoring in computer science, and was a member of PKU’s Turing Class. My undergraduate research advisor is Xiaoming Sun from Institute of Computing Technology, CAS. I also worked with Pinyan Lu and Chihao Zhang for my last few months of my undergraduate study.

My research interest lies in several topics in theoretical computer science. To be more precise, I enjoy problems with inspiring combinatorial structures. That includes (randomised) algorithms and complexity of approximate counting, and extremal graph theory.

#### Misc

• Aside from academic topics, I am also fond of abundant recreations, from playing bass guitar to video games. Unfortunately, my busy days force me to put those hobbies aside, as I can no longer devote any much towards competitive gaming.
• My Erdős-Bacon-Sabbath number is infinity - I am not revealing the Erdős number here ;)

## Research

PDF versions are always up-to-date. Authors are listed according to the alphabetical order. Papers are sorted by date of first submission.

Inapproximability of counting independent sets in linear hypergraphs
with Guoliang Qiu
preprint (intended for publication?)
[arxiv] | [PDF]

Towards derandomising Markov chain Monte Carlo
with Weiming Feng, Heng Guo, Chunyang Wang and Yitong Yin
submitted
[arxiv] | [PDF]

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
with Weiming Feng, Heng Guo and Mark Jerrum
SOSA 2023
[doi] | [arXiv] | [PDF] | [slides]

Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
with Weiming Feng and Heng Guo
submitted
[arXiv] | [PDF]

Improved bounds for randomly colouring simple hypergraphs
with Weiming Feng and Heng Guo
RANDOM 2022
[doi] | [arXiv] | [PDF] | [slides]

Inapproximability of counting hypergraph colourings
with Andreas Galanis and Heng Guo
ACM Transactions on Computation Theory, 14(3-4):10, pp. 1-33, 2022
[doi] | [arXiv] | [PDF] | [slides]

On the degree of boolean functions as polynomials over $$\mathbb{Z}_m$$
with Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia and Yufan Zheng
ICALP 2020
[doi] | [arXiv] | [PDF] | [slides]

## Teaching

#### At University of Edinburgh

• Introduction to Algorithms and Data Structures (INFR08026, 2022/23 (whole year), TA)
• Randomized Algorithms (INFR11201, 2022 Autumn, Tutor)
• Introduction to Algorithms and Data Structures (INFR08026, 2021/22 (whole year), TA)

#### At Peking University

• Introduction to the Theory of Computation (04833440, 2020 Spring, TA)
• Randomized Algorithms (04834010, 2020 Spring, TA)
• Introduction to Computer Systems (04833040 / 04832363, 2019 Fall, TA)
• Introduction to the Theory of Computation (04833440, 2019 Spring, TA)
• Introduction to Computer Systems (04833040 / 04832363, 2018 Fall, TA)