Weighting estimation under bipartite incidence graph sampling

DOI10.1007/S10260-022-00659-WMaRDI QIDQ6164161zbMATH OpenOpenAlexWikidataFDO

Authors Li-Chun Zhang

Publication date 27 July 2023

Published in Statistical Methods and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2004.04257

zbMATH Keywords

ancestral observation proceduregraph samplingmultiplicity estimatorpriority ruleRao-Blackwell method

Mathematics Subject Classification ID

Statistics (62-XX)

Abstract: Bipartite incidence graph sampling provides a unified representation of many sampling situations for the purpose of estimation, including the existing unconventional sampling methods, such as indirect, network or adaptive cluster sampling, which are not originally described as graph problems. We develop a large class of linear estimators based on the edges in the sample bipartite incidence graph, subjected to a general condition of design unbiasedness. The class contains as special cases the classic Horvitz-Thompson estimator, as well as the other unbiased estimators in the literature of unconventional sampling, which can be traced back to Birnbaum and Sirken (1965). Our generalisation allows one to devise other unbiased estimators, thereby providing a potential of efficiency gains in applications. Illustrations are given for adaptive cluster sampling, line-intercept sampling and simulated graphs.

Recommendations

• A practical two-sample test for weighted random graphs
• A sampling theory for infinite weighted graphs
• Sampling and estimation for (sparse) exchangeable graphs
• Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
• Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm
• Approximating the statistics of various properties in randomly weighted graphs
• Weighted Sampling, Maximum Likelihood and Minimum Divergence Estimators
• Half sampling on bipartite graphs
• Moment-based parameter estimation in binomial random intersection graph models
• Sampling strategies for conditional inference on multigraphs

Cites work

• A Generalization of Sampling Without Replacement From a Finite Universe
• Adaptive cluster sampling
• Admissibility and Bayes Estimation in Sampling Finite Populations. I
• Conditional Expectation and Unbiased Sequential Estimation
• Estimation of the number of vertices of different degrees in a graph
• Graph sampling
• scientific article; zbMATH DE number 3106666 (Why is no real title available?)
• Indirect sampling.
• Multiplicity Estimation of Proportions Based on Ratios of Random Variables
• On the Two Different Aspects of the Representative Method: The Method of Stratified Sampling and the Method of Purposive Selection
• Sampling
• Sampling and Inference in a Population Graph
• Unbiased Estimation in Line-Intercept Sampling

This page was built for publication: Weighting estimation under bipartite incidence graph sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164161)