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
(99)- Fast community detection by SCORE
- Network-based naive Bayes model for social network
- Community detection by \(L_{0}\)-penalized graph Laplacian
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- 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
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Model selection in overlapping stochastic block models
- Stochastic block models are a discrete surface tension
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Community detection with dependent connectivity
- Weighted stochastic block model
- Estimation of dense stochastic block models visited by random walks
- Extended stochastic block models with application to criminal networks
- Limit theorems for distributions invariant under groups of transformations
- Bayesian testing for exogenous partition structures in stochastic block models
- Smoothing graphons for modelling exchangeable relational data
- Edgeworth expansions for network moments
- 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
- Consistency and asymptotic normality of stochastic block models estimators from sampled data
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Nonreconstruction of high-dimensional stochastic block model with bounded degree
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- Profile likelihood biclustering
- Consistent structure estimation of exponential-family random graph models with block structure
- Optimal graphon estimation in cut distance
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Convergence of the groups posterior distribution in latent or stochastic block models
- Co-clustering separately exchangeable network data
- On the question of effective sample size in network modeling: an asymptotic inquiry
- Empirical Bayes estimation for the stochastic blockmodel
- An alternative class of models to position social network groups in latent spaces
- A limit theorem for scaled eigenvectors of random dot product graphs
- scientific article; zbMATH DE number 6389775 (Why is no real title available?)
- Mixed membership stochastic blockmodels
- Bayesian degree-corrected stochastic blockmodels for community detection
- The highest dimensional stochastic blockmodel with a regularized estimator
- Comparative study for inference of hidden classes in stochastic block models
- 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
- Modeling individual email patterns over time with latent variable models
- scientific article; zbMATH DE number 4066166 (Why is no real title available?)
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Community detection and stochastic block models: recent developments
- Sparse exchangeable graphs and their limits via graphon processes
- Asymptotic mutual information for the balanced binary stochastic block model
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Confidence sets for network structure
- Review of statistical network analysis: models, algorithms, and software
- Determining the number of communities in degree-corrected stochastic block models
- Why Are Big Data Matrices Approximately Low Rank?
- Detecting overlapping communities in networks using spectral methods
- Maximum a posteriori inference of random dot product graphs via conic programming
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- On model selection for dense stochastic block models
- Nonparametric modeling of higher-order interactions via hypergraphons
- A goodness-of-fit test for stochastic block models
- Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models
- Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure
- Mixture models and networks: The stochastic blockmodel
- Optimal distribution-free concentration for the log-likelihood function of Bernoulli variables
- A Joint MLE Approach to Large-Scale Structured Latent Attribute Analysis
- Asymptotic uncertainty quantification for communities in sparse planted bi-section models
- Learning sparse graphons and the generalized Kesten-Stigum threshold
- Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
- Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates
- Spectral clustering and the high-dimensional stochastic blockmodel
- A fast algorithm for integrative community detection of multi-layer networks
- Community detection with nodal information: likelihood and its variational approximation
- Network Inference Using the Hub Model and Variants
- A survey on theoretical advances of community detection in networks
- A note on a Bernstein-type inequality for the log-likelihood function of categorical variables with infinitely many levels
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- Tractably modelling dependence in networks beyond exchangeability
- Confidence sets in a sparse stochastic block model with two communities of unknown sizes
- High-dimensional factor analysis for network-linked data
- Perfect spectral clustering with discrete covariates
- Orthogonal symmetric non-negative matrix factorization under the stochastic block model
- Semiparametric modeling and analysis for longitudinal network data
- Stochastic Block Smooth Graphon Model
- The analysis of social network data: an exciting frontier for statisticians
- A network model that combines latent factors and sparse graphs
- Detecting small clusters in the stochastic block model
- Two-sample test for stochastic block models via the largest singular value
- Simultaneous Estimation of Connectivity and Dimensionality in Samples of Networks
- Restricted Tweedie stochastic block models
- A goodness-of-fit test for sparse networks
- Detection of structurally homogeneous subsets in graphs
- Social network mediation analysis: a latent space approach
- Large-scale estimation of random graph models with local dependence
- Pseudo-likelihood methods for community detection in large sparse networks
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)
