Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7370586 (Why is no real title available?)
- scientific article; zbMATH DE number 7626732 (Why is no real title available?)
- A goodness-of-fit test for stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Accurate Approximations for Posterior Moments and Marginal Densities
- Approximately counting triangles in sublinear time
- Approximating average parameters of graphs
- Bootstrapping exchangeable random graphs
- Community detection in degree-corrected block models
- Community structure in social and biological networks
- Conditional estimation of exponential random graph models from snowball sampling designs
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Corrected Bayesian information criterion for stochastic block models
- Counting stars and other small subgraphs in sublinear-time
- Edgeworth expansions for network moments
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Estimation of the Number of Communities in the Stochastic Block Model
- Extended Bayesian information criteria for model selection with large model spaces
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hypothesis testing for automated community detection in networks
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Likelihood-based model selection for stochastic block models
- Motif estimation via subgraph sampling: the fourth-moment phenomenon
- Network cross-validation by edge sampling
- Network cross-validation for determining the number of communities in network data
- Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
- Non-representative sampled networks: estimation of network structural properties by weighting
- On semidefinite relaxations for the block model
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
- Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data
- Optimal Estimation of the Number of Network Communities
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for quantile regression in big data
- Probability Inequalities for Sums of Bounded Random Variables
- Pseudo-likelihood methods for community detection in large sparse networks
- Random sampling with a reservoir
- Revealing network communities with a nonlinear programming method
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Spectral clustering and the high-dimensional stochastic blockmodel
- Speeding Up MCMC by Efficient Data Subsampling
- Subsampling
- Subsampling based community detection for large networks
- Subsampling bootstrap of count features of networks
- Subsampling sparse graphons under minimal assumptions
- Subsampling spectral clustering for stochastic block models in large-scale networks
- Two provably consistent divide-and-conquer clustering algorithms for large networks
- Using the bootstrap for statistical inference on random graphs
This page was built for publication: Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034328)
