33 citations · 74 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
Exchangeable Trait Allocations
Trevor Campbell, Diana Cai, Tamara Broderick
Trait allocations are a class of combinatorial structures in which data may belong to multiple groups and may have different levels of belonging in each group. Often the data are a…
Completely random measures for modeling power laws in sparse graphs
Diana Cai, Tamara Broderick
Network data appear in a number of applications, such as online social networks and biological networks, and there is growing interest in both developing models for networks as wel…
Edge-exchangeable graphs and sparsity
Tamara Broderick, Diana Cai
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows qua…