Navigable networks as Nash equilibria of navigation games

Nature Communications

Volumn 6, Issue , 2015, Pages

  Gulyás, András ^a   Bíró, József J ^a   Korösi, Attila ^a   Rétvári, Gábor ^a   Krioukov, Dmitri ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIRPORT; BRAIN; COST-BENEFIT ANALYSIS; GAME THEORY; INTERNET; NAVIGATION; NETWORK DESIGN; ROAD; TRADE-OFF;

ACCURACY; ALGORITHM; ARTICLE; BRAIN CORTEX; BRAIN FUNCTION; COMPUTER NETWORK; COMPUTER PROGRAM; COMPUTER SIMULATION; CONNECTOME; CONTROLLED STUDY; COST; DENSITY; ERROR; GAME; GEOMETRY; HUMAN; HUNGARY; INFORMATION PROCESSING; INTERNET; NONHUMAN; PREDICTION; PROBABILITY; BRAIN; LANGUAGE; PROTEIN PROTEIN INTERACTION; TRAFFIC AND TRANSPORT;

HUNGARY;

BRAIN; COMPUTER COMMUNICATION NETWORKS; GAME THEORY; HUMANS; INTERNET; LANGUAGE; PROTEIN INTERACTION MAPS; TRANSPORTATION;

EID: 84936818256     PISSN: None     EISSN: 20411723     Source Type: Journal    
DOI: 10.1038/ncomms8651     Document Type: Article

References (65)

1. Barrat, A., Barthelemy, M. & Vespignani, A. Dynamical Processes On Complex Networks vol. 1 (Cambridge University Press Cambridge, 2008).
2. Kitsak, M. et al. Identification of influential spreaders in complex networks. Nat. Phys. 6, 888-893 (2010).
3. Watts, D. J., Dodds, P. S. & Newman, M. E. J. Identity and search in social networks. Science 296, 1302 (2002).
4. Pastor-Satorras, R. & Vespignani, A. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200 (2001).
5. Rhodes, C. J. & Anderson, R. M. Power laws governing epidemics in isolated populations. Nature 381, 600-602 (1996).
6. Ferguson, N. Capturing human behaviour. Nature 446, 733-733 (2007).
7. Doerr, C., Blenn, N. & Van Mieghem, P. Lognormal infection times of online information spread. PloS ONE 8, e64349 (2013).
8. Meloni, S., Arenas, A. & Moreno, Y. Traffic-driven epidemic spreading in finite-size scale-free networks. Proc. Natl Acad. Sci. USA 106, 16897-16902 (2009).
9. Barthélemy, M., Barrat, A., Pastor-Satorras, R. & Vespignani, A. Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. Phys. Rev. Lett. 92, 178701 (2004).
10. Miritello, G., Moro, E. & Lara, R. Dynamical strength of social ties in information spreading. Phys. Rev. E 83, 045102 (2011).
11. Gallos, L. K., Song, C., Havlin, S. & Makse, H. A. Scaling theory of transport in complex biological networks. Proc. Natl Acad. Sci. USA 104, 7746-7751 (2007).
12. Moreno, Y., Nekovee, M. & Pacheco, A. F. Dynamics of rumor spreading in complex networks. Phys. Rev. E 69, 066130 (2004).
13. Barabási, A.-L. & Oltvai, Z. N. Network biology: understanding the cell's functional organization. Nat. Rev. Genet. 5, 101-113 (2004).
14. Yamada, T. & Bork, P. Evolution of biomolecular networks: lessons from metabolic and protein interactions. Nat. Rev. Mol. Cell Biol. 10, 791-803 (2009).
15. Bullmore, E. & Sporns, O. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat. Rev. Neurosci. 10, 168-198 (2009).
16. Chialvo, D. Emergent complex neural dynamics. Nat. Phys. 6, 744-750 (2010).
17. Milgram, S. The small world problem. Psychol. Today 1, 61-67 (1967).
18. Travers, J. & Milgram, S. An experimental study of the small world problem. Sociometry 32, 425-443 (1969).
19. Kleinberg, J. Navigation in a small world. Nature 406, 845-845 (2000).
20. Dodds, P. S., Muhamad, R. & Watts, D. J. An experimental study of search in global social networks. Science 301, 827-829 (2003).
21. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P. & Tomkins, A. Geographic routing in social networks. Proc. Natl Acad. Sci. USA 102, 11623-11628 (2005).
22. Simsek, O. & Jensen, D. Navigating networks by using homophily and degree. Proc. Natl Acad. Sci. USA 105, 12758-12762 (2008).
23. Boguñá, M., Krioukov, D. & Claffy, K. Navigability of complex networks. Nat. Phys. 5, 74-80 (2009).
24. Caretta Cartozo, C. & De Los Rios, P. Extended navigability of small world networks: exact results and new insights. Phys. Rev. Lett. 102, 238703 (2009).
25. Hu, Y., Wang, Y., Li, D., Havlin, S. & Di, Z. Possible origin of efficient navigation in small worlds. Phys. Rev. Lett. 106, 108701 (2011).
26. Lee, S. H. & Holme, P. Exploring maps with greedy navigators. Phys. Rev. Lett. 108, 128701 (2012).
27. Lee, S. H. & Holme, P. Geometric properties of graph layouts optimized for greedy navigation. Phys. Rev. E 86, 067103 (2012).
28. Capitán, J. A. et al. Local-based semantic navigation on a networked representation of information. PLoS ONE 7, e43694 (2012).
29. Cornelius, S. P., Lee, J. S. & Motter, A. E. Dispensability of Escherichia coli's latent pathways. Proc. Natl Acad. Sci. USA 108, 3124-3129 (2011).
30. Nisan, N. Algorithmic Game Theory (Cambridge Universiy Press, 2007).
31. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C. H. & Shenker, S. in Podc'03 (Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing) 347-351 (Boston, Massachusetts, 2003).
32. Anshelevich, E. et al. in Proc. of FOCS'04 295-304 (2004).
33. Corbo, J. & Parkes, D. in PODC'05 (Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing) 99-107 (ACM, New York, 2005).
34. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y. & Roditty, L. in SODA'06 (Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm) 89-98 (ACM, New York, 2006).
35. Demaine, E. D., Hajiaghayi, M., Mahini, H. & Zadimoghaddam, M. in PODC'07 (Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC)) 292-298 (Portland, Oregon, 2007).
36. Mihalák, M. & Schlegel, J. The price of anarchy in network creation games is (mostly) constant. Alg. Game Theory. LNCS 6386, 276-287 (2010).
37. Lee, S. H. & Holme, P. A greedy-navigator approach to navigable city plans. Eur. Phys. J. Spec. Top. 215, 135-144 (2013).
38. Papadimitriou, C. H. & Ratajczak, D. On a conjecture related to geometric routing. Theor. Comput. Sci. 344, 3-14 (2005).
39. Papadopoulos, F., Kitsak, M., Serrano, M. A., Boguñá, M. & Krioukov, D. Popularity versus similarity in growing networks. Nature 489, 537-540 (2012).
40. Penrose, M. Random Geometric Graphs (Oxford University Press, 2003).
41. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A. & Boguñá, M. Hyperbolic geometry of complex networks. Phys. Rev. E 82, 36106 (2010).
42. Garfinkel, R. S. & Nemhauser, G. L. Integer Programming vol. 4 (Wiley, 1972).
43. Boguñá, M. & Pastor-Satorras, R. Class of correlated random networks with hidden variables. Phys. Rev. E 68, 36112 (2003).
44. Newman, M. E. J. Power laws, Pareto distributions and Zipf's law. Contemp. Phys. 46, 323-351 (2005).
45. Cohen, R. & Havlin, S. Scale-free networks are ultrasmall. Phys. Rev. Lett. 90, 058701 (2003).
46. Tiesinga, P. H. E., Fellous, J. M., José, J. V. & Sejnowski, T. J. Optimal information transfer in synchronized neocortical neurons. Neurocomputing 38-40, 397-402 (2001).
47. Laughlin, S. B. & Sejnowski, T. J. Communication in neuronal networks. Science 301, 1870-1874 (2003).
48. Heuvel, M. P. V. D., Kahn, R. S., Goñi, J., Sporns, O. & van den Heuvel, M. P. Brain Communication. Proc. Natl Acad. Sci. USA 109, 11372-11377 (2012).
49. Goñi, J. et al. Resting-brain functional connectivity predicted by analytic measures of network communication. Proc. Natl Acad. Sci. USA 111, 833-838 (2014).
50. Szabó, D. & Gulyás, A. Notes on the topological consequences of BGP policy routing on the Internet AS topology. In Advances in Communication Networking 274-281 (Springer Berlin Heidelberg, 2013).
51. D'Souza, R. M., Borgs, C., Chayes, J. T., Berger, N. & Kleinberg, R. D. Emergence of tempered preferential attachment from optimization. Proc. Natl Acad. Sci. USA 104, 6112-6117 (2007).
52. Muchnik, L. et al. Origins of power-law degree distribution in the heterogeneity of human activity in social networks. Sci. Rep. 3, 1783 (2013).
53. Krioukov, D. & Ostilli, M. Duality between equilibrium and growing networks. Phys. Rev. E 88, 022808 (2013).
54. Li, G. et al. Towards design principles for optimal transport networks. Phys. Rev. Lett. 104, 018701 (2010).
55. Rozenfeld, H. D., Song, C. & Makse, H. A. Small-world to fractal transition in complex networks: a renormalization group approach. Phys. Rev. Lett. 104, 025701 (2010).
56. Li, G. et al. Optimal transport exponent in spatially embedded networks. Phys. Rev. E 87, 042810 (2013).
57. Newman, M. E. J. The structure and function of complex networks. SIAM Rev. 45, 167-256 (2003).
58. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwanga, D.-U. Complex networks: structure and dynamics. Phys. Rep. 424, 175-308 (2006).
59. Ferrer i Cancho, R. & Sole, R. The small world of human language. Proc. R. Soc. Lond. B, Biol. Sci. 268, 2261-2265 (2001).
60. Choudhury, M. & Mukherjee, A. The structure and dynamics of linguistic networks. In Dynamics on and of Complex Networks 145-166 (Springer, 2009).
61. Baronchelli, A., Ferrer i Cancho, R., Pastor-Satorras, R., Chater, N. & Christiansen, M. H. Networks in cognitive sciences. Trends Cogn. Sci. 17, 348-360 (2013).
62. Boguñá, M., Papadopoulos, F. & Krioukov, D. Sustaining the internet with hyperbolic mapping. Nat. Commun. 1, 62 (2010).
63. Milo, R. et al. Superfamilies of evolved and designed networks. Science 303, 1538-1542 (2004).
64. Hagmann, P. et al. Mapping the structural core of human cerebral cortex. PLoS Biol. 6, 1479-1493 (2008).
65. Papadopoulos, F., Psomas, C. & Krioukov, D. Network mapping by replaying hyperbolic growth. Networking, IEEE ACM Transact. 23, 198-211 (2014).