scientific article; zbMATH DE number 7626779

MaRDI QIDQ5053292FDOQ5053292

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

stochastic block modelssparse graphsspectral methodsregularization techniquesgraph Laplaciansigned clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• An extension of the angular synchronization problem to the heterogeneous setting
• Social disruption games in signed networks
• Title not available (Why is that?)
• Geometric scattering on measure spaces

Uses Software

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

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)