Brownian Approximation to Counting Graphs. - Soumik Pal (SIAM J. Discret. Math., 2012)

Exponentially concave functions and a new information geometry. - Soumik Pal; Ting-Kam Leonard Wong (CoRR, 2016)

Twin peaks. - Krzysztof Burdzy; Soumik Pal (Random Struct. Algorithms, 2020)

Projections of the Aldous chain on binary trees: Intertwining and consistency. - Noah Forman; Soumik Pal; Douglas Rizzolo; Matthias Winkel (Random Struct. Algorithms, 2020)

Gradient flows on graphons: existence, convergence, continuity equations. - Sewoong Oh; Soumik Pal; Raghav Somani; Raghav Tripathi (CoRR, 2021)

Community detection in the sparse hypergraph stochastic block model. - Soumik Pal; Yizhe Zhu (Random Struct. Algorithms, 2021)

Triangular Flows for Generative Modeling: Statistical Consistency, Smoothness Classes, and Fast Rates. - Nicholas J. Irons; Meyer Scetbon; Soumik Pal; Zaïd Harchaoui (AISTATS, 2022)

Entropy Regularized Optimal Transport Independence Criterion. - Lang Liu; Soumik Pal; Zaïd Harchaoui (AISTATS, 2022)

Stochastic optimization on matrices and a graphon McKean-Vlasov limit. - Zaïd Harchaoui; Sewoong Oh; Soumik Pal; Raghav Somani; Raghavendra Tripathi (CoRR, 2022)

The Benefits of Balance: From Information Projections to Variance Reduction. - Lang Liu; Ronak Mehta; Soumik Pal; Zaïd Harchaoui (NeurIPS, 2024)