Premium
Hitting time of large subsets of the hypercube
Author(s) -
Černý Jiří,
Gayrard Véronique
Publication year - 2008
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20217
Subject(s) - random walk , hitting time , simple (philosophy) , percolation (cognitive psychology) , simple random sample , hypercube , mathematics , statistical physics , domain (mathematical analysis) , spin glass , position (finance) , asymptotically optimal algorithm , combinatorics , discrete mathematics , physics , mathematical analysis , algorithm , quantum mechanics , statistics , finance , neuroscience , sociology , economics , biology , population , philosophy , demography , epistemology
We study the simple random walk on the n ‐dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly rescaled hitting time is asymptotically exponentially distributed, uniformly in the starting position of the walk. These conditions are then verified for percolation clouds with densities that are much smaller than ( n log n ) ‐1 . A main motivation behind this article is the study of the so‐called aging phenomenon in the Random Energy Model, the simplest model of a mean‐field spin glass. Our results allow us to prove aging in the REM for all temperatures, thereby extending earlier results to their optimal temperature domain. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008