scientific article; zbMATH DE number 7415091
From MaRDI portal
Publication:5159420
Wooseok Ha, Michael W. Mahoney, Kimon Fountoulakis
Publication date: 27 October 2021
Full work available at URL: https://arxiv.org/abs/1906.04863
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax rates of community detection in stochastic block models
- Reconstruction and estimation in the planted partition model
- Spectral clustering and the high-dimensional stochastic blockmodel
- Tutorial on large deviations for the binomial distribution
- A proof of the block model threshold conjecture
- Variational perspective on local graph clustering
- On semidefinite relaxations for the block model
- Community detection in degree-corrected block models
- Least angle regression. (With discussion)
- Consistency of community detection in networks under degree-corrected stochastic block models
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Convexified modularity maximization for degree-corrected stochastic block models
- Forward stagewise regression and the monotone lasso
- On the ``degrees of freedom of the lasso
- Community detection in dense random networks
- Piecewise linear regularized solution paths
- Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Exact Recovery in the Stochastic Block Model
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Almost Optimal Local Graph Clustering Using Evolving Sets
- Random graph models of social networks
- Community Detection and Stochastic Block Models
- Seeded PageRank solution paths
- High-Dimensional Probability
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection thresholds and the weak Ramanujan property
- Flow-Based Algorithms for Local Graph Clustering
- Integer Programming and Combinatorial Optimization
