DeepAI AI Chat
Log In Sign Up

Successive shortest paths in complete graphs with random edge weights

by   Stefanie Gerke, et al.

Consider a complete graph K_n with edge weights drawn independently from a uniform distribution U(0,1). The weight of the shortest (minimum-weight) path P_1 between two given vertices is known to be ln n / n, asymptotically. We define a second-shortest path P_2 to be the shortest path edge-disjoint from P_1, and consider more generally the shortest path P_k edge-disjoint from all earlier paths. We show that the cost X_k of P_k is asymptotically (2k+ln n) / n. Specifically, X_k / (2k/n+ln n/n) p→ 1 uniformly for all k ≤ n-1. We also show an analogous result when the edge weights are drawn from an exponential distribution.


page 1

page 2

page 3

page 4


Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths

The Shortest Path Problem, in real-life applications, has to deal with m...

An Efficient Algorithm for Finding Sets of Optimal Routes

In several important routing contexts it is required to identify a set o...

Volume Doubling Condition and a Local Poincaré Inequality on Unweighted Random Geometric Graphs

The aim of this paper is to establish two fundamental measure-metric pro...

Noisy source location on a line

We study the problem of locating the source of an epidemic diffusion pro...

Budgeted Steiner Networks: Three Terminals with Equal Path Weights

Given a set of terminals in 2D/3D, the network with the shortest total l...

User Preferences and the Shortest Path

Indoor navigation systems leverage shortest path algorithms to calculate...

Shortest path or random walks? A framework for path weights in network meta-analysis

Quantifying the contributions, or weights, of comparisons or single stud...