Graph spatial sampling

03/22/2022
by   Li-Chun Zhang, et al.
0

We develop lagged Metropolis-Hastings walk for sampling from simple undirected graphs according to given stationary sampling probabilities. We explain how to apply the technique together with designed graphs for sampling of units-in-space. We illustrate that the proposed graph spatial sampling approach can be more flexible for improving the design efficiency compared to the existing spatial sampling methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2020

BIG sampling

Graph sampling is a statistical approach to study real graphs, which rep...
research
03/09/2020

Sampling on Graphs: From Theory to Applications

The study of sampling signals on graphs, with the goal of building an an...
research
04/08/2020

Incidence weighting estimation under bipartite incidence graph sampling

Bipartite incidence graph sampling provides a unified representation of ...
research
09/26/2018

Sampling Theory for Graph Signals on Product Graphs

In this paper, we extend the sampling theory on graphs by constructing a...
research
02/10/2020

UGRWO-Sampling: A modified random walk under-sampling approach based on graphs to imbalanced data classification

In this paper, we propose a new RWO-Sampling (Random Walk Over-Sampling)...
research
07/14/2016

Generalized Sampling in Julia

Generalized sampling is a numerically stable framework for obtaining rec...
research
12/31/2021

Fast Graph Subset Selection Based on G-optimal Design

Graph sampling theory extends the traditional sampling theory to graphs ...

Please sign up or login with your details

Forgot password? Click here to reset