scientific article; zbMATH DE number 7626779

MaRDI QIDQ5053292zbMATH OpenFDO

Authors Mihai Cucuringu, Apoorv Vikram Singh, Déborah Sulem, Hemant Tyagi

Publication date 6 December 2022

Full work available at URL https://arxiv.org/abs/2011.01737, https://jmlr.csail.mit.edu/papers/v22/20-1289.html

zbMATH Keywords

stochastic block modelssparse graphsspectral methodsregularization techniquesgraph Laplaciansigned clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 878889 (Why is no real title available?)
• scientific article; zbMATH DE number 967931 (Why is no real title available?)
• A Cheeger Inequality for the Graph Connection Laplacian
• A useful variant of the Davis-Kahan theorem for statisticians
• An MBO scheme for clustering and semi-supervised clustering of signed networks
• An algorithm for online \(k\)-means clustering
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting
• Angular synchronization by eigenvectors and semidefinite programming
• Community detection and stochastic block models: recent developments
• Concentration and regularization of random graphs
• Consistency of spectral clustering in stochastic block models
• Correlation clustering
• Correlation clustering in general weighted graphs
• Covariate regularized community detection in sparse graphs
• Fast community detection by SCORE
• Graph powering and spectral robustness
• Impact of regularization on spectral clustering
• Laplacians and the Cheeger inequality for directed graphs
• NP-hardness of Euclidean sum-of-squares clustering
• On Perturbations of Matrix Pencils with Real Spectra
• On the spectra of general random graphs
• Prediction and clustering in signed networks: a local to global perspective
• Probability and Computing
• Pseudo-likelihood methods for community detection in large sparse networks
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Spectral clustering and the high-dimensional stochastic blockmodel
• Synchronization overZ₂and community detection in signed multiplex networks with constraints
• The Rotation of Eigenvectors by a Perturbation. III
• The planar \(k\)-means problem is NP-hard
• The trace minimization method for the symmetric generalized eigenvalue problem
• Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
• Using side information to reliably learn low-rank matrices from missing and corrupted observations

Cited in

(6)

• scientific article; zbMATH DE number 6751550 (Why is no real title available?)
• An extension of the angular synchronization problem to the heterogeneous setting
• Social disruption games in signed networks
• Regularized spectral methods for clustering signed networks
• scientific article; zbMATH DE number 7626745 (Why is no real title available?)
• Geometric scattering on measure spaces

Describes a project that uses

Uses Software

• lobpcg.m
• k-means++
• SNAP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053292)