7 citations · 15 across the 9 of their papers we have counts for
9 papers
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…
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…
Multilayer hypergraph clustering using the aggregate similarity matrix
Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar +1
We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-…
Persistence in a large network of locally interacting neurons
Maximiliano Altamirano, Roberto Cortez, Matthieu Jonckheere +1
This article presents a biological neural network model driven by inhomogeneous Poisson processes accounting for the intrinsic randomness of synapses. The main novelty is the intro…
Community recovery in non-binary and temporal stochastic block models
Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä
This article studies the estimation of latent community memberships from pairwise interactions in a network of nodes, where the observed interactions can be of arbitrary type,…
Stochastic order characterization of uniform integrability and tightness
Lasse Leskelä, Matti Vihola
We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This…