Extreme events on complex networks

Abstract

We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with smaller number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.

5 pages, 4 figures

References in corpus (12)

• The scaling laws of human travel
• Modeling the scaling properties of human mobility
• Betweenness Centrality in Large Complex Networks
• Fluctuations in network dynamics
• Dynamics of jamming transitions in complex networks
• Global mean first-passage times of random walks on complex networks
• Congestion phenomena on complex networks
• Transport on Complex Networks: Flow, Jamming and Optimization
• Return interval distribution of extreme events and long term memory
• Scaling breakdown in flow fluctuations on complex networks
• Effect of congestion costs on shortest paths through complex networks
• Jamming transition in traffic flow under the priority queuing protocol

Cited by in corpus (27)

• Sparse graphs using exchangeable random measures
• Extreme events in dynamical systems and random walkers: A review
• Spatiotemporal patterns and predictability of cyberattacks
• Extreme events in Fitzhugh-Nagumo oscillators coupled with two time delays
• Extreme events and event size fluctuations in biased random walks on networks
• Universal framework for record ages under restart
• Large deviations of random walks on random graphs
• Universal structural estimator and dynamics approximator for complex networks
• Emergence of extreme events in a quasi-periodic oscillator
• Mean encounter times for multiple random walkers on networks
• Manipulation of extreme events on scale-free networks
• Extreme events in stochastic transport on networks
• Variability of Contact Process in Complex Networks
• Predicting Fatigue Crack Growth via Path Slicing and Re-Weighting
• Analysis of fluctuations in the first return times of random walks on regular branched networks
• First detection of threshold crossing events under intermittent sensing
• Balanced condition in networks leads to Weibull statistics
• Biased random walkers and extreme events on the edges of complex networks
• Delocalization-localization dynamical phase transition of random walks on graphs
• Dynamical fluctuations of random walks in higher-order networks
• Continuous Gated First-Passage Processes
• Maximal dispersion of adaptive random walks
• Maxima of log-correlated fields: some recent developments
• Mean first-encounter times of simultaneous random walkers with resetting on networks
• Network heterogeneity and node capacity lead to heterogeneous scaling of fluctuations in random walks on graphs
• Structural instability of large-scale functional networks
• Enhancement of Extreme Events through the Allee effect and its Mitigation through Noise in a Three Species System