A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

From MaRDI portal
Publication:4648556

DOI10.1080/01621459.2012.699795zbMath1443.62188arXiv1108.2228OpenAlexW1987349051MaRDI QIDQ4648556

Minh Tang, Daniel L. Sussman, Donniell E. Fishkind, Carey E. Priebe

Publication date: 9 November 2012

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

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




Related Items (43)

Latent structure blockmodels for Bayesian spectral graph clusteringLarge-scale estimation of random graph models with local dependenceA limit theorem for scaled eigenvectors of random dot product graphsAsymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimatorImpact of regularization on spectral clusteringTesting for Equivalence of Network Distribution Using Subgraph CountsSimultaneous Dimensionality and Complexity Model Selection for Spectral Graph ClusteringSpectral graph clustering via the expectation-solution algorithmUnnamed ItemUniversally consistent vertex classification for latent positions graphsRobust Recommendation via Social Network Enhanced Matrix CompletionLead-lag detection and network clustering for multivariate time series with an application to the us equity marketEfficient Estimation for Random Dot Product Graphs via a One-Step ProcedureUnnamed ItemEntrywise eigenvector analysis of random matrices with low expected rankEuclidean Representation of Low-Rank Matrices and Its Geometric PropertiesEntrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signalsVertex nomination schemes for membership predictionPerfect clustering for stochastic blockmodel graphs via adjacency spectral embeddingUnnamed ItemUnnamed ItemStatistical inference on random dot product graphs: a surveyA Sparse Completely Positive Relaxation of the Modularity Maximization for Community DetectionOn estimation and inference in latent structure random graphsNetwork representation using graph root distributionsSubspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guaranteesOn Bayesian new edge prediction and anomaly detection in computer networksLimit theorems for eigenvectors of the normalized Laplacian for random graphsOn the estimation of latent distances using graph distancesNetwork Cross-Validation for Determining the Number of Communities in Network DataVertex nomination via seeded graph matchingVertex nomination: the canonical sampling and the extended spectral nomination schemesUnnamed ItemExtended stochastic block models with application to criminal networksThe two-to-infinity norm and singular subspace geometry with applications to high-dimensional statisticsUnnamed ItemConsistency of spectral clustering in stochastic block modelsUnnamed ItemUnnamed ItemEvidential prototype-based clustering based on transfer learningRole of normalization in spectral clustering for stochastic blockmodelsRobust and computationally feasible community detection in the presence of arbitrary outlier nodesEmpirical Bayes estimation for the stochastic blockmodel



Cites Work


This page was built for publication: A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs