# Graph sampling by lagged random walk

@article{Zhang2021GraphSB, title={Graph sampling by lagged random walk}, author={Li-Chun Zhang}, journal={Stat}, year={2021} }

We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states—hence, lagged. The existing random walk sampling methods can be incorporated as special cases. We develop a novel approach to estimation based on lagged random walks at equilibrium, where the target parameter can be any function of values associated with finite-order subgraphs, such as edge, triangle, 4-cycle and…

## References

SHOWING 1-10 OF 10 REFERENCES

Graph sampling

- 2017

We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general…

Improving Random Walk Estimation Accuracy with Uniform Restarts

- Computer ScienceWAW
- 2010

This work proposes and studies the properties of a hybrid sampling scheme that mixes independent uniform node sampling and random walk (RW)-based crawling. We show that our sampling method combines…

Random walks and diffusion on networks

- Computer Science, PhysicsArXiv
- 2016

The theory and applications of random walks on networks are surveyed, restricting ourselves to simple cases of single and non-adaptive random walkers, and three main types are distinguished: discrete-time random walks, node-centric continuous-timerandom walks, and edge-centric Continuous-Time random walks.

Fastest Mixing Markov Chain on a Graph

- Mathematics, Computer ScienceSIAM Rev.
- 2004

The Lagrange dual of the fastest mixing Markov chain problem is derived, which gives a sophisticated method for obtaining (arbitrarily good) bounds on the optimal mixing rate, as well as the optimality conditions.

Estimating graph parameters with random walks

- MathematicsMathematical Statistics and Learning
- 2019

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs,…

Networks: An Introduction

- Computer Science
- 2010

This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.

The Anatomy of a Large-Scale Hypertextual Web Search Engine

- Computer ScienceComput. Networks
- 1998

Design of sample surveys to estimate the prevalence of rare diseases : three unbiased estimates

- Geography
- 1965

Targeted random walk designs

- Survey Methodology,
- 2006

Design of Sample Surveys to Estimate the Prevalence of IRareDiseases: Three Unbiased Estimates. Vital and Health Statistics

- 1965