Pointwise upper estimates for transition probabilities of continuous time random walks on graphs
From MaRDI portal
(Redirected from Publication:520767)
Abstract: Let be a continuous time random walk on a weighted graph. Given the on-diagonal upper bounds of transition probabilities at two vertices and , we use an adapted metric initiated by Davies, and obtain Gaussian upper estimates for the off-diagonal transition probability .
Recommendations
- Gaussian upper bounds for heat kernels of continuous time simple random walks
- Lower bounds for transition probabilities on graphs
- The volume and time comparison principle and transition probability estimates for random walks
- Transition probability estimates for long range random walks
- Heat kernel estimates for random walks with degenerate weights
Cited in
(8)- Heat kernel upper bounds for symmetric Markov semigroups
- Upper bounds for transition probabilities on graphs and isoperimetric inequalities
- The volume and time comparison principle and transition probability estimates for random walks
- Harnack inequalities and local central limit theorem for the polynomial lower tail random conductance model
- scientific article; zbMATH DE number 1984020 (Why is no real title available?)
- Upper escape rate of Markov chains on weighted graphs
- Gaussian upper bounds for heat kernels of continuous time simple random walks
- Off-diagonal upper heat kernel bounds on graphs with unbounded geometry
This page was built for publication: Pointwise upper estimates for transition probabilities of continuous time random walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520767)