## Spiraling Facebook: an alternative Metropolis–Hastings random walk using a spiral proposal distribution

- C. A. Piña-García, Dongbing Gu
- Social Network Analysis and Mining
- 2013

Highly Influenced

@inproceedings{Kurant2011WalkingOA, title={Walking on a graph with a magnifying glass: stratified sampling via weighted random walks}, author={Maciej Kurant and Minas Gjoka and Carter T. Butts and Athina Markopoulou}, booktitle={PERV}, year={2011} }

- Published 2011 in PERV
DOI:10.1145/2007116.2007145

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 defined weighted graph that achieves high efficiency by preferentially crawling those nodes and edges that convey greater information regarding the target metric. Our approach begins by employing the theory of stratification to find optimal node weights, for a given estimation problem, under an independence sampler. While… CONTINUE READING

Highly Cited

This paper has 347 citations. REVIEW CITATIONS

Citations per Year

Semantic Scholar estimates that this publication has **347** citations based on the available data.

See our **FAQ** for additional information.