Persistence of activity in threshold contact processes, an "Annealed approximation" of random Boolean networks. - Shirshendu Chatterjee; Rick Durrett (Random Struct. Algorithms, 2011)

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

Spectral Clustering for Multiple Sparse Networks: I. - Sharmodeep Bhattacharyya; Shirshendu Chatterjee (CoRR, 2018)

General Community Detection with Optimal Recovery Conditions for Multi-relational Sparse Networks with Dependent Layers. - Sharmodeep Bhattacharyya; Shirshendu Chatterjee (CoRR, 2020)

Consistent detection and optimal localization of all detectable change points in piecewise stationary arbitrarily sparse network-sequences. - Sharmodeep Bhattacharyya; Shirshendu Chatterjee; Soumendu Sundar Mukherjee (CoRR, 2020)

A General Framework for Spatio-Temporal Modeling of Epidemics With Multiple Epicenters: Application to an Aerially Dispersed Plant Pathogen. - Awino M. E. Ojwang'; Trevor D. Ruiz; Sharmodeep Bhattacharyya; Shirshendu Chatterjee; Peter S. Ojiambo; David H. Gent (Frontiers Appl. Math. Stat., 2021)

Detection of Temporal Shifts in Semantics Using Local Graph Clustering. - Neil Hwang; Shirshendu Chatterjee; Yanming Di; Sharmodeep Bhattacharyya (Mach. Learn. Knowl. Extr., 2023)

Changepoint Estimation in Sparse Dynamic Stochastic Block Models under Near-Optimal Signal Strength. - Shirshendu Chatterjee; Soumendu Sundar Mukherjee; Tamojit Sadhukhan (AISTATS, 2025)