3 papers
math.ST2026
Detecting weighted hidden cliques
Urmisha Chatterjee, Karissa Huang, Ritabrata Karmakar +5
We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesi…
math.PR2025
Spectral properties of the Laplacian of Scale-Free Percolation models
Rajat Subhra Hazra, Nandan Malhotra
We consider scale-free percolation on a discrete torus of size . Conditionally on an i.i.d. sequence of Pareto weights with tail expon…
math.PR2025
The spectrum of dense kernel-based random graphs
Alessandra Cipriani, Rajat Subhra Hazra, Nandan Malhotra +1
Kernel-based random graphs (KBRGs) are a broad class of random graph models that account for inhomogeneity among vertices. We consider KBRGs on a discrete dimensional torus $\m…