Community detection in sparse random networks
From MaRDI portal
Abstract: We consider Gaussian mixture models in high dimensions and concentrate on the twin tasks of detection and feature selection. Under sparsity assumptions on the difference in means, we derive information bounds and establish the performance of various procedures, including the top sparse eigenvalue of the sample covariance matrix and other projection tests based on moments, such as the skewness and kurtosis tests of Malkovich and Afifi (1973), and other variants which we were better able to control under the null.
Recommendations
Cites work
- scientific article; zbMATH DE number 5822962 (Why is no real title available?)
- scientific article; zbMATH DE number 5968943 (Why is no real title available?)
- scientific article; zbMATH DE number 4082595 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- A nonparametric view of network models and Newman–Girvan and other modularities
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Bayesian anomaly detection methods for social networks
- Belief propagation, robust reconstruction and optimal recovery of block models
- Community detection in dense random networks
- Community detection in sparse random networks
- Community structure in social and biological networks
- Counting connected graphs inside-out
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Finding hidden cliques in linear time
- Finding hidden cliques in linear time with high probability
- Moment inequalities for functions of independent random variables
- On the limiting distribution of a graph scan statistic
- Optimal detection of sparse principal components in high dimension
- Random graphs and complex networks. Volume 1
- Testing Statistical Hypotheses
Cited in
(39)- Finding one community in a sparse graph
- Community detection in sparse random networks
- Computing exact \(p\)-values for community detection
- Testing correlation of unlabeled random graphs
- Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials
- Statistical limits of spiked tensor models
- Optimization via low-rank approximation for community detection in networks
- Identifying Community Structures from Network Data via Maximum Likelihood Methods
- Test dense subgraphs in sparse uniform hypergraph
- Community detection in the sparse hypergraph stochastic block model
- Tensor clustering with planted structures: statistical optimality and computational limits
- Computational barriers in minimax submatrix detection
- Hypothesis testing in sparse weighted stochastic block model
- The k-Dense Method to Extract Communities from Complex Networks
- Community detection on Euclidean random graphs
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Uniform estimation in stochastic block models is slow
- Detecting a botnet in a network
- Community detection in dense random networks
- Computational barriers to estimation from low-degree polynomials
- Detection thresholds for the \(\beta\)-model on sparse graphs
- Concentration and stability of community-detecting functions on random networks
- Detecting a planted community in an inhomogeneous random graph
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Bounded Arboricity to Determine the Local Structure of Sparse Graphs
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- Cliques in rank-1 random graphs: the role of inhomogeneity
- scientific article; zbMATH DE number 7234180 (Why is no real title available?)
- Average Jaccard index of random graphs
- Sharp detection boundaries on testing dense subhypergraph
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Probabilistic Community Detection With Unknown Number of Communities
- Spectral clustering in the dynamic stochastic block model
- Two-sample hypothesis testing for inhomogeneous random graphs
- Heterogeneous dense subhypergraph detection
- scientific article; zbMATH DE number 6795997 (Why is no real title available?)
- How robust are reconstruction thresholds for community detection?
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
This page was built for publication: Community detection in sparse random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894814)
