Bipartite incidence graph sampling
Bipartite incidence graph sampling
Graph sampling provides a statistical approach to study real graphs, which can be of interest in numerous investigations. There have been significant contributions to the existing graph sampling theory. However, a general approach to graph sampling which also unifies the existing unconventional sampling methods, which may be envisaged as graph sampling problems, including indirect, network and adaptive cluster sampling, as well as arbitrary T-stage snowball sampling, is non-existent in the literature. We propose a bipartite incident graph sampling (BIGS) as a feasible representation of graph sampling from arbitrary finite graphs and a unified approach to a large number of graph sampling situations. We establish the sufficient and necessary conditions under which the BIGS is feasible for various graph sampling methods. Under a feasible BIGS, two types of design-unbiased estimators, the Horvitz-Thompson estimator and the Hansen-Hurwitz type of estimators, can be applied. A general result on the relative efficiency of the two types of estimators is obtained. Some numerical results based on a limited simulation study illustrating the feasibility of the proposed approach are presented.
Zhang, Li-Chun
a5d48518-7f71-4ed9-bdcb-6585c2da3649
Oguz Alper, Melike
02d5ed8a-e9e3-438a-95c0-709acd83a5f8
2 October 2020
Zhang, Li-Chun
a5d48518-7f71-4ed9-bdcb-6585c2da3649
Oguz Alper, Melike
02d5ed8a-e9e3-438a-95c0-709acd83a5f8
Zhang, Li-Chun and Oguz Alper, Melike
(2020)
Bipartite incidence graph sampling.
In Proceedings of the Joint Statistical Meetings 2020 Survey Research Methods Section Virtual Conference.
10 pp
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Graph sampling provides a statistical approach to study real graphs, which can be of interest in numerous investigations. There have been significant contributions to the existing graph sampling theory. However, a general approach to graph sampling which also unifies the existing unconventional sampling methods, which may be envisaged as graph sampling problems, including indirect, network and adaptive cluster sampling, as well as arbitrary T-stage snowball sampling, is non-existent in the literature. We propose a bipartite incident graph sampling (BIGS) as a feasible representation of graph sampling from arbitrary finite graphs and a unified approach to a large number of graph sampling situations. We establish the sufficient and necessary conditions under which the BIGS is feasible for various graph sampling methods. Under a feasible BIGS, two types of design-unbiased estimators, the Horvitz-Thompson estimator and the Hansen-Hurwitz type of estimators, can be applied. A general result on the relative efficiency of the two types of estimators is obtained. Some numerical results based on a limited simulation study illustrating the feasibility of the proposed approach are presented.
This record has no associated files available for download.
More information
Accepted/In Press date: 2 October 2020
Published date: 2 October 2020
Venue - Dates:
Joint Statistical Meetings 2020 Survey Research Methods Section<br/>Virtual Conference, 2020-08-02 - 2020-08-06
Identifiers
Local EPrints ID: 473201
URI: http://eprints.soton.ac.uk/id/eprint/473201
PURE UUID: 4cc9d825-d7e3-4d1f-8625-1c455bd72169
Catalogue record
Date deposited: 12 Jan 2023 17:39
Last modified: 17 Mar 2024 04:17
Export record
Contributors
Author:
Melike Oguz Alper
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