Random walks on graphs with volume and time doubling
Andras Telcs
TL;DR
This paper investigates the behavior of random walks on weighted graphs, providing estimates for transition probabilities and analyzing how volume and time doubling conditions influence these properties.
Contribution
It introduces new upper and two-sided estimates for transition probabilities of random walks under volume and time doubling conditions.
Findings
Established upper bounds for transition probabilities.
Derived two-sided estimates for random walk behavior.
Linked volume/time doubling to probabilistic estimates.
Abstract
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
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
TopicsPoint processes and geometric inequalities · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods