Fetching the paper…
Reading the bibliography…
Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks.
L. Goodman, “Snowball sampling,” Annals of Mathematical Statistics , vol. 32, p. 148170, 1961
1961
Earlier work this paper cites.
R. Motwani and P. Raghavan, Randomized Algorithms . Cambridge University Press, 1990
1990
Earlier work this paper cites.
L. Lovasz, “Random walks on graphs. a survey,” in Combinatorics , 1993
1993
Earlier work this paper cites.
M. Molloy and B. Reed, “A critical point for random graphs with a given degree sequence,” pp. 161–179, 1995
1995
Earlier work this paper cites.
W. Gilks, S. Richardson, and D. Spiegelhalter, Markov Chain Monte Carlo in Practice . Chapman and Hall/CRC, 1996
1996
Earlier work this paper cites.
D. Heckathorn, “Respondent-driven sampling: A new approach to the study of hidden populations,” Social Problems , vol. 44, p. 174199, 1997
1997
Earlier work this paper cites.
M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “On near-uniform url sampling,” in Proc. of WWW , 2000
2000
Earlier work this paper cites.
M. Najork and J. L. Wiener, “Breadth-first search crawling yields high-quality pages,” in Proc. of WWW , 2001
2001
Earlier work this paper cites.
S. Maslov and K. Sneppen, “Specificity and stability in topology of protein networks,” Science , vol. 296, no. 5569, pp. 910–913, May 2002
2002
Earlier work this paper cites.
M. Newman, “Assortative mixing in networks,” in Phys. Rev. Lett. 89 , 2002
2002
Earlier work this paper cites.
M. E. J. Newman, “The structure and function of complex networks,” SIAM REVIEW , vol. 45, pp. 167–256, 2003
2003
Cited alongside, same era.
——, “Ego-centered networks and the ripple effect,” Social Networks , vol. 25, pp. 83–95, 2003
2003
Cited alongside, same era.
C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks in peer-to-peer networks,” in Proc. of Infocom , 2004
2004
Cited alongside, same era.
J. H. Kim, “Poisson cloning model for random graphs,” International Congress of Mathematicians (ICM) , 2006 (preprint in 2004)
2004
Cited alongside, same era.
M. Salganik and D. Heckathorn, “Sampling and estimation in hidden populations using respondent-driven sampling,” Sociological Methodology , vol. 34, p. 193239, 2004
2004
Cited alongside, same era.
L.Becchetti, C.Castillo, D.Donato, and A.Fazzone, “A comparison of sampling techniques for web graph characterization,” in LinkKDD , 2006
2006
Later among the works it cites.
Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, “Analysis of Topological Characteristics of Huge Online Social Networking Services,” in Proc. of WWW , 2007
2007
Later among the works it cites.
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and S. Bhattacharjee, “Measurement and Analysis of Online Social Networks,” in Proc. of IMC , 2007
2007
Later among the works it cites.
B. Krishnamurthy, P. Gill, and M. Arlitt, “A few chirps about twitter,” in Proc. of WOSN , 2008
2008
Later among the works it cites.
A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, “Growth of the flickr social network,” in Proc. of WOSN , 2008
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, “On the bias of traceroute sampling: or, power-law degree distributions in regular graphs,” in STOC , 2005
2005
Cited alongside, same era.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graphs over time: densification laws, shrinking diameters and possible explanations,” in KDD , 2005
2005
Cited alongside, same era.
D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, “On unbiased sampling for unstructured peer-to-peer networks,” in Proc. of IMC , 2006
2006
Cited alongside, same era.
J. Leskovec and C. Faloutsos, “Sampling from large graphs,” in Proc. of ACM SIGKDD , 2006
2006
Cited alongside, same era.
S. H. Lee, P.-J. Kim, and H. Jeong, “Statistical properties of sampled networks,” Phys. Rev. E , vol. 73, p. 016102, 2006
2006
Cited alongside, same era.
M. Q. Shahbaz, “Sampling with unequal probabilities and without replacement,” Ph.D. dissertation
Cited in the paper.
A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach, “Respondent-driven sampling for characterizing unstructured overlays,” in INFOCOM Mini-Conference , April 2009
2009
Later among the works it cites.
2009
Later among the works it cites.
C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao, “User interactions in social networks and their implications,” in Proc. of EuroSys , 2009
2009
Later among the works it cites.
J. Illenberger, G. Flötteröd, , and K. Nage, “An approach to correct bias induced by snowball sampling,” Sunbelt Social Networks Conference , 2009
2009
Later among the works it cites.
M. E. J., “Random graphs with clustering,” Phys. Rev. Lett. (in press) , 2009
2009
Later among the works it cites.