Hitting time of large subsets of the hypercube

Details Hitting time of large subsets of the hypercube Hitting time of large subsets of the hypercube

2006-11-08

arxiv.org/abs/math/0611242v1

Mathematics

Probability

14 pages

Scientific paper

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 paper is the study of the so-called aging phenomenon in the Random Energy Model (REM), 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.

Affiliated with

Also associated with

No associations

Rating

Hitting time of large subsets of the hypercube does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hitting time of large subsets of the hypercube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hitting time of large subsets of the hypercube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407782