arXiv · 2110.03459
Graph sampling by lagged random walk
Abstract
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 others.
Explore related subjects
Keep this discovery
Li-Chun Zhang. 2021-10-07. Graph sampling by lagged random walk. https://doi.org/10.1002/sta4.444
Cite the original work for its findings. Save a collection to share your selection of sources.