Stochastic blockmodels with a growing number of classes
From MaRDI portal
Abstract: We present asymptotic and finite-sample results on the use of stochastic blockmodels for the analysis of network data. We show that the fraction of misclassified network nodes converges in probability to zero under maximum likelihood fitting when the number of classes is allowed to grow as the root of the network size and the average network degree grows at least poly-logarithmically in this size. We also establish finite-sample confidence bounds on maximum-likelihood blockmodel parameter estimates from data comprising independent Bernoulli random variates; these results hold uniformly over class assignment. We provide simulations verifying the conditions sufficient for our results, and conclude by fitting a logit parameterization of a stochastic blockmodel with covariates to a network data example comprising a collection of Facebook profiles, resulting in block estimates that reveal residual structure.
Recommendations
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Spectral clustering and the high-dimensional stochastic blockmodel
- Stochastic Blockmodels for Directed Graphs
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Bayesian community detection
Cited in
(97)- On the question of effective sample size in network modeling: an asymptotic inquiry
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Asymptotic mutual information for the balanced binary stochastic block model
- A limit theorem for scaled eigenvectors of random dot product graphs
- Large-scale estimation of random graph models with local dependence
- Maximum a posteriori inference of random dot product graphs via conic programming
- Consistency of community detection in networks under degree-corrected stochastic block models
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Community detection and stochastic block models: recent developments
- Stochastic Block Smooth Graphon Model
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Model selection in overlapping stochastic block models
- Network Inference Using the Hub Model and Variants
- Co-clustering separately exchangeable network data
- A survey on theoretical advances of community detection in networks
- The analysis of social network data: an exciting frontier for statisticians
- Multiresolution Network Models
- A network model that combines latent factors and sparse graphs
- Convergence of the groups posterior distribution in latent or stochastic block models
- Fusing data depth with complex networks: community detection with prior information
- A note on new Bernstein-type inequalities for the log-likelihood function of Bernoulli variables
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Consistency of spectral clustering in stochastic block models
- Matrix estimation by universal singular value thresholding
- Detecting overlapping communities in networks using spectral methods
- Smoothing graphons for modelling exchangeable relational data
- Edgeworth expansions for network moments
- scientific article; zbMATH DE number 7415089 (Why is no real title available?)
- Comparative study for inference of hidden classes in stochastic block models
- Mixture models and networks: The stochastic blockmodel
- Network-based naive Bayes model for social network
- Community detection by \(L_{0}\)-penalized graph Laplacian
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting
- Stochastic block models are a discrete surface tension
- scientific article; zbMATH DE number 6389775 (Why is no real title available?)
- Learning sparse graphons and the generalized Kesten-Stigum threshold
- Mixed membership stochastic blockmodels
- Asymptotic uncertainty quantification for communities in sparse planted bi-section models
- Nonreconstruction of high-dimensional stochastic block model with bounded degree
- Detecting small clusters in the stochastic block model
- Consistent structure estimation of exponential-family random graph models with block structure
- Profile likelihood biclustering
- Two-sample test for stochastic block models via the largest singular value
- Bayesian degree-corrected stochastic blockmodels for community detection
- Confidence sets in a sparse stochastic block model with two communities of unknown sizes
- scientific article; zbMATH DE number 4066166 (Why is no real title available?)
- Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
- Detection of structurally homogeneous subsets in graphs
- A note on a Bernstein-type inequality for the log-likelihood function of categorical variables with infinitely many levels
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
- The highest dimensional stochastic blockmodel with a regularized estimator
- Optimal graphon estimation in cut distance
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- Tractably modelling dependence in networks beyond exchangeability
- Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure
- Community detection with dependent connectivity
- Pseudo-likelihood methods for community detection in large sparse networks
- Optimal distribution-free concentration for the log-likelihood function of Bernoulli variables
- An alternative class of models to position social network groups in latent spaces
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- On model selection for dense stochastic block models
- Empirical Bayes estimation for the stochastic blockmodel
- scientific article; zbMATH DE number 7370586 (Why is no real title available?)
- Weighted stochastic block model
- Spectral clustering and the high-dimensional stochastic blockmodel
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Node Features Adjusted Stochastic Block Model
- High-dimensional factor analysis for network-linked data
- Review of statistical network analysis: models, algorithms, and software
- Simultaneous Estimation of Connectivity and Dimensionality in Samples of Networks
- Estimation of dense stochastic block models visited by random walks
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Confidence sets for network structure
- Perfect spectral clustering with discrete covariates
- Orthogonal symmetric non-negative matrix factorization under the stochastic block model
- Consistency and asymptotic normality of stochastic block models estimators from sampled data
- Fast community detection by SCORE
- Extended stochastic block models with application to criminal networks
- Bayesian testing for exogenous partition structures in stochastic block models
- Modeling individual email patterns over time with latent variable models
- A goodness-of-fit test for stochastic block models
- Why Are Big Data Matrices Approximately Low Rank?
- Semiparametric modeling and analysis for longitudinal network data
- Sparse exchangeable graphs and their limits via graphon processes
- A fast algorithm for integrative community detection of multi-layer networks
- A Joint MLE Approach to Large-Scale Structured Latent Attribute Analysis
- Limit theorems for distributions invariant under groups of transformations
- Community detection with nodal information: likelihood and its variational approximation
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models
- Social network mediation analysis: a latent space approach
This page was built for publication: Stochastic blockmodels with a growing number of classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892086)
