On Spectral Radius of Biased Random Walks on Infinite Graphs
Zhan Shi, Vladas Sidoravicius, He Song, Longmin Wang, Kainan Xiang
TL;DR
This paper investigates the spectral radius of biased random walks on infinite graphs, providing general theoretical results that enhance understanding of their spectral properties.
Contribution
It introduces new theoretical results on the spectral radius of biased random walks, extending previous work in infinite graph analysis.
Findings
Derived bounds for spectral radius under various biases
Identified conditions affecting spectral radius
Extended spectral analysis to broader classes of graphs
Abstract
We consider a class of biased random walks on infinite graphs and present several general results on the spectral radius of biased random walk.
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
TopicsGraph theory and applications · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods