OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS | Zendy

Qu Chen | Zendy; Qian Jiang-Hai | Zendy; Liang Zhu | Zendy; Dingding Han | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS

Author(s) -

Qu Chen,

Qian Jiang-Hai,

Liang Zhu,

Dingding Han

Publication year - 2016

Publication title -

journal of applied analysis and computation

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.55

H-Index - 21

eISSN - 2158-5644

pISSN - 2156-907X

DOI - 10.11948/2016003

Subject(s) - path (computing) , statistical physics , computer science , node (physics) , path length , link (geometry) , spatial network , range (aeronautics) , mathematics , physics , combinatorics , computer network , materials science , quantum mechanics , composite material , programming language

We introduce temporal effect to the classical Kleinberg model and study how it affects the spatial structure of optimal transport network. The initial network is built from a regular d-dimensional lattice added by shortcuts with probability p(rij) r ij , where rij is the geometric distance between node i and j. By assigning each shortcut an energy E = r , a link with length r survives within period , which leads the network to a decaying dynamics of constantly losing long-range links. We find new optimal transport in the dynamical system for = 3 d , in contrast to any other result in static systems. The conclusion does not depend on the information used for navigation, being based on local or global knowledge of the network, which indicates the possi- bility of the optimal design for general transport dynamics in the time-varying network.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research