scholarly journals Sharp probability estimates for random walks with barriers

2008 ◽  
Vol 145 (1-2) ◽  
pp. 269-283 ◽  
Author(s):  
Kevin Ford
2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
András Telcs

International audience 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 may fractal type graphs both the volume of a ball and the mean exit time from a ball are independent of the center, uniform in space. Here the upper estimate is given without such restriction and two-sided estimate is given if the mean exit time is independent of the center but the volume is not.


Author(s):  
Mikhail Menshikov ◽  
Serguei Popov ◽  
Andrew Wade
Keyword(s):  

1983 ◽  
Author(s):  
S. W. Dharmadhikari ◽  
Kumar Joag-dev
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document