Analysis of Relaxation Time in Random Walk with Jumps
Konstantin Avrachenkov, Ilya Bogdanov

TL;DR
This paper investigates how adding jumps to a random walk affects its relaxation time, showing that jumps can reduce relaxation time and improve network analysis efficiency.
Contribution
It provides theoretical conditions under which jumps decrease relaxation time in random walks, enhancing understanding of their impact on network sampling.
Findings
Jumps can significantly reduce relaxation time.
Conditions identified for when jumps improve convergence.
Enhanced network analysis performance with jumps.
Abstract
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various conditions under which the relaxation time decreases with the introduction of jumps.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Machine Learning and ELM · Neural Networks and Applications
