Search arXiv⌕ Search

arXiv · cond-mat/0301086

Cascade-based attacks on complex networks

Abstract

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adilson E. Motter, Ying-Cheng Lai. 2003-01-08. Cascade-based attacks on complex networks. https://doi.org/10.1103/physreve.66.065102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Transition path sampling in Ising models on heterogeneous graphs

Activated transitions have rates that are often exponentially small in system size. Extracting the associated activation barriers is challenging in practice, especially in the deeply metastable regimes and in the presence of disorder. Here, we use transition path sampling to evaluate transition probabilities between ferromagnetic states in the Ising model on finite sparse random graphs, which are perhaps the simplest example of a disordered system with metastable states. To interpret the transient onset of the transition probability curve, we introduce a minimal three-state kinetic description that highlights the role of intermediate configurations. We validate the method on the heterogeneous Zachary Karate Club network, where distinct dynamical regimes emerge as temperature varies. We then apply the method to random regular graphs and Erdős-Rényi graphs, showing that sample-to-sample fluctuations are weak in the former but that quenched topological disorder induces sizable instance variability in the latter. For Erdős-Rényi graphs, we introduce an instance-dependent temperature rescaling that restores a consistent finite-size scaling of dynamical rates and enables a direct comparison with the corresponding static free-energy barrier.

cond-mat.dis-nn↗

Estimates of ground state energies for the quantum SK and 2D-EA models, using deGennes-Suzuki-Kubo mean-field annealing dynamics

We perform large scale quantum annealing of the Sherrington-Kirkpatrick (SK) spin glass up to a system size $N=40000$ to estimate its ground state energy using the deGennes-Suzuki-Kubo mean-field quantum Ising dynamics, extending the earlier results (reported in Eur. Phys. J. B {\bf 98}, 226 (2025)). Here we numerically solve the deGennes-Suzuki-Kubo annealing dynamics to obtain the spin configurations and subsequently the ground state energy for a given system size at the end of the annealing, starting from a quantum paramagnetic state. The method shows high efficiency, with an overall algorithmic cost of $O(N^3)$ in estimating the energy of the ground state. We later extend this quantum annealing study to estimate the ground state energies (starting again from the quantum paramagnetic phase, annealing down to any desired low value of the transverse field) for the Edwards-Anderson (EA) spin glass model on a square lattice.

cond-mat.dis-nn↗

Perfect resonance and fragile localization suppression in correlated disordered chains

Spatial correlations can suppress scattering in disordered chains and produce perfectly transmitting resonances. The practical value of this protection, however, depends not on the resonance peak itself but on the width of the surrounding transmission window and its sensitivity to local ordering errors. We show that a resonance can remain exactly transparent at its center while arbitrarily rare adjacent-swap errors restore an inverse localization length proportional to the square of the energy detuning. For lossless single-channel chains assembled from independent blocks of fixed length and composition, this positive quadratic term is guaranteed by a local scattering invariant and holds for every arrangement and every fixed swap probability between zero and one. With exact tuning and matched contacts, the central transmission remains unity. A microscopic quantum chain exhibits both higher-order suppression of scattering in the ideal recursive arrangement and the predicted response to local exchanges. These results reveal a limitation of spatial ordering that is invisible to a measurement at the resonance alone: spatial ordering protects the resonance peak, not the transport around it. The effect can therefore be tested experimentally by measuring transmission spectra before and after exchanges, without identifying microscopic defects.

cond-mat.dis-nn↗