scientific article; zbMATH DE number 7626732
From MaRDI portal
Publication:5053218
Romain Couillet, Lorenzo Dall'Amico, Nicolas Tremblay
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2003.09198
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
unsupervised learningsparsitycommunity detectionspectral clusteringheterogeneous degree distribution
Related Items (2)
Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs ⋮ Adjusted chi-square test for degree-corrected block models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Estimating the number of communities by spectral methods
- Fast community detection by SCORE
- Impact of regularization on spectral clustering
- Belief propagation, robust reconstruction and optimal recovery of block models
- Reconstruction and estimation in the planted partition model
- Signless Laplacians of finite graphs
- Gibbs measures and phase transitions on sparse random graphs
- An impossibility result for reconstruction in the degree-corrected stochastic block model
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Consistency of spectral clustering in stochastic block models
- Spectral redemption in clustering sparse networks
- Numerical Methods for Large Eigenvalue Problems
- Emergence of Scaling in Random Networks
- Ising Model on Connected Complex Networks
- Approximating Spectral Clustering via Sampling: A Review
- Spectral bounds for the Ising ferromagnet on an arbitrary given graph
- Information, Physics, and Computation
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
- Eigenvalues of the non-backtracking operator detached from the bulk
- First-Order Perturbation Theory for Eigenvalues and Eigenvectors
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Fast unfolding of communities in large networks
- Community detection thresholds and the weak Ramanujan property
- The phase transition in inhomogeneous random graphs
- Statistical theory of superlattices
This page was built for publication:
