QQ客服 官方微博 反馈留言

	Levy random walks on multiplex networks
	Guo, Quantong ; Cozzo, Emanuele ; Zheng, Zhiming ; Moreno, Yamir
	2016
关键词	COMPLEX NETWORKS INTERCONNECTED NETWORKS
英文摘要	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.; Academic Excellence Foundation of BUAA for PhD students; Chinese National Science Foundation [11201017, 11290141, 11401396]; China Scholarship Council [201406020055]; DGA; EC FET-Proactive Project Multiplex [317532]; SCI(E); ARTICLE; yamir.moreno@gmail.com; 6
语种	英语
出处	SCI
出版者	SCIENTIFIC REPORTS
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/458365]
专题	数学科学学院
推荐引用方式 GB/T 7714	Guo, Quantong,Cozzo, Emanuele,Zheng, Zhiming,et al. Levy random walks on multiplex networks. 2016-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。