Revisiting random walk based sampling in networks: Evasion of burn-in period and frequent regenerations

Abstract : Background: In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despite several theoretical advances in this area, RW based sampling techniques usually make a strong assumption that the samples are in stationary regime, and hence are impelled to leave out the samples collected during the burn-in period. Methods: This work proposes two sampling schemes without burn-in time constraint to estimate the average of an arbitrary function defined on the network nodes, for example, the average age of users in a social network. The central idea of the algorithms lies in exploiting regeneration of RWs at revisits to an aggregated super-node or to a set of nodes, and in strategies to enhance the frequency of such regenerations either by contracting the graph or by making the hitting set larger. Our first algorithm, which is based on reinforcement learning (RL), uses stochastic approximation to derive an estimator. This method can be seen as intermediate between purely stochastic Markov chain Monte Carlo iterations and deterministic relative value iterations. The second algorithm, which we call the Ratio with Tours (RT)-estimator, is a modified form of respondent-driven sampling (RDS) that accommodates the idea of regeneration. Results: We study the methods via simulations on real networks. We observe that the trajectories of RL-estimator are much more stable than those of standard random walk based estimation procedures, and its error performance is comparable to that of respondent-driven sampling (RDS) which has a smaller asymptotic variance than many other estimators. Simulation studies also show that the mean squared error of RT-esti-mator decays much faster than that of RDS with time. Conclusion: The newly developed RW based estimators (RL-and RT-estimators) allow to avoid burn-in period, provide better control of stability along the sample path, and overall reduce the estimation time. Our estimators can be applied in social and complex networks.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01935385
Contributor : Konstantin Avrachenkov <>
Submitted on : Monday, November 26, 2018 - 4:13:09 PM
Last modification on : Tuesday, November 27, 2018 - 1:22:26 AM
Long-term archiving on : Wednesday, February 27, 2019 - 2:47:43 PM

File

CSON2018_5_4.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Konstantin Avrachenkov, Vivek Borkar, Arun Kadavankandy, Jithin Sreedharan. Revisiting random walk based sampling in networks: Evasion of burn-in period and frequent regenerations. Computational Social Networks, Springer, 2018, 5 (4), ⟨10.1186/s40649-018-0051-0⟩. ⟨hal-01935385⟩

Share

Metrics

Record views

100

Files downloads

99