Navigable networks as Nash equilibria of navigation games

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

[1]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[2]  S. Havlin,et al.  Scaling theory of transport in complex biological networks , 2007, Proceedings of the National Academy of Sciences.

[3]  Dmitri V. Krioukov,et al.  Network Mapping by Replaying Hyperbolic Growth , 2012, IEEE/ACM Transactions on Networking.

[4]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[5]  David C. Parkes,et al.  The price of selfish behavior in bilateral network formation , 2005, PODC '05.

[6]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[7]  Alex Arenas,et al.  Traffic-driven epidemic spreading in finite-size scale-free networks , 2009, Proceedings of the National Academy of Sciences.

[8]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[9]  Martin T. Dove.  Structure and Dynamics , 2003 .

[10]  David D. Jensen,et al.  Navigating networks by using homophily and degree , 2008, Proceedings of the National Academy of Sciences.

[11]  T. Masaki.  Structure and Dynamics , 2002 .

[12]  Lourdes Araujo,et al.  Local-Based Semantic Navigation on a Networked Representation of Information , 2012, PloS one.

[13]  R. Anderson,et al.  Power laws governing epidemics in isolated populations , 1996, Nature.

[14]  Hernán A Makse,et al.  Small-world to fractal transition in complex networks: a renormalization group approach. , 2009, Physical review letters.

[15]  Animesh Mukherjee,et al.  The Structure and Dynamics of Linguistic Networks , 2009 .

[16]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[17]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[18]  O. Sporns,et al.  High-cost, high-capacity backbone for global brain communication , 2012, Proceedings of the National Academy of Sciences.

[19]  Christos H. Papadimitriou,et al.  On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.

[20]  Dmitri Krioukov,et al.  Duality between equilibrium and growing networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Tim Roughgarden,et al.  The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

[22]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Jie Sun,et al.  Asymptotic behavior of the Kleinberg model. , 2009, Physical review letters.

[24]  Neil Ferguson,et al.  Capturing human behaviour , 2007, Nature.

[25]  Richard F. Betzel,et al.  Resting-brain functional connectivity predicted by analytic measures of network communication , 2013, Proceedings of the National Academy of Sciences.

[26]  Agata Fronczak,et al.  Mean-field theory for clustering coefficients in Barabási-Albert networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Sang Hoon Lee,et al.  A greedy-navigator approach to navigable city plans , 2012, ArXiv.

[28]  Lucas C. Parra,et al.  Origins of power-law degree distribution in the heterogeneity of human activity in social networks , 2013, Scientific Reports.

[29]  Yishay Mansour,et al.  On Nash Equilibria for a Network Creation Game , 2014, TEAC.

[30]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[31]  Terrence J Sejnowski,et al.  Communication in Neuronal Networks , 2003, Science.

[32]  Thorsten Gerber,et al.  Handbook Of Mathematical Functions , 2016 .

[33]  O. Sporns,et al.  Mapping the Structural Core of Human Cerebral Cortex , 2008, PLoS biology.

[34]  J. S. Andrade,et al.  Optimal transport exponent in spatially embedded networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[36]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[37]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[38]  G. Nemes.  Asymptotic Expansions of Integrals , 2004 .

[39]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Yamir Moreno,et al.  Dynamics of rumor spreading in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Kevin Zhou.  Navigation in a small world , 2017 .

[42]  Katherine Whalley.  Neurotrophic factors: Tuning precursor secretion , 2009, Nature Reviews Neuroscience.

[43]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[44]  A. Barabasi,et al.  Network biology: understanding the cell's functional organization , 2004, Nature Reviews Genetics.

[45]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[46]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[47]  D. Chialvo.  Emergent complex neural dynamics , 2010, 1010.2530.

[48]  Cécile Caretta Cartozo,et al.  Extended navigability of small world networks: exact results and new insights. , 2009, Physical review letters.

[49]  Marián Boguñá,et al.  Sustaining the Internet with Hyperbolic Mapping , 2010, Nature communications.

[50]  Nick Chater,et al.  Networks in Cognitive Science , 2013, Trends in Cognitive Sciences.

[51]  Christian Borgs,et al.  Emergence of tempered preferential attachment from optimization , 2007, Proceedings of the National Academy of Sciences.

[52]  Morteza Zadimoghaddam,et al.  The price of anarchy in network creation games , 2007, PODC '07.

[53]  Matús Mihalák,et al.  The Price of Anarchy in Network Creation Games Is (Mostly) Constant , 2013, Theory of Computing Systems.

[54]  Sergio Rajsbaum,et al.  Proceedings of the twenty-second annual symposium on Principles of distributed computing , 2003, PODC 2003.

[55]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[56]  András Gulyás,et al.  Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology , 2013, EUNICE.

[57]  Alessandro Vespignani,et al.  Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. , 2003, Physical review letters.

[58]  Jorge V. José,et al.  Optimal information transfer in synchronized neocortical neurons , 2001, Neurocomputing.

[59]  Vyacheslav I. Yukalov,et al.  RENORMALIZATION GROUP APPROACH , 1990 .

[60]  Piet Van Mieghem,et al.  Lognormal Infection Times of Online Information Spread , 2013, PloS one.

[61]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[62]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[63]  Wei Chen,et al.  A Game Theoretic Model for the Formation of Navigable Small-World Networks , 2014, WWW.

[64]  H E Stanley,et al.  Towards design principles for optimal transport networks. , 2010, Physical review letters.

[65]  Sang Hoon Lee,et al.  Exploring maps with greedy navigators , 2011, Physical review letters.

[66]  Esteban Moro Egido,et al.  The dynamical strength of social ties in information spreading , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[67]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[68]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[69]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[70]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[71]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[72]  S. P. Cornelius,et al.  Dispensability of Escherichia coli’s latent pathways , 2011, Proceedings of the National Academy of Sciences.

[73]  Sang Hoon Lee,et al.  Geometric properties of graph layouts optimized for greedy navigation , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[74]  P. Bork,et al.  Evolution of biomolecular networks — lessons from metabolic and protein interactions , 2009, Nature Reviews Molecular Cell Biology.

[75]  Zengru Di,et al.  Possible origin of efficient navigation in small worlds. , 2011, Physical review letters.

[76]  Paolo De Los Rios,et al.  Extended navigability of small world networks: exact results and new insights. , 2009 .

[77]  G. Nemhauser,et al.  Integer Programming , 2020 .