Jigsaw percolation: Can a random graph solve a puzzle? - Charles D. Brummitt; Shirshendu Chatterjee; Partha S. Dey; David Sivakoff (CoRR, 2012)

Site Percolation on the d-Dimensional Hamming Torus. - David Sivakoff (Comb. Probab. Comput., 2014)

A Quest to Unravel the Metric Structure Behind Perturbed Networks. - Srinivasan Parthasarathy 001; David Sivakoff; Minghao Tian; Yusu Wang 001 (SoCG, 2017)

Fast Change Point Detection on Dynamic Social Networks. - Yu Wang 001; Aniket Chakrabarti; David Sivakoff; Srinivasan Parthasarathy 001 (IJCAI, 2017)

Hierarchical Change Point Detection on Dynamic Networks. - Yu Wang 001; Aniket Chakrabarti; David Sivakoff; Srinivasan Parthasarathy 001 (WebSci, 2017)

Neighborhood Growth Dynamics on the Hamming Plane. - Janko Gravner; David Sivakoff; Erik Slivken (Electron. J. Comb., 2017)

Spread Sampling and Its Applications on Graphs. - Yu Wang 001; Bortik Bandyopadhyay; Vedang Patel; Aniket Chakrabarti; David Sivakoff; Srinivasan Parthasarathy 001 (COMPLEX NETWORKS (1), 2019)

Stretched exponential decay for subcritical parking times on. - Michael Damron; Hanbaek Lyu; David Sivakoff (Random Struct. Algorithms, 2021)

Sampling random graph homomorphisms and applications to network data analysis. - Hanbaek Lyu; Facundo Mémoli; David Sivakoff (J. Mach. Learn. Res., 2023)