Graph spatial sampling

Published 22 Mar 2022 in stat.ME | (2203.11734v2)

Abstract: 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.

Abstract PDF Upgrade to Chat

Authors (1)

Li-Chun Zhang

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.