Exact Solution for Optimal Navigation with Total Cost Restriction

Details Exact Solution for Optimal Navigation with Total Cost Restriction Exact Solution for Optimal Navigation with Total Cost Restriction

2010-07-08

arxiv.org/abs/1007.1281v4

EPL, 92 (2010) 58002

Physics

Physics and Society

4 pages, 4 figures

Scientific paper

10.1209/0295-5075/92/58002

Recently, Li \textit{et al.} have concentrated on Kleinberg's navigation model with a certain total length constraint $\Lambda = cN$, where $N$ is the number of total nodes and $c$ is a constant. Their simulation results for the 1- and 2-dimensional cases indicate that the optimal choice for adding extra long-range connections between any two sites seems to be $\alpha=d+1$, where $d$ is the dimension of the lattice and $\alpha$ is the power-law exponent. In this paper, we prove analytically that for the 1-dimensional large networks, the optimal power-law exponent is $\alpha=2$ Further, we study the impact of the network size and provide exact solutions for time cost as a function of the power-law exponent $\alpha$. We also show that our analytical results are in excellent agreement with simulations.

Affiliated with

Also associated with

No associations

Rating

Exact Solution for Optimal Navigation with Total Cost Restriction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Solution for Optimal Navigation with Total Cost Restriction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Solution for Optimal Navigation with Total Cost Restriction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102189