OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS
文献类型：期刊论文
| 作者 | Chen, Q; Qian, JH; Zhu, L; Han, DD |
| 刊名 | JOURNAL OF APPLIED ANALYSIS AND COMPUTATION
 |
| 出版日期 | 2016 |
| 卷号 | 6期号:1页码:30—37 |
| ISSN号 | 2156-907X |
| 关键词 | NAVIGATION |
| 通讯作者 | Han, DD (reprint author), E China Normal Univ, Shanghai Key Lab Multidimens Informat Proc, Shanghai 200241, Peoples R China. ; Han, DD (reprint author), E China Normal Univ, Sch Informat Sci & Technol, Shanghai 200241, Peoples R China. |
| 英文摘要 | 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(r(ij)) similar to r(ij)(-alpha), where r(ij) is the geometric distance between node i and j. By assigning each shortcut an energy E = r.tau, a link with length r survives within period tau, which leads the network to a decaying dynamics of constantly losing long-range links. We find new optimal transport in the dynamical system for alpha = 43d, 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 possibility of the optimal design for general transport dynamics in the time-varying network. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000369109800003 |
| 源URL | [http://ir.sinap.ac.cn/handle/331007/25794]  |
| 专题 | 上海应用物理研究所_中科院上海应用物理研究所2011-2017年 |
| 推荐引用方式 GB/T 7714 | Chen, Q,Qian, JH,Zhu, L,et al. OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS[J]. JOURNAL OF APPLIED ANALYSIS AND COMPUTATION,2016,6(1):30—37. |
| APA | Chen, Q,Qian, JH,Zhu, L,&Han, DD.(2016).OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS.JOURNAL OF APPLIED ANALYSIS AND COMPUTATION,6(1),30—37. |
| MLA | Chen, Q,et al."OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS".JOURNAL OF APPLIED ANALYSIS AND COMPUTATION 6.1(2016):30—37. |
入库方式： OAI收割
来源：上海应用物理研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。