Graph sampling
Graph sampling
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.
277–299
Zhang, L.-C.
a5d48518-7f71-4ed9-bdcb-6585c2da3649
Patone, M.
51bbd4cc-1c19-4a64-a0c2-1534b076fa79
December 2017
Zhang, L.-C.
a5d48518-7f71-4ed9-bdcb-6585c2da3649
Patone, M.
51bbd4cc-1c19-4a64-a0c2-1534b076fa79
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.
Text
Graph Sampling revised
- Accepted Manuscript
Text
s40300-017-0126-y
- Version of Record
More information
Accepted/In Press date: 21 September 2017
e-pub ahead of print date: 3 October 2017
Published date: December 2017
Identifiers
Local EPrints ID: 415590
URI: http://eprints.soton.ac.uk/id/eprint/415590
ISSN: 0026-1424
PURE UUID: 129ed2df-d141-42c8-ace7-07a5a3df245d
Catalogue record
Date deposited: 15 Nov 2017 17:30
Last modified: 16 Mar 2024 05:53
Export record
Altmetrics
Contributors
Author:
M. Patone
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
