Fetching the paper…
Reading the bibliography…
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges.
On the Theory of Sampling from Finite Populations
M. Hansen and W. Hurwitz · 1943
Earlier work this paper cites.
Equation of state calculation by fast computing machines
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller · 1953
Earlier work this paper cites.
Estimation of graph totals
O. Frank · 1977
Earlier work this paper cites.
Survey sampling in graphs
O. Frank · 1977
Earlier work this paper cites.
Sampling and estimation in large social networks
O. Frank · 1978
Earlier work this paper cites.
Categorical data analysis of single sociometric relations
S. E. Fienberg and S. Wasserman · 1981
Earlier work this paper cites.
Statistical analysis of multiple sociometric relations
S. E. Fienberg, M. M. Meyer, and S. Wasserman · 1985
Earlier work this paper cites.
Random sampling and social networks: A survey of various approaches
O. Frank · 1988
Earlier work this paper cites.
Homophily and social distance in the choice of multiple friends: An analysis based on conditionally symmetric log-bilinear association model
K. Yamaguchi · 1990
Earlier work this paper cites.
A log-linear modeling framework for selective mixing
M. Morris · 1991
Earlier work this paper cites.
An Introduction to the Bootstrap
B. Efron and R. Tibshirani · 1993
Earlier work this paper cites.
Random walks on graphs: A survey
L. Lovász · 1993
Earlier work this paper cites.
Social Network Analysis: Methods and Applications
S. Wasserman and K. Faust · 1994
Earlier work this paper cites.
Markov Chain Monte Carlo in Practice
W. R. Gilks, S. Richardson, and D. J. Spiegelhalter · 1996
Earlier work this paper cites.
Respondent-Driven Sampling: A New Approach to the Study of Hidden Populations
D. D. Heckathorn · 1997
Earlier work this paper cites.
Estimation and prediction for stochastic block models for graphs with latent block structure
T. A. B. Snijders and K. Nowicki · 1997
Earlier work this paper cites.
On near-uniform URL sampling
M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork · 2000
Earlier work this paper cites.
Statistical evaluation of algebraic constraints for social networks
P. E. Pattison, S. Wasserman, G. L. Robins, and A. M. Kanfer · 2000
Earlier work this paper cites.
Breadth-first search crawling yields high-quality pages
M. Najork and J. L. Wiener · 2001
Earlier work this paper cites.
Estimation and prediction for stochastic blockstructures
K. Nowicki and T. A. B. Snijders · 2001
Earlier work this paper cites.
Respondent-driven sampling ii: Deriving valid population estimates from chain-referral samples of hidden populations
D. D. Heckathorn · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002
Earlier work this paper cites.
Sampling
S. K. Thompson · 2002
Earlier work this paper cites.
Trust management for the semantic web
M. Richardson, R. Agrawal, and P. Domingos · 2003
Cited alongside, same era.
Sampling and estimation in hidden populations using respondent-driven sampling
M. Salganik and D. D. Heckathorn · 2004
Cited alongside, same era.
p 2 p_{2} : A random effects moel with covariates for directed graphs
M. A. J. van Duijn, T. A. B. Snijders, and B. H. Zijlstra · 2004
Cited alongside, same era.
Vizster: Visualizing online social networks
J. Heer and D. Boyd · 2005
Cited alongside, same era.
Graphs over time: densification laws, shrinking diameters and possible explanations
J. Leskovec, J. Kleinberg, and C. Faloutsos · 2005
Cited alongside, same era.
In U. Brandes and T. Erlebach, editors,
M. Nunkesser and D. Sawitzki · 2005
Cited alongside, same era.
Birds of a feather, or friend of a friend?: Using exponential random graph models to investigate adolescent social networks
S. M. Goodreau, J. A. Kitts, and M. Morris · 2009
Later among the works it cites.
Calculating statistics of complex networks through random walks with an application to the on-line social network Bebo
S. J. Hardiman, P. Richmond, and S. Hutzler · 2009
Later among the works it cites.
Statistical Analysis of Network Data
E. D. Kolaczyk · 2009
Later among the works it cites.
Respondent-driven sampling for characterizing unstructured overlays
A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach · 2009
Later among the works it cites.
On the evolution of user interaction in facebook
B. Viswanath, A. Mislove, M. Cha, and K. Gummadi · 2009
Later among the works it cites.
OSN Research: Time to Face the Real Challenges
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Elements of Distribution Theory
T. A. Severini · 2005
Cited alongside, same era.
Subnets of scale-free networks are not scale-free: sampling properties of networks
M. Stumpf, C. Wiuf, and R. May · 2005
Cited alongside, same era.
A comparison of sampling techniques for web graph characterization
L. Becchetti, C. Castillo, D. Donato, and A. Fazzone · 2006
Cited alongside, same era.
Inference in curved exponential family models for networks
D. R. Hunter and M. S. Handcock · 2006
Cited alongside, same era.
Statistical properties of Sampled Networks
S. H. Lee, P.-J. Kim, and H. Jeong · 2006
Cited alongside, same era.
Sampling from large graphs
J. Leskovec and C. Faloutsos · 2006
Cited alongside, same era.
W. Willinger, R. Rejaie, M. Torkjazi, M. Valafar, and M. Maggioni · 2009
Later among the works it cites.
Reconsidering the Foundations of Network Sampling
N. Ahmed, J. Neville, and R. Kompella · 2010
Later among the works it cites.
Improving Random Walk Estimation Accuracy with Uniform Restarts
K. Avrachenkov, B. Ribeiro, and D. Towsley · 2010
Later among the works it cites.
Respondent-driven sampling: An assessment of current methodology
K. J. Gile and M. S. Handcock · 2010
Later among the works it cites.
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou · 2010
Later among the works it cites.
Modeling networks with sampled data
M. S. Handcock and K. J. Gile · 2010
Later among the works it cites.
Estimating and sampling graphs with multidimensional random walks
B. Ribeiro and D. Towsley · 2010
Later among the works it cites.
On Estimating Degree Distributions of Directed Graphs through Sampling
B. Ribeiro, P. Wang, and D. Towsley · 2010
Later among the works it cites.
S. Ye, J. Lang, and F. Wu · 2010
Later among the works it cites.
DomainImpute: Inferring Unseen Components in the Internet
B. Eriksson, P. Barford, J. Sommers, and R. Nowak · 2011
Closest in time.
Multigraph Sampling of Online Social Networks
M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou · 2011
Closest in time.
Practical Recommendations on Sampling OSN Users by Crawling the Social Graph
M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou · 2011
Closest in time.
Estimating Sizes of Social Networks via Biased Sampling
L. Katzir, E. Liberty, and O. Somekh · 2011
Closest in time.
Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks
M. Kurant, M. Gjoka, C. T. Butts, and A. Markopoulou · 2011
Closest in time.
Towards Unbiased BFS Sampling
M. Kurant, A. Markopoulou, and P. Thiran · 2011
Closest in time.
Social Structure of Facebook Networks
A. Traud, P. Mucha, and M. Porter · 2011
Closest in time.
Compressive Sensing over Graphs
W. Xu, E. Mallada, and A. Tang · 2011
Closest in time.