betaFeedback

WorksPhysics and Astronomy

Where are the shortest-path nodes in spatial networks?

Abstract

To predict the spatial distribution of shortest-path nodes, we propose a Gaussian estimate of the shortest-path node probability πuv(w)π_{uv}(w), the probability that a node ww lies on a shortest path between a source uu and a destination vv. According to the Gaussian estimate, three variables affect the shortest-path node probability πuv(w)π_{uv}(w) and combine into one variable, the standardized detour XuvwX_{uvw}. In our simulations of hard and soft random geometric graphs in Euclidean, hyperbolic and spherical space, the standardized detour XuvwX_{uvw} alone approximately determines how fast the shortest-path node probability πuv(w)π_{uv}(w) decreases as the node ww moves away from the geodesic between the source uu and the destination vv. We find and explain that, when the hopcount variance σ2(Huv)σ^2(H_{uv}) is very small, the shortest-path nodes have a discrete spatial distribution, a quantized distribution of shortest-path nodes. We further extend the study to spatially inhomogeneous networks, for which we propose a method to find the shortest-path nodes.

Paper details

vlnc:W_hjug2nb5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…