Publications

Preprints

1. Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold
   with Z. Li.
   Preprint, arXiv:2610.25391, October 2026.

2. Fast Almost-Uniform Sampling of Random k-SAT Solutions
   with K. He and Z. Li.
   Preprint, arXiv:2610.10474, October 2026.

3. Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs
   with Z. Li.
   Preprint, arXiv:2609.12352, September 2026.

4. An FPRAS for Antiferromagnetic Ising Models on Random Regular Bipartite Graphs
   with Z. Li.
   Preprint, arXiv:2608.18612, August 2026.

5. Counting and Sampling Anti-ferromagnetic Potts Models on Random Regular Bipartite Graphs in the Non-uniqueness Regime
   with Z. Li and S. Liu.
   Preprint, arXiv:2606.21250, June 2026.

Published Papers

1. Approximate Butterfly Counting in Sublinear Time
   with C. Luo, J. Song, Y. Zhang, K. Wang, and Z. He.
   42nd IEEE International Conference on Data Engineering (ICDE), pp. 58–71, 2026.
   [arXiv]

2. Counting Random k-SAT near the Satisfiability Threshold
   with Z. Chen, A. Lonkar, C. Wang, and Y. Yin.
   57th Annual ACM Symposium on Theory of Computing (STOC), pp. 867–878, 2025.
   [arXiv]

3. A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models
   with P. Liu, G. Qiu, and B. Tao.
   Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 39(1): 487–495, 2025.
   [arXiv]

4. Power Law Decay at Criticality for the q-State Antiferromagnetic Potts Model on Regular Trees
   with C. Gu and W. Wu.
   Electronic Journal of Probability, Vol. 30, paper no. 19, 2025.
   [arXiv]

5. Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees
   with Y. Tao and S. Wang.
   Frontiers of Algorithmics (IJTCS-FAW), pp. 160–170, 2023.

6. Improved Bounds for Sampling Solutions of Random CNF Formulas
   with K. He and K. Wu.
   ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3330–3361, 2023.
   [arXiv]

7. Counting Solutions to Random CNF Formulas
   with A. Galanis, L. A. Goldberg, and H. Guo.
   SIAM Journal on Computing, 50(6): 1701–1738, 2021.
   Preliminary version appeared in ICALP 2020.
   [arXiv]

8. Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems
   with A. Galanis and L. A. Goldberg.
   Journal of Computer and System Sciences, 115: 187–213, 2021.
   Preliminary version appeared in ICALP 2017.
   [arXiv]

9. Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
   with A. Blanca, A. Galanis, L. A. Goldberg, D. Štefankovič, and E. Vigoda.
   SIAM Journal on Discrete Mathematics, 34(1): 742–793, 2020.
   Preliminary version appeared in RANDOM 2018.
   [arXiv]

10. Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree
    with A. Galanis and L. A. Goldberg.
    Electronic Journal of Probability, Vol. 23, paper no. 82, 2018.
    [arXiv]

11. An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
    with P. Lu, C. Zhang, and M. Zhu.
    ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1798–1817, 2017.
    [arXiv]

12. FPTAS for Hardcore and Ising Models on Hypergraphs
    with P. Lu and C. Zhang.
    Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs, Vol. 47, pp. 51:1–51:14, 2016.
    [arXiv]

13. Graph Metric with No Proper Inclusion Between Lines
    with X. Chen, G. Huzhang, and P. Miao.
    Discrete Applied Mathematics, 185: 59–70, 2015.
    [arXiv]