Cost-based analyses of random neighbor and derived sampling methods
Abstract Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree greater than that of the graph. Instead of naïvely sampling a vertex from a graph and retaining it (‘random vertex’ or RV), a neighbor of the vertex is selected instead. While considerable research has ana...
Main Authors: | Yitzchak Novick, Amotz Bar-Noy |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2022-06-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | https://doi.org/10.1007/s41109-022-00475-x |
Similar Items
-
Inclusive random sampling in graphs and networks
by: Yitzchak Novick, et al.
Published: (2023-09-01) -
A comparison between fixed and random sampling of a low density spotted bass population in a large river
by: Evan C. Boone, et al.
Published: (2019-01-01) -
Representative Samples, Random Sampling
by: Alberto Marradi
Published: (2022-10-01) -
Optimization of Random Sample Size in Progressively Type II Censoring based on Cost Criterion
by: Elham Basiri
Published: (2022-06-01) -
Improving the Accuracy of Nearest-Neighbor Classification Using Principled Construction and Stochastic Sampling of Training-Set Centroids
by: Stephen Whitelam
Published: (2021-01-01)