2 papers
math.ST2025
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.PR2024
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…