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.ST2026
Consistent line clustering using geometric hypergraphs
Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar +1
Subspace clustering becomes inherently difficult near intersections, where points from different subspaces are barely separated. Most existing theoretical results address this issu…
math.PR2026
Community Detection on Block Models with Geometric Kernels
Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä
We consider the community recovery problem on a one-dimensional random geometric graph where every node has two independent labels: an observed location label and a hidden communit…