Upper bounds for transition probabilities on graphs and isoperimetric inequalities

zbMATH Open1101.60053arXiv0801.2341MaRDI QIDQ5487946FDOQ5487946

Andras Telcs

Publication date: 13 September 2006

Abstract: In this paper necessary and sufficient conditions are presented for heat kernel upper bounds for random walks on weighted graphs. Several equivalent conditions are given in the form of isoperimetric inequalities.

Full work available at URL: https://arxiv.org/abs/0801.2341

Recommendations

• Lower bounds for transition probabilities on graphs
• Isoperimetric inequalities and transient random walks on graphs
• Percolation and isoperimetry on roughly transitive graphs
• Pointwise upper estimates for transition probabilities of continuous time random walks on graphs
• scientific article; zbMATH DE number 4128851
• Percolation on finite graphs and isoperimetric inequalities.
• Percolation on infinite graphs and isoperimetric inequalities
• Lower bounds for the isoperimetric numbers of random regular graphs
• The isoperimetric constant of the random graph process

zbMATH Keywords

random walkheat kernel estimatereversible Markov chain

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Inference from stochastic processes and spectral analysis (62M15) Probabilistic potential theory (60J45)

Cited In (5)

• Percolation and isoperimetry on roughly transitive graphs
• The volume and time comparison principle and transition probability estimates for random walks
• Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
• Lower bounds for transition probabilities on graphs
• Title not available (Why is that?)

This page was built for publication: Upper bounds for transition probabilities on graphs and isoperimetric inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487946)