The shape of shortest paths in random spatial networks

Abstract

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^{\chi }$, while the transversal fluctuations, known as wandering, grow as $L^{\xi }$. We find that when weighting edges directly with their Euclidean span in various spatial network models, we have two distinct classes defined by different exponents $\xi =3/5$ and $\chi =1/5$, or $\xi =7/10$ and $\chi =2/5$, depending only on coarse details of the specific connectivity laws used. Also, the travel time fluctuations are Gaussian, rather than Tracy-Widom, which is rarely seen in first passage models. The first class contains proximity graphs such as the hard and soft random geometric graph, and the $k$-nearest neighbour random geometric graphs, where via Monte Carlo simulations we find $\xi =0.60\pm 0.01$ and $\chi =0.20\pm 0.01$, showing a theoretical minimal wandering. The second class contains graphs based on excluded regions such as $\beta$-skeletons and the Delaunay triangulation and are characterised by the values $\xi =0.70\pm 0.01$ and $\chi =0.40\pm 0.01$, with a nearly theoretically maximal wandering exponent. We also show numerically that the KPZ relation $\chi =2\xi -1$ is satisfied for all these models. These results shed some light on the Euclidean first passage process, but also raise some theoretical questions about the scaling laws and the derivation of the exponent values, and also whether a model can be constructed with maximal wandering, or non-Gaussian travel fluctuations, while embedded in space.

15 pages, 7 figures

References in corpus (10)

• Navigability of Complex Networks
• Growing interfaces uncover universal fluctuations behind scale invariance
• An exact solution for the KPZ equation with flat initial conditions
• Optimal Paths in Disordered Complex Networks
• Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks
• Connected Spatial Networks over Random Points and a Route-Length Statistic
• Universality for mathematical and physical systems
• Network Geometry and Complexity
• Random geometry and the Kardar-Parisi-Zhang universality class
• Statistical mechanics of random geometric graphs: Geometry-induced first order phase transition

Cited by in corpus (8)

• Betweenness centrality in dense spatial networks
• Random geometric graphs in high dimension
• Sizing the length of complex networks
• An Introduction to Complex Networks in Climate Finance
• Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks
• First-Passage Percolation under extreme disorder: from bond-percolation to Kardar-Parisi-Zhang universality
• Vulnerability of Transport through Evolving Spatial Networks
• Connectivity of 1d random geometric graphs