Statistical guarantees for local graph clustering
From MaRDI portal
Recommendations
- Variational perspective on local graph clustering
- Mean field analysis of personalized PageRank with implications for local graph clustering
- Seeded PageRank solution paths
- Finding and visualizing graph clusters using PageRank optimization
- Finding and visualizing graph clusters using PageRank optimization
Cites work
- A general framework for fast stagewise algorithms
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- A proof of the block model threshold conjecture
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Almost optimal local graph clustering using evolving sets
- An algorithm for improving graph partitions
- Boosting as a regularized path to a maximum margin classifier
- Community detection and stochastic block models: recent developments
- Community detection in degree-corrected block models
- Community detection in dense random networks
- Community detection thresholds and the weak Ramanujan property
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Consistency of community detection in networks under degree-corrected stochastic block models
- Convexified modularity maximization for degree-corrected stochastic block models
- Exact Recovery in the Stochastic Block Model
- Flow-based algorithms for local graph clustering
- Forward stagewise regression and the monotone lasso
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 5957506 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Least angle regression. (With discussion)
- Minimax rates of community detection in stochastic block models
- On semidefinite relaxations for the block model
- On the ``degrees of freedom of the lasso
- Performance of first- and second-order methods for _1-regularized least squares problems
- Piecewise linear regularized solution paths
- Random graph models of social networks
- Reconstruction and estimation in the planted partition model
- Seeded PageRank solution paths
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- Tutorial on large deviations for the binomial distribution
- Variational perspective on local graph clustering
Cited in
(4)- Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
- A compressed sensing based least squares approach to semi-supervised local cluster extraction
- Statistical guarantees for local graph clustering
This page was built for publication: Statistical guarantees for local graph clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159420)
