Frequently it is the case that relational information is observed on only a portion of a complex system being studied, and the network resulting from such measurements may be thought of as a sample from a larger underlying network. If the goal is to use the sampled network data to infer properties of the underling network, this task may be approached using principles of statistical sampling theory. However, sampling in a network context introduces various potential complications. In this chapter we formalize the problem of sampling and estimation in network graphs, describe a handful of common network sampling designs, and develop estimators of a number of quantities of interest.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Kolaczyk, E.D. (2009). Sampling and Estimation in Network Graphs. In: Statistical Analysis of Network Data. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-88146-1_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-88146-1_5
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-88145-4
Online ISBN: 978-0-387-88146-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)