scientific article; zbMATH DE number 7626779

MaRDI QIDQ5053292

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

Publication date: 6 December 2022

Full work available at URL: https://arxiv.org/abs/2011.01737

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

spectral methodssparse graphsregularization techniquesgraph Laplaciansstochastic block modelsigned clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

An extension of the angular synchronization problem to the heterogeneous setting ⋮ Geometric scattering on measure spaces ⋮ Social disruption games in signed networks ⋮ Unnamed Item

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Fast community detection by SCORE
• Impact of regularization on spectral clustering
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• The planar \(k\)-means problem is NP-hard
• Angular synchronization by eigenvectors and semidefinite programming
• On the spectra of general random graphs
• Spectral clustering and the high-dimensional stochastic blockmodel
• Correlation clustering
• NP-hardness of Euclidean sum-of-squares clustering
• The trace minimization method for the symmetric generalized eigenvalue problem
• Laplacians and the Cheeger inequality for directed graphs
• An MBO scheme for clustering and semi-supervised clustering of signed networks
• Consistency of spectral clustering in stochastic block models
• Correlation clustering in general weighted graphs
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• On Perturbations of Matrix Pencils with Real Spectra
• Community Detection and Stochastic Block Models
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting
• Synchronization overZ₂and community detection in signed multiplex networks with constraints
• Covariate Regularized Community Detection in Sparse Graphs
• Graph Powering and Spectral Robustness
• An Algorithm for Online K-Means Clustering
• A useful variant of the Davis–Kahan theorem for statisticians
• Concentration and regularization of random graphs
• A Cheeger Inequality for the Graph Connection Laplacian
• Multi-way spectral partitioning and higher-order cheeger inequalities
• Probability and Computing
• The Rotation of Eigenvectors by a Perturbation. III

This page was built for publication: