Spectral clustering and the high-dimensional stochastic blockmodel

From MaRDI portal
Publication:651016

DOI10.1214/11-AOS887zbMath1227.62042arXiv1007.1684OpenAlexW3104227803WikidataQ105584277 ScholiaQ105584277MaRDI QIDQ651016

Sourav Chatterjee, Karl Rohe, Bin Yu

Publication date: 8 December 2011

Published in: The Annals of Statistics (Search for Journal in Brave)

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



Related Items

Overlapping community detection in networks via sparse spectral decomposition, Null models and community detection in multi-layer networks, Estimation of the parameters in an expanding dynamic network model, Scalable estimation of epidemic thresholds via node sampling, Community detection for weighted networks with unknown number of communities, Perturbation analysis for the normalized Laplacian matrices in the multiway spectral clustering method, Consistency of modularity clustering on random geometric graphs, Smoothing graphons for modelling exchangeable relational data, Latent structure blockmodels for Bayesian spectral graph clustering, Estimating multivariate latent-structure models, Large-scale estimation of random graph models with local dependence, Two sample tests for high-dimensional autocovariances, A limit theorem for scaled eigenvectors of random dot product graphs, A review on spectral clustering and stochastic block models, Bayesian community detection, Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model, Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator, Impact of regularization on spectral clustering, Community detection by \(L_{0}\)-penalized graph Laplacian, Bayesian degree-corrected stochastic blockmodels for community detection, The expected adjacency and modularity matrices in the degree corrected stochastic block model, Identifiability and parameter estimation of the overlapped stochastic co-block model, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, A spectral algorithm with additive clustering for the recovery of overlapping communities in networks, Universally consistent vertex classification for latent positions graphs, A review of dynamic network models with latent variables, Local law and Tracy-Widom limit for sparse stochastic block models, Spectral and matrix factorization methods for consistent community detection in multi-layer networks, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels, Spectral clustering-based community detection using graph distance and node attributes, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging, Consistency of community detection in networks under degree-corrected stochastic block models, Entrywise eigenvector analysis of random matrices with low expected rank, Vertex nomination, consistent estimation, and adversarial modification, Matrix and discrepancy view of generalized random and quasirandom graphs, Consistency of maximum-likelihood and variational estimators in the stochastic block model, Classification and estimation in the stochastic blockmodel based on the empirical degrees, Sparse integrative clustering of multiple omics data sets, Bayesian estimation of the latent dimension and communities in stochastic blockmodels, Consistency and asymptotic normality of stochastic block models estimators from sampled data, A similarity measure for second order properties of non-stationary functional time series with applications to clustering and testing, Identifiability of nonparametric mixture models and Bayes optimal clustering, Theoretical and computational guarantees of mean field variational inference for community detection, Guaranteed clustering and biclustering via semidefinite programming, Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer, Identifying latent group structures in nonlinear panels, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, The method of moments and degree distributions for network models, A critical threshold for design effects in network sampling, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding, Testing goodness of fit of random graph models, Spectral clustering in the dynamic stochastic block model, Reconstruction and estimation in the planted partition model, Detecting groups in large vector autoregressions, Maximum likelihood estimation of sparse networks with missing observations, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics, On semidefinite relaxations for the block model, Contiguity and non-reconstruction results for planted partition models: the dense case, Model-based clustering of multiple networks with a hierarchical algorithm, Fusing data depth with complex networks: community detection with prior information, Review on statistical methods for gene network reconstruction using expression data, Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model, Pseudo-likelihood methods for community detection in large sparse networks, Estimating the number of communities by spectral methods, A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices, A variational approach to the consistency of spectral clustering, Network modelling of topological domains using Hi-C data, Convex relaxation methods for community detection, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Additive and multiplicative effects network models, Robust high-dimensional factor models with applications to statistical machine learning, Nonreconstruction of high-dimensional stochastic block model with bounded degree, Network representation using graph root distributions, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, On Bayesian new edge prediction and anomaly detection in computer networks, Convex optimization for the densest subgraph and densest submatrix problems, Community detection in sparse networks via Grothendieck's inequality, Community detection in degree-corrected block models, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, Fast community detection by SCORE, Profile likelihood biclustering, On the estimation of latent distances using graph distances, Rate-optimal graphon estimation, Detection of structurally homogeneous subsets in graphs, Convex programming based spectral clustering, Consistent nonparametric estimation for heavy-tailed sparse graphs, Community detection with dependent connectivity, Optimality of spectral clustering in the Gaussian mixture model, Weighted stochastic block model, Learning from missing data with the binary latent block model, Spectral clustering revisited: information hidden in the Fiedler vector, Community detection on mixture multilayer networks via regularized tensor decomposition, A multiscale environment for learning by diffusion, Extended stochastic block models with application to criminal networks, On the question of effective sample size in network modeling: an asymptotic inquiry, Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world?, Empirical Bayes estimation for the stochastic blockmodel, Stock co-jump networks, Learning Coefficient Heterogeneity over Networks: A Distributed Spanning-Tree-Based Fused-Lasso Regression, Euclidean Representation of Low-Rank Matrices and Its Geometric Properties, Learning sparse graphons and the generalized Kesten-Stigum threshold, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks, Link Prediction for Egocentrically Sampled Networks, Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition, Statistical embedding: beyond principal components, Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates, Graphical Assistant Grouped Network Autoregression Model: A Bayesian Nonparametric Recourse, Clustering heterogeneous financial networks, How social networks influence human behavior: an integrated latent space approach for differential social influence, Estimating Mixed Memberships With Sharp Eigenvector Deviations, Hierarchical Community Detection by Recursive Partitioning, Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes, A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors, Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM), Optimal Bipartite Network Clustering, Randomized Spectral Clustering in Large-Scale Stochastic Block Models, Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering, Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks, Unnamed Item, Unnamed Item, Unnamed Item, Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method, Nonparametric statistics of dynamic networks with distinguishable nodes, Convexified modularity maximization for degree-corrected stochastic block models, An alternative class of models to position social network groups in latent spaces, Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models, Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, Community informed experimental design, Subsampling spectral clustering for stochastic block models in large-scale networks, On the efficacy of higher-order spectral clustering under weighted stochastic block models, Perturbation of Linear Forms of Singular Vectors Under Gaussian Noise, Optimal Estimation of the Number of Network Communities, Clustering High-Dimensional Data via Feature Selection, A distributed community detection algorithm for large scale networks under stochastic block models, Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure, Hypothesis testing for populations of networks, Community network auto-regression for high-dimensional time series, Large volatility matrix analysis using global and national factor models, Fast Network Community Detection With Profile-Pseudo Likelihood Methods, Combinatorial statistics and the sciences, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A survey on model-based co-clustering: high dimension and estimation challenges, Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules, Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models, Asymptotic mutual information for the balanced binary stochastic block model, Sparse Graphs Using Exchangeable Random Measures, Co-clustering separately exchangeable network data, Random matrix theory in statistics: a review, Corrected Bayesian Information Criterion for Stochastic Block Models, Uniform Bounds for Invariant Subspace Perturbations, Near-Optimal Bounds for Phase Synchronization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation, Sparse exchangeable graphs and their limits via graphon processes, Statistical inference on random dot product graphs: a survey, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection, Adjacency matrix comparison for stochastic block models, On the Stability of Network Indices Defined by Means of Matrix Functions, Optimization via low-rank approximation for community detection in networks, Bipartite communities via spectral partitioning, Consistent structure estimation of exponential-family random graph models with block structure, Detecting structural changes in longitudinal network data, Confidence sets for network structure, Review of statistical network analysis: models, algorithms, and software, Vertex nomination via seeded graph matching, Vertex nomination: the canonical sampling and the extended spectral nomination schemes, Unnamed Item, Multiresolution Network Models, Node Features Adjusted Stochastic Block Model, Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication, Localization of dominant eigenpairs and planted communities by means of Frobenius inner products, Exact recovery in the Ising blockmodel, Spectral method and regularized MLE are both optimal for top-\(K\) ranking, Probabilistic Community Detection With Unknown Number of Communities, A spectral method for community detection in moderately sparse degree-corrected stochastic block models, Exact Clustering of Weighted Graphs via Semidefinite Programming, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph, The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, The Interplay of Demographic Variables and Social Distancing Scores in Deep Prediction of U.S. COVID-19 Cases, Covariate Regularized Community Detection in Sparse Graphs, A Performance Guarantee for Spectral Clustering, Unnamed Item, Numerical study of reciprocal recommendation with domain matching, Mean-field theory of graph neural networks in graph partitioning, Matrix estimation by universal singular value thresholding, Consistency of spectral clustering in stochastic block models, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The topology of probability distributions on manifolds, Convergence of the groups posterior distribution in latent or stochastic block models, Differential calculus on graphon space, Role of normalization in spectral clustering for stochastic blockmodels, Robust and computationally feasible community detection in the presence of arbitrary outlier nodes, Detecting Overlapping Communities in Networks Using Spectral Methods, Blind Identification of Stochastic Block Models from Dynamical Observations



Cites Work