F. Karinthy and L. , , 1929.

S. Milgram, The small world problem, Psychology Today, vol.67, issue.1, pp.61-67, 1967.

J. Travers and S. Milgram, An experimental study of the small world problem, Sociometry, vol.32, pp.425-443, 1969.

J. Kleinberg, The small-world phenomenon: An algorithmic perspective, Proceedings of the 32nd ACM Symposium on Theory of Computing, pp.163-170, 2000.

J. Kleinberg, Navigation in a small world, Nature, vol.406, p.845, 2000.

D. Easley and J. Kleinberg, The small-world phenomenon, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, vol.20, pp.611-644, 2010.

C. Comte and F. Mathieu, A Julia simulator for greedy routing in Kleinberg's grid, 2017.

L. Barrì-ere, P. Fraigniaud, E. Kranakis, and D. Krizanc, Proceedings of the 15th International Conference on Distributed Computing, DISC '01, pp.270-284, 2001.

P. Fraigniaud and G. Giakkoupis, Greedy routing in small-world networks with power-law degrees, Distributed Computing, vol.27, issue.4, pp.231-253, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01097141

G. S. Manku, M. Naor, and U. Wieder, Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks, Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing (STOC), pp.54-63, 2004.

P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, and Z. Lotker, Universal Augmentation Schemes for Network Navigability: Overcoming the (n)-Barrier, Theoretical Computer Science, vol.410, pp.1970-1981, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00155186

P. Fraigniaud and G. Giakkoupis, On the searchability of small-world networks with arbitrary underlying structure, Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp.389-398, 2010.

P. Fraigniaud, C. Gavoille, and C. Paul, Eclecticism shrinks even small worlds, Distributed Computing, vol.18, issue.4, pp.279-291, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307394

C. Martel and V. Nguyen, Analyzing kleinberg's (and other) small-world models, Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing, PODC '04, pp.179-188, 2004.

D. Liben-nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins, Geographic routing in social networks, Proceedings of the National Academy of Sciences of the United States of America, vol.102, issue.33, pp.11623-11628, 2005.

S. Athanassopoulos, C. Kaklamanis, I. Laftsidis, and E. Papaioannou, An experimental study of greedy routing algorithms, High Performance Computing and Simulation (HPCS), 2010 International Conference on, pp.150-156, 2010.

M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, p.2005, 2005.

M. D. Vose, A linear algorithm for generating random numbers with a given distribution, IEEE Trans. Softw. Eng, vol.17, issue.9, pp.972-975, 1991.

J. Von-neumann, Various techniques used in connection with random digits, Nat. Bureau Standards, vol.12, pp.36-38, 1951.

F. Mathieu, Kleinberg's Grid Reloaded, 20th International Conference on Principles of Distributed Systems (OPODIS 2016), 2016.

A. J. Walker, An efficient method for generating discrete random variables with general distributions, ACM Trans. Math. Softw, vol.3, issue.3, pp.253-256, 1977.

W. Hörmann and G. Derflinger, Rejection-inversion to generate variates from monotone discrete distributions, ACM Trans. Model. Comput. Simul, vol.6, issue.3, pp.169-184, 1996.

W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Minimization or maximization of functions, Numerical Recipes: The Art of Scientific Computing, p.10, 2007.

R. I. Dunbar, Neocortex size as a constraint on group size in primates, Journal of Human Evolution, vol.22, issue.6, pp.469-493, 1992.

I. De-sola, M. Pool, and . Kochen, Contacts and influence, Social Networks, vol.1, pp.5-51, 1978.

T. H. Mccormick, M. J. Salganik, and T. Zheng, How many people do you know?: Efficiently estimating personal network size, Journal of the American Statistical Association, vol.105, issue.489, pp.59-70, 2010.

B. Wellman, Is Dunbar's number up?, British Journal of Psychology, 2011.