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