Research Interest

Probabilistic Combinatorics, including randomized algorithms, random graphs and Galton-Watson trees.

Papers

See Google Scholar, dblp, or Research Gate.

Thesis

X. S. Cai, “A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees,” PhD thesis, McGill University, Aug. 2016. [link]

X. S. Cai, “A probabilistic analysis of Kademlia networks,” Master’s thesis, McGill University, Aug. 2012. [link]

Talks

2017

A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees. Sweden Probabilistic Midwinter Meeting 2017. [slides]

2015

The graph structure of a deterministic automaton chosen at random. RSA 2015. CanaDAM 2015. [slides]