18 citations · 44 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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.ST2017
Uniform estimation in stochastic block models is slow
Ismaël Castillo, Peter Orbanz
We explicitly quantify the empirically observed phenomenon that estimation under a stochastic block model (SBM) is hard if the model contains classes that are similar. More precise…