26 citations · 39 across the 4 of their papers we have counts for
9 papers
Clustering multilayer graphs with missing nodes
Guillaume Braun, Hemant Tyagi, Christophe Biernacki
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each…
An extension of the angular synchronization problem to the heterogeneous setting
Mihai Cucuringu, Hemant Tyagi
Given an undirected measurement graph , the classical angular synchronization problem consists of recovering unknown angles from a collection of noisy…
Regularized spectral methods for clustering signed networks
Mihai Cucuringu, Apoorv Vikram Singh, Déborah Sulem +1
We study the problem of -way clustering in signed graphs. Considerable attention in recent years has been devoted to analyzing and modeling signed graphs, where the affinity mea…
Ranking and synchronization from pairwise measurements via SVD
Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi
Given a measurement graph and an unknown signal , we investigate algorithms for recovering from pairwise measurements of the form ; $\…
SPONGE: A generalized eigenproblem for clustering signed networks
Mihai Cucuringu, Peter Davies, Aldo Glielmo +1
We introduce a principled and theoretically sound spectral method for -way clustering in signed graphs, where the affinity measure between nodes takes either positive or negativ…
Multi-kernel unmixing and super-resolution using the Modified Matrix Pencil method
Stéphane Chrétien, Hemant Tyagi
Consider groups of point sources or spike trains, with the group represented by . For a function , let $g_l(t) = g(…