Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
From MaRDI portal
Publication:3391269
DOI10.1080/10618600.2018.1554486OpenAlexW2963049114WikidataQ90599253 ScholiaQ90599253MaRDI QIDQ3391269
No author found.
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://europepmc.org/articles/pmc6781626
social networksubsamplingMonte Carlo EMcase-control approximationparallel computation with communication
Related Items (3)
Bayesian testing for exogenous partition structures in stochastic block models ⋮ Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates ⋮ Joint Latent Space Model for Social Networks with Multivariate Attributes
Uses Software
Cites Work
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Local case-control sampling: efficient subsampling in imbalanced data sets
- Distributed stochastic subgradient projection algorithms for convex optimization
- Spectral clustering and the high-dimensional stochastic blockmodel
- Uncovering latent structure in valued graphs: a variational approach
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Variational Bayesian inference for the latent position cluster model for network data
- Stochastic blockmodels with a growing number of classes
- Mixed membership stochastic blockmodels
- Statistics in Epidemiology: The Case-Control Study
- Goodness of Fit of Logistic Regression Models for Random Graphs
- A Survey of Statistical Network Models
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Estimation and Prediction for Stochastic Blockstructures
- Latent Space Approaches to Social Network Analysis
- Community structure in social and biological networks
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Optimal Distributed Online Prediction using Mini-Batches
- Bilinear Mixed-Effects Models for Dyadic Data
- Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
This page was built for publication: Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication