Temporal-varying failures of nodes in networks
arXiv:1507.01716 · doi:10.1103/PhysRevE.92.022810
Abstract
We consider networks in which random walkers are removed because of the failure of specific nodes. We interpret the rate of loss as a measure of the importance of nodes, a notion we denote as failure-centrality. We show that the degree of the node is not sufficient to determine this measure and that, in a first approximation, the shortest loops through the node have to be taken into account. We propose approximations of the failure-centrality which are valid for temporal-varying failures and we dwell on the possibility of externally changing the relative importance of nodes in a given network, by exploiting the interference between the loops of a node and the cycles of the temporal pattern of failures. In the limit of long failure cycles we show analytically that the escape in a node is larger than the one estimated from a stochastic failure with the same failure probability. We test our general formalism in two real-world networks (air-transportation and e-mail users) and show how communities lead to deviations from predictions for failures in hubs.
arXiv comment7 pages, 3 figures
References in corpus (23)
- Self-similar community structure in organisations
- Search in Power-Law Networks
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- Optimal network topologies for local search with congestion
- Characterizing the dynamical importance of network nodes and links
- Congestion and centrality in traffic flow on complex networks
- Random walks and search in time-varying networks
- Global mean first-passage times of random walks on complex networks
- Leaking Chaotic Systems
- Rare events, escape rates and quasistationarity: some exact formulae
- Constructing and sampling directed graphs with given degree sequences
- Asymptotic analysis of first passage time in complex networks
- Ring structures and mean first passage time in networks
- Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
- Stochastic perturbations in open chaotic systems: random versus noisy maps
- Escape Rates Formulae and Metastability for Randomly perturbed maps
- Return probabilities and hitting times of random walks on sparse Erdos-Renyi graphs
- Faster than expected escape for a class of fully chaotic maps
- Escape through a time-dependent hole in the doubling map
- Network connectivity in non-convex domains with reflections
- Follow the fugitive: an application of the method of images to open dynamical systems
- Keyhole and Reflection Effects in Network Connectivity Analysis
- Random Walks on Complex Networks