Completed
Cor (CCB). A graph sequence is edge- exchangeable iff it has a graph paintbox
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Nonparametric Bayesian Methods - Models, Algorithms, and Applications IV
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Probabilistic models for graphs
- 3 Sequence of graphs
- 4 The Old Way: Nodes
- 5 The Old Way: Exchangeability
- 6 The Old Way: Node exchangeability
- 7 Aldous-Hoover
- 8 A New Way: Edges
- 9 Edge exchangeability
- 10 Exchangeable probability functions
- 11 Feature allocation is exchangeable if it has a feature paintbox representation
- 12 Edge-exchangeable graph
- 13 Cor (CCB). A graph sequence is edge- exchangeable iff it has a graph paintbox
- 14 How to prove sparsity?
- 15 What we know so far
- 16 Nonparametric Bayes
