We investigate the disconnection time of a simple random walk in a discrete cylinder with a large finite connected base. In a recent article of A. Dembo and the author it was found that for large N the disconnection time of GN×ℤ has rough order |GN|2, when GN=(ℤ/Nℤ)d. In agreement with a conjecture by I. Benjamini, we show here that this behavior has broad generality when the bases of the discrete cylinders are large connected graphs of uniformly bounded degree.
Publié le : 2008-01-14
Classification:
Disconnection time,
random walks on graphs,
discrete cylinders,
60J10,
60K35,
82C41
@article{1196268672,
author = {Sznitman, Alain-Sol},
title = {How universal are asymptotics of disconnection times in discrete cylinders?},
journal = {Ann. Probab.},
volume = {36},
number = {1},
year = {2008},
pages = { 1-53},
language = {en},
url = {http://dml.mathdoc.fr/item/1196268672}
}
Sznitman, Alain-Sol. How universal are asymptotics of disconnection times in discrete cylinders?. Ann. Probab., Tome 36 (2008) no. 1, pp. 1-53. http://gdmltest.u-ga.fr/item/1196268672/