Navigability of interconnected networks under random failures
Indexed inarxivcrossrefpubmed
Abstract
Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce the theoretical tools required to describe random walks in interconnected networks accounting for structure and dynamics inherent to real systems. We develop an analytical approach for the covering time of random walks in interconnected networks and compare it with extensive Monte Carlo simulations. Generally speaking,…
Citation impact
567
total citations
- FWCI
- 34.78
- Percentile
- 100%
- References
- 48
Citations per year
Authors
4Topics & keywords
Topics
Keywords
- Navigability
- Random walk
- Vertex (graph theory)
- Computer science
- Topology (electrical circuits)
- Multiplex
- Theoretical computer science
- Network topology
UN Sustainable Development Goals
- Sustainable cities and communities
No related works found for this paper.