14 citations · 21 across the 2 of their papers we have counts for
2 papers
math.ST2017★ 14 cited
Subsampling large graphs and invariance in networks
Peter Orbanz
Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive law…
math.ST2011★ 7 cited
Conjugate Projective Limits
Peter Orbanz
We characterize conjugate nonparametric Bayesian models as projective limits of conjugate, finite-dimensional Bayesian models. In particular, we identify a large class of nonparame…