8 citations · 9 across the 2 of their papers we have counts for
2 papers
stat.ML2016★ 1 cited
Edge-exchangeable graphs and sparsity (NIPS 2016)
Diana Cai, Trevor Campbell, Tamara Broderick
Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Ald…
math.ST2014★ 8 cited
An iterative step-function estimator for graphons
Diana Cai, Nathanael Ackerman, Cameron Freer
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single gra…