.png){kind=icon}
返回
Levy random walks on multiplex networks
.png){kind=icon}
OA
AI
DOI：10.1038/srep37641.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Levy flight, we study a new navigation strategy on top of multiplex networks. Capitalizing on spectral graph and stochastic matrix theories, we derive analytical expressions for the mean first passage time and the average time to reach a node on these networks. Moreover, we also explore the efficiency of Levy random walks, which we found to be very different as compared to the single layer scenario, accounting for the structure and dynamics inherent to the multiplex network. Finally, by comparing with some other important random walk processes defined on multiplex networks, we find that in some region of the parameters, a Levy random walk is the most efficient strategy. Our results give us a deeper understanding of Levy random walks and show the importance of considering the topological structure of multiplex networks when trying to find efficient navigation strategies.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.3W
被引数:
83.5W
机构
引用论文
Evaluation of the BioLogic-DT sorbent-suspension dialyser in patients with fulminant hepatic failure
PREAI
分享收藏Open source software development as a special type of academic research: Critique of vulgar Raymondism.png)
First Monday
First MondayIF0
PREAI
分享收藏
查看更多内容