Consider a set of N cities randomly distributed in the bulk of a hypercube with d dimensions. A walker, with memory m, begins his route from a given city of this map and moves, at each discrete time step, to the nearest point, which has not been visited in the preceding m steps. After reviewing the
Random walks in random media with random signs
β Scribed by Martin P. Gelfand
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 257 KB
- Volume
- 177
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
β¦ Synopsis
calculations indicate that the transverse displacement and free energy fluctuations of 1 + 1 dimensional directed random walks in media with sign randomness are characterized by the same exponents as directed walks in ordinary random media, with positive statistical weights.
Professor Michael E. Fisher has had a longstanding interest in the properties of random walks and their applications in statistical physics: see, for example, his delightful Boltzmann Medalist address, "Walks, walls, wetting, and melting" [ 1 ]. We hope he enjoys this small contribution to the subject.
Directed 1 + 1 dimensional random walks in random media are now well understood in many respects [ 2-5 ], while continuing to be of interest [6][7][8]. Such walks provide simple models of polymers in random media or interfaces in random-bond Ising models. They are characterized by a wandering exponent v= ~, which describes the scaling of the typical transverse displacement La_ with the longitudinal displacement L, via Ll ~ L I~', and by a fluctuation exponent o9 which describes the growth in the sample-to-sample fluctuations of the free energy (described below) with longitudinal displacement, via AF~ L~.
To make the discussion more concrete, consider a square lattice rotated clockwise by 45 Β°, as shown in fig. 1. Directed walks from the origin to points in the first quadrant propagate strictly to the right; a walk which has reached (x, y) can go to either (x+ 1, y) or (x, y+ 1 ) at the next step.
Associate each nearest-neighbor bond ~l of the lattice with a random value ot [r; r' ] drawn independently from some distribution. For the moment suppose that a~>0; this corresponds to the usual directed-random-walk-in-random-media problem, with cz corresponding to e -`/T and E being a random energy. The statistical weight of an individual walk is given by W(F) = l-I t,;,' l~r a [r; r' ], where F denotes the set of bonds comprising the walk. The partition function Z[r] is defined as the sum of the weights of all directed walks from the origin to r. This partition function depends implicitly on the particular realization of disorder; let us use angular brackets to denote averages over the or[r; r' ].
#~ Note that one could instead associate a random value with each site rather than each bond, but one expects the same asymptotic properties to be obtained.
π SIMILAR VOLUMES
This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou