Kuan Yang

Room 008, Wolfson Building, Department of Computer Science

University of Oxford

Email: firstname.lastname@cs.ox.ac.uk

I am a fourth-year Ph.D. candidate in the Department of Computer Science at University of Oxford, supervised by Prof. Leslie Ann Goldberg and Prof. Andreas Galanis. I am a Clarendon Scholar in Oxford, fully-funded by the Clarendon scholarship from 2015 to 2019. Before coming to Oxford, I obtained my bachelor degree in Computer Science from Zhiyuan College at Shanghai Jiao Tong University in China.

I am interested in many aspects of theoretical computer science, discrete probability and combinatorics. Currently I mainly work on designing and analysing approximation algorithms for counting and sampling problems.

Education

2011 - 2015 B.Sc. in Computer Science, Zhiyuan College, Shanghai Jiao Tong University

2015 - 2020 Ph.D. in Computer Science, University of Oxford

Publications

My Erdős number is 3.

  1. Graph metric with no proper inclusion between lines (arXiv) with X. Chen, G. Huzhang and P. Miao. Discrete Applied Mathematics, 185:59–70, 2015.
  2. FPTAS for Hardcore and Ising Models on Hypergraphs (arXiv) with P. Lu and C. Zhang. In Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 51:1–51:14, 2016
  3. An FPTAS for Counting Proper Four-Colorings on Cubic Graphs (arXiv) with P. Lu, C. Zhang and M. Zhu. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), 1798–1817, 2017.
  4. Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems (arXiv) with A. Galanis and L. Goldberg. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 27:1–27:14, 2017
  5. Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree (arXiv) with A. Galanis and L. Goldberg. Electronic Journal of Probability 23 (2018), paper no. 82, 43 pp.
  6. Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs (arXiv) with A. Blanca, A. Galanis, L. Goldberg, D. Stefankovic and E. Vigoda. In Proceddings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018).
  7. Counting solutions to random CNF formulas (arXiv) with A. Galanis, H. Guo and L. Goldberg. To appear in ICALP'20.

Invited talks

  • Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems Dagstuhl Seminar 17341 (Computational Counting), Schloss Dagstuhl, Aug. 23, 2017.
  • Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs John Hopcroft Center Lecture Series for Computer Science, Shanghai Jiao Tong University, Dec. 26, 2018.
  • Counting solutions to random CNF formulas Institute of Computing Technology, Chinese Academy of Sciences, Dec. 24, 2019 / Institute for Theoretical Computer Science, Shanghai University of Finance and Economics, Dec. 30, 2019 / ICALP'20, online conference, July 8, 2020.