Hierarchical Clustering: Finding the awkward reunions
summary
Claims a hierarchical random graphs generative model infers multilevel community structure and reproduces right-skewed degree distributions, high clustering and short paths, then uses Metropolis Hastings MCMC to sample dendrograms and average posterior link probabilities. Implementation is partial in Python as pyrg pi hrg, applied to protein–protein interaction networks, yields higher AU statistics and R² versus similarity baselines and ranks a specific missing edge (A–D) as top candidate with ~0.385 average probability.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 1:44Speaker background
- 3:10Predict missing links
- 6:24Limitations of methods
- 7:47Complex systems
- 9:53Hierarchy emergence
- 10:58Extracting hierarchies
- 12:44Internal node probabilities
- 14:31Sampling challenges
- 15:55MCMC sampling
- 16:57Link prediction ranking
- 18:02Method advantages
- 19:07Protein interaction app
- 20:31Python package
related talks
43mUsing network community clustering algorithms [...]
35mClustering: A Guide for the Perplexed
41mGeneral Network Models with Transitive Structures
58mIntroduction to Biological Network Analysis I: Network Basics and Properties
25mConstrained Rank Aggregation and Correlation Clustering
47mLearning Probabilistic Models for Graph Partitioning in the Presence of Noise
52mNew Algorithms For The Graph Alignment Problem
43mInformation-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
