collaborators

5 papers

math.PR2026

Sharp connectivity bounds for the vacant set of random interlacements

Subhajit Goswami, Pierre-François Rodriguez, Yuriy Shulzhenko

We consider percolation of the vacant set of random interlacements at intensity in dimensions three and higher, and derive lower bounds on the truncated two-point function for…

math.ST2026

Sharp minimax risks and phase transitions in sparse submatrix detection

Subhajit Goswami, Rajarshi Mukherjee

We study the minimax risk for detecting a sparse elevated-mean Gaussian submatrix inside a larger noisy matrix. When the planted submatrix has size and the ambient matr…

math.PR2026

Critical level-set percolation on finite graphs and spectral gap

Subhajit Goswami, Dipranjan Pal

We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $…

math.PR2025

Strong local uniqueness for the vacant set of random interlacements

Subhajit Goswami, Pierre-François Rodriguez, Yuriy Shulzhenko

We consider the the vacant set of random interlacements on in dimensions . For varying intensity , the connectivity properties of $\m…

stat.ML2025

A new approach to locally adaptive polynomial regression

Sabyasachi Chatterjee, Subhajit Goswami, Soumendu Sundar Mukherjee

Adaptive bandwidth selection is a fundamental challenge in nonparametric regression. This paper introduces a new bandwidth selection procedure inspired by the optimality criteria f…