A Probabilistic Analysis of Kademlia Networks. - Xing Shi Cai; Luc Devroye (ISAAC, 2013)

The graph structure of a deterministic automaton chosen at random: full version. - Xing Shi Cai; Luc Devroye (CoRR, 2015)

The Analysis of Kademlia for Random IDs. - Xing Shi Cai; Luc Devroye (Internet Math., 2015)

The graph structure of a deterministic automaton chosen at random. - Xing Shi Cai; Luc Devroye (Random Struct. Algorithms, 2017)

Acyclic edge colourings of graphs with large girth. - Xing Shi Cai; Guillem Perarnau; Bruce A. Reed; Adam Bene Watts (Random Struct. Algorithms, 2017)

Non-Fringe Subtrees in Conditioned Galton - Watson Trees. - Xing Shi Cai; Svante Janson (Electron. J. Comb., 2018)

k -cuts on a Path. - Xing Shi Cai; Luc Devroye; Cecilia Holmgren; Fiona Skerman (CIAC, 2019)

Cutting Resilient Networks - Complete Binary Trees. - Xing Shi Cai; Cecilia Holmgren (Electron. J. Comb., 2019)

Inversions in Split Trees and Conditional Galton-Watson Trees. - Xing Shi Cai; Cecilia Holmgren; Svante Janson; Tony Johansson; Fiona Skerman (Comb. Probab. Comput., 2019)

The k-Cut Model in Conditioned Galton-Watson Trees. - Gabriel Berzunza Ojeda; Xing Shi Cai; Cecilia Holmgren (AofA, 2020)

The diameter of the directed configuration model. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

The giant component of the directed configuration model revisited. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

Minimum stationary values of sparse random directed graphs. - Xing Shi Cai; Guillem Perarnau (CoRR, 2020)

The $k$-Cut Model in Deterministic and Random Trees. - Gabriel Berzunza Ojeda; Xing Shi Cai; Cecilia Holmgren (Electron. J. Comb., 2021)

Rankings in directed configuration models with heavy tailed in-degrees. - Xing Shi Cai; Pietro Caputo; Guillem Perarnau; Matteo Quattropani (CoRR, 2021)