1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Lower bounds for transition probabilities on graphs
Andras Telcs
The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a we…
The volume and time comparison principle and transition probability estimates for random walks
Andras Telcs
This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on…
Random walks on graphs with volume and time doubling
Andras Telcs
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
Upper bounds for transition probabilities on graphs and isoperimetric inequalities
Andras Telcs
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 for…
The Einstein relation for random walks on graphs
Andras Telcs
This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weight…