3 papers
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…
math.PR2025
Sharp constants relating the sub-Gaussian norm and the sub-Gaussian parameter
Lasse Leskelä, Matvei Zhukov
We determine the optimal constants in the classical inequalities relating the sub-Gaussian norm \(\|X\|_{Ï_2}\) and the sub-Gaussian parameter \(Ï_X\) for centered real-valued ra…