# Random Walks with Multiple Step Lengths

3 GANG - Networks, Graphs and Algorithms
Inria de Paris, IRIF - Institut de Recherche en Informatique Fondamentale
Abstract : In nature, search processes that use randomly oriented steps of different lengths have been observed at both the microscopic and the macroscopic scales. Physicists have analyzed in depth two such processes on grid topologies: Intermittent Search, which uses two step lengths, and Lévy Walk, which uses many. Taking a computational perspective, this paper considers the number of distinct step lengths k as a complexity measure of the considered process. Our goal is to understand what is the optimal achievable time needed to cover the whole terrain, for any given value of k. Attention is restricted to dimension one, since on higher dimensions, the simple random walk already displays a quasi linear cover time. We say X is a k-intermittent search on the one dimensional n-node cycle if there exists a probability distribution $p = (pi) k i=1$ , and integers L1, L2,. .. , L k , such that on each step X makes a jump $±Li$ with probability pi, where the direction of the jump (+ or −) is chosen independently with probability 1/2. When performing a jump of length Li, the process consumes time Li, and is only considered to visit the last point reached by the jump (and not any other intermediate nodes). This assumption is consistent with biological evidence, in which entities do not search while moving ballistically. We provide upper and lower bounds for the cover time achievable by k-intermittent searches for any integer k. In particular, we prove that in order to reduce the cover time $Θ(n 2)$ of a simple random walk to linear in n up to logarithmic factors, roughly log n log log n step lengths are both necessary and sufficient, and we provide an example where the lengths form an exponential sequence. In addition, inspired by the notion of intermittent search, we introduce the Walk or Probe problem, which can be defined with respect to arbitrary graphs. Here, it is assumed that querying (probing) a node takes significantly more time than moving to a random neighbor. Hence, to efficiently probe all nodes, the goal is to balance the time spent walking randomly and the time spent probing. We provide preliminary results for connected graphs and regular graphs.
Type de document :
Communication dans un congrès
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Apr 2018, Buenos Aires, Argentina. pp.174-186, 2018

https://hal.archives-ouvertes.fr/hal-01955582
Contributeur : Amos Korman <>
Soumis le : lundi 17 décembre 2018 - 17:26:03
Dernière modification le : vendredi 4 janvier 2019 - 17:33:38

### Fichier

RandomWalksWithMultipleStepLen...
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-01955582, version 1

### Citation

Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc Renault. Random Walks with Multiple Step Lengths. LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Apr 2018, Buenos Aires, Argentina. pp.174-186, 2018. 〈hal-01955582〉

### Métriques

Consultations de la notice

## 32

Téléchargements de fichiers