Search arXivSearch

arXiv · 1502.01623

Percolation transitions in the survival of interdependent agents on multiplex networks, catastrophic cascades, and SOS

Abstract

The "SOS" in the title does not refer to the international distress signal, but to "solid-on-solid" (SOS) surface growth. The catastrophic cascades are those observed by Buldyrev {\it et al.} in interdependent networks, which we re-interpret as multiplex networks with agents that can only survive if they mutually support each other, and whose survival struggle we map onto an SOS type growth model. This mapping not only reveals non-trivial structures in the phase space of the model, but also leads to a new and extremely efficient simulation algorithm. We use this algorithm to study interdependent agents on duplex Erdös-Rényi (ER) networks and on lattices with dimensions 2, 3, 4, and 5. We obtain new and surprising results in all these cases, and we correct statements in the literature for ER networks and for 2-d lattices. In particular, we find that $d=4$ is the upper critical dimension, that the percolation transition is continuous for $d\leq 4$ but -- at least for $d\neq 3$ -- not in the universality class of ordinary percolation. For ER networks we verify that the cluster statistics is exactly described by mean field theory, but find evidence that the cascade process is not. For $d=5$ we find a first order transition as for ER networks, but we find also that small clusters have a nontrivial mass distribution that scales at the transition point. Finally, for $d=2$ with intermediate range dependency links we propose a scenario different from that proposed in W. Li {\it et al.}, PRL {\bf 108}, 228702 (2012).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Grassberger. 2016-02-13. Percolation transitions in the survival of interdependent agents on multiplex networks, catastrophic cascades, and SOS. https://doi.org/10.1103/physreve.91.062806

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

KEEP EXPLORING

Related papers

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn

Signatures of Nonergodicity in Sparse Random Matrices

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

cond-mat.dis-nn