Stochastic Block Models with R: Statistically rigorous clustering
summary
Native R package SBMR fits Poisson stochastic block models for (bi)partite graphs using Rcpp, runs agglomerative merging with a delta ratio heuristic to pick k, then performs MCMC sweeps that use a track pairs tally to build a consensus matrix. On a simulated dense network of three clusters with 40 nodes each the pipeline perfectly recovers the true blocks, and visualizations include a consensus embedding called consensus sne to show cluster stability and node‑level uncertainty.
AI-written summary · about
chapters (19)
- 0:00Intro
- 0:30Stochastic Block Models with R: er Statistically rigerous clusting with rigorous code
- 1:03About Me
- 2:27Bi or Poly-partite networks
- 3:03The Stochastic Block Model? A network model to clusterodes into blocks
- 3:40An equation for validity
- 8:34Tests and simulated data catch errors Software Unit Tests
- 10:20Getting speedy with it
- 11:34Documentation as tests
- 12:45Vignette or perish
- 13:45What exactly is sbmR?
- 14:40What is needed to use it?
- 16:55Simulate a network
- 17:56Find optimal MCMC initialization
- 19:41Sanity check... We can join the models state after our collapse with the true generating data's blocks to see how wel
- 20:17Sampling from posterior
- 21:13Investigating Uncertainty in clustering
- 22:08Concensus-SNE
- 22:54Future plans
related talks
45mCorrelated Stochastic Block Models: Graph Matching And Community Recovery
25mLucky Talk: From Coding to Clustering
38mBias-Adjusted Spectral Clustering In Multi-Layer Stochastic Block Models
01h 27mFlexible Statistical Modeling
54mNode Privacy, High-dimensional Graph Summaries, and Block Models
25mFundamental Limit of Community Detection in Stochastic Block Models
41mBayesian Network Modeling using R and Python
01h 06mNonparametric Bayesian Methods: Models, Algorithms, and Applications I
