Random walks on graphs with volume and time doubling
From MaRDI portal
Publication:854544
Abstract: This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
Recommendations
- Volume and time doubling of graphs and random walks: The strongly recurrent case
- Random walks on graphs with regular volume growth
- Random walk on graphs with regular resistance and volume growth
- Random walks on dense graphs and graphons
- scientific article; zbMATH DE number 4197088
- Random walks on the random graph
- Random Walks on Randomly Evolving Graphs
- scientific article; zbMATH DE number 4007384
Cites work
- scientific article; zbMATH DE number 2154239 (Why is no real title available?)
- Construction of diffusion processes on fractals, \(d\)-sets, and general metric measure spaces
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Harnack inequalities and sub-Gaussian estimates for random walks
- On the relation between elliptic and parabolic Harnack inequalities
- Parabolic Harnack inequality and estimates of Markov chains on graphs
- Random walks on graphs with regular volume growth
- Random walks on graphs, electric networks and fractals
- Riemannian manifold, global mean value inequality, Laplace equation, heat equation, weak volume growth condition
- Stability of parabolic Harnack inequalities
- Stability of parabolic Harnack inequalities on metric measure spaces
- Sub-Gaussian estimates of heat kernels on infinite graphs
- Transition probabilities for the simple random walk on the Sierpinski graph
Cited in
(4)
This page was built for publication: Random walks on graphs with volume and time doubling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854544)