13 citations · 17 across the 3 of their papers we have counts for
3 papers · 1 filter
Graph Size Estimation
Maciej Kurant, Carter T. Butts, Athina Markopoulou
Many online networks are not fully known and are often studied via sampling. Random Walk (RW) based techniques are the current state-of-the-art for estimating nodal attributes and…
Coarse-Grained Topology Estimation via Graph Sampling
Maciej Kurant, Minas Gjoka, Yan Wang +3
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this ar…
Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks
M. Kurant, M. Gjoka, C. T. Butts +1
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately define…