13 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.SI2011★ 3 cited
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…
stat.ME2011★ 1 cited
Logistic Network Regression for Scalable Analysis of Networks with Joint Edge/Vertex Dynamics
Zack W. Almquist, Carter T. Butts
Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Though early stud…
cs.SI2011★ 13 cited
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…