26 citations · 82 across the 12 of their papers we have counts for
12 papers
Dynamic angular synchronization under smoothness constraints
Ernesto Araya, Mihai Cucuringu, Hemant Tyagi
Given an undirected measurement graph , the classical angular synchronization problem consists of recovering unknown angles fr…
Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models
Ning Zhang, Xiaowen Dong, Mihai Cucuringu
Graph clustering is a fundamental task in unsupervised learning with broad real-world applications. While spectral clustering methods for undirected graphs are well-established and…
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…
Learning with Semi-Definite Programming: new statistical bounds based on fixed point analysis and excess risk curvature
Stéphane Chrétien, Mihai Cucuringu, Guillaume Lecué +1
Many statistical learning problems have recently been shown to be amenable to Semi-Definite Programming (SDP), with community detection and clustering in Gaussian mixture models as…
Hermitian matrices for clustering directed graphs: insights and applications
Mihai Cucuringu, Huan Li, He Sun +1
Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for cluste…