Navigability of interconnected networks under random failures

From MaRDI portal
Publication:2962230

DOI10.1073/PNAS.1318469111zbMATH Open1355.90014arXiv1306.0519OpenAlexW1807089695WikidataQ28658064 ScholiaQ28658064MaRDI QIDQ2962230FDOQ2962230


Authors: Manlio De Domenico, Albert Solé-Ribalta, Sergio Gomez, Alex Arenas Edit this on Wikidata


Publication date: 16 February 2017

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Abstract: Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks under random failures", we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficiency in exploring the multiplex critically depends on the underlying topology of layers, the weight of their inter-connections and the strategy adopted to walk.


Full work available at URL: https://arxiv.org/abs/1306.0519




Recommendations



Cites Work


Cited In (42)





This page was built for publication: Navigability of interconnected networks under random failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2962230)