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
Deterministic walks in random environments
β Scribed by Leonid A Bunimovich
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 95 KB
- Volume
- 187
- Category
- Article
- ISSN
- 0167-2789
No coin nor oath required. For personal study only.
β¦ Synopsis
Deterministic walks in random environments (DWRE) occupy an intermediate position between purely random (generated by random trials) and purely deterministic (generated by deterministic dynamical systems, e.g., by maps) models of diffusion. These models combine deterministic and probabilistic features. We review general properties of DWRE and demonstrate that, to a large extent, their dynamics and their statistics can be analyzed consecutively and separately. We also show that orbits of one-dimensional walks in rigid environments with non-constant rigidity almost surely visit each site infinitely many times.
π SIMILAR VOLUMES
The asymptotic behavior of a diffusive particle under the influence of an environment and of a dynamical feedback coupling is considered in the framework of a two-dimensional numerical simulation. The feedback is controlled by a Ε½ . memory term of strength l. A sufficient negative memory term l -0 o
We study the survival probability of a particle that performs a random walk in a medium with traps where the trapping strength V is distributed randomly. We use an approach which is asymptotically exact and brings Wn(s), the number of distinct sites s visited after n steps, into play. Particularly i