Open AccessA note on exit time for anchored isoperimetry
Author(s) -
Thierry Delmotte,
Clément Rau
Publication year - 2015
Publication title -
annales de la faculté des sciences de toulouse mathématiques
Language(s) - English
Resource type - Journals
eISSN - 2258-7519
pISSN - 0240-2963
DOI - 10.5802/afst.1466
Subject(s) - isoperimetric inequality , combinatorics , mathematics , random walk , graph , upper and lower bounds , transient (computer programming) , set (abstract data type) , inequality , discrete mathematics , computer science , mathematical analysis , statistics , programming language , operating system
— Let (Xn)n 0 be a reversible random walk on a graph G satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. This article covers many results of [11].
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom