Sampling from large graphs
Published in
Knowledge Discovery and Data Mining(2006)External Links:
TL
TL;DR
The best performing methods are the ones based on random-walks and "forest fire"; they match very accurately both static as well as evolutionary graph patterns, with sample sizes down to about 15% of the original graph.