C. Aak-+-11]-noga-alon, M. Avin, G. Koucký, Z. Kozma, M. R. Lotker et al., Many Random Walks Are Faster Than One ?, Combinatorics, Probability and Computing, vol.20, issue.4, pp.481-502, 2008.

C. Barry and . Arnold, Pareto and Generalized Pareto Distributions, pp.119-145, 2008.

A. A. Borovkov and K. A. Borovkov, Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions, 2001.

L. Boczkowski, B. Guinard, A. Korman, Z. Lotker, and M. Renault, Random Walks with Multiple Step Lengths, LATIN 2018: Theoretical Informatics, vol.3, pp.174-186, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01955582

F. Chung and L. Lu, Survey: Concentration inequalities and martingale inequalities: A survey, Internet Mathematics, vol.3, 2006.

A. Clementi, A. Monti, and R. Silvestri, Modelling mobility: A discrete revolution, Ad Hoc Networks, vol.9, issue.6, pp.998-1014, 2011.

A. Clementi, R. Silvestri, and L. Trevisan, Information spreading in dynamic graphs, Distributed Computing, vol.28, issue.1, pp.55-73, 2001.

P. Devdatt, A. Dubhashi, and . Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms, 2009.

A. David, Y. Levin, and . Peres, Markov Chains and Mixing Times, 2001.

D. Easley and J. Kleinberg, Networks, Crowds, and Markets, vol.3, 2010.

A. M. Edwards, R. A. Phillips, N. W. Watkins, M. P. Freeman, E. J. Murphy et al., Revisiting Lévy flight search patterns of wandering albatrosses, bumblebees and deer, Nature, vol.449, issue.7165, pp.1044-1048, 2001.

K. Efremenko and O. Reingold, How Well Do Random Walks Parallelize?, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Computer Science, pp.476-489, 2009.

R. Elsässer and T. Sauerwald, Tight bounds for the cover time of multiple random walks, 36th International Colloquium on Automata, Languages and Programming, vol.412, pp.2623-2641, 2009.

W. Feller, An Introduction to Probability Theory and Its Applications, 1968.

O. Feinerman and A. Korman, The ANTS problem. Distributed Computing, vol.30, pp.149-168, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01430372

O. Feinerman, A. Korman, Z. Lotker, and J. Sereni, Collaborative search on the plane without communication, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01241094

P. Fraigniaud, A. Korman, and Y. Rodeh, Parallel Exhaustive Search Without Coordination, Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC '16, pp.312-323, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01393646

B. V. Gnedenko and A. N. Kolmogorov, Limit Distributions for Sums of Independent Random Variables

B. Guinard and A. Korman, Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths, vol.3, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02303873

B. Guinard and A. Korman, The search efficiency of intermittent lévy walks optimally scales with target size. CoRR, abs, 2001.

D. Barry, M. F. Hughes, E. W. Shlesinger, and . Montroll, Random walks with self-similar clusters, Proceedings of the National Academy of Sciences, vol.78, issue.6, pp.3287-3291, 1981.

J. Kleinberg, The Small-world Phenomenon: An Algorithmic Perspective, Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, STOC '00, pp.163-170, 2000.

J. M. Kleinberg, Navigation in a small world, Nature, vol.406, issue.6798, pp.845-845, 2000.

F. Varun-kanade, T. Mallmann-trenn, and . Sauerwald, On Coalescence Time in Graphs: When is Coalescing As Fast As Meeting?, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '19, pp.956-965, 2019.

D. Lemire, On the sum of power laws, 2008.

N. Levernier, J. Textor, O. Bénichou, and R. Voituriez, Inverse square lévy walks are not optimal search strategies for d ? 2, Phys. Rev. Lett, vol.124, p.80601, 2001.

J. , L. Boudec, and M. Vojnovic, The random trip model: Stability, stationary regime, and perfect simulation, IEEE/ACM Transactions on Networking, vol.14, issue.6, pp.1153-1166

P. Lévy, Théorie de l'addition des variables aléatoires, vol.1, p.1, 1954.

B. Benoit and . Mandelbrot, The Fractal Geometry of Nature, Times Books, issue.1, 1982.

J. Nolan, Stable Distributions: Models for Heavy-Tailed Data, 2007.

J. Nolan, Bibliography on stable distributions, processes and related topics

J. R. Norris, Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics, 1997.

V. V. Palyulin, G. Blackburn, M. A. Lomholt, N. W. Watkins, R. Metzler et al., First passage and first hitting times of Lévy flights and Lévy walks, New Journal of Physics, vol.21, issue.10, p.103028, 2001.

V. V. Palyulin, A. V. Chechkin, and R. Metzler, Lévy flights do not always optimize random blind search for sparse targets, Proceedings of the National Academy of Sciences, vol.111, issue.8, pp.2931-2936, 2001.

A. M. Reynolds, Current status and future directions of Lévy walk research, Biology Open, vol.7, issue.1, p.30106, 2001.

R. Radhika-ranjan, Handbook of Mobile Ad Hoc Networks for Mobility Models, 2011.

G. Samorodnitsky, Stable Non-Gaussian Random Processes: Stochastic Models with Infinite Variance, 1994.

F. Michael, J. Shlesinger, and . Klafter, Lévy Walks Versus Lévy Flights, On Growth and Form: Fractal and Non-Fractal Patterns in Physics, pp.279-283, 1986.

A. Saberi, P. Tetali, and M. Mihail, Random walks with lookahead on power law random graphs, Internet Mathematics, vol.3, issue.2, pp.1-2006

G. M. Viswanathan, V. Afanasyev, S. V. Buldyrev, E. J. Murphy, P. A. Prince et al., Lévy flight search patterns of wandering albatrosses, Nature, vol.381, issue.6581, pp.413-415, 1996.

G. M. Viswanathan, V. Sergey, S. Buldyrev, M. G. Havlin, E. P. Da-luz et al., Optimizing the success of random searches, Nature, vol.401, issue.6756, pp.911-914, 1999.

V. Fourcassié, C. Bredard, K. Volpatti, and G. Theraulaz, Dispersion movements in ants: spatial structuring and density-dependent effects, Behavioural Processes, vol.63, issue.1, pp.33-43, 2003.

M. Gandhimohan, M. G. Viswanathan, E. P. Da-luz, H. E. Raposo, and . Stanley, The Physics of Foraging: An Introduction to Random Searches and Biological Encounters, 2004.

G. M. Viswanathan, E. P. Raposo, and M. G. Da-luz, Lévy flights and superdiffusion in the context of biological encounters and random searches, Physics of Life Reviews, vol.5, issue.3, pp.133-150, 2001.