Graph sampling

L.-C. Zhang () and M. Patone ()
Additional contact information
L.-C. Zhang: University of Southampton
M. Patone: University of Southampton

METRON, 2017, vol. 75, issue 3, No 5, 277-299

Abstract: Abstract We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

Keywords: Network; Finite-graph sampling; Multiplicity sampling; Indirect sampling; Adaptive cluster sampling (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s40300-017-0126-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metron:v:75:y:2017:i:3:d:10.1007_s40300-017-0126-y

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/40300

DOI: 10.1007/s40300-017-0126-y

Access Statistics for this article

METRON is currently edited by Marco Alfo'

More articles in METRON from Springer, Sapienza Università di Roma
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().