Related papers: History-dependent percolation in two dimensions
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked…
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…
To better understand the temporal characteristics and the lifetime of fluctuations in stochastic processes in networks, we investigated diffusive persistence in various graphs. Global diffusive persistence is defined as the fraction of…
The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…
The percolation study offers valuable insights into the characteristics of phase transition, shedding light on the underlying mechanisms that govern the formation of global connectivity within the system. We explore the percolation phase…
The models of $k$-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered…
We introduce a percolation model on $\mathbb{Z}^d$, $d \geq 3$, in which the discrete lines of vertices that are parallel to the coordinate axis are entirely removed at random and independently of each other. In this way a vertex belongs to…
The evolution of many kinetic processes in 1+1 (space-time) dimensions results in 2d directed percolative landscapes. The active phases of these models possess numerous hidden geometric orders characterized by various types of large-scale…
We consider a class of percolation models where the local occupation variables have long-range correlations decaying as a power law $\sim r^{-a}$ at large distances $r$, for some $0< a< d$ where $d$ is the underlying spatial dimension. For…
Percolation theory and the associated conductance networks have provided deep insights into the flow and transport properties of a vast number of heterogeneous materials and media. In practically all cases, however, the conductance of the…
The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid…
We investigate a limit theorem on traversable length inside semi-cylinder in the 2-dimensional supercritical Bernoulli bond percolation, which gives an extension of Theorem 2 in Grimmett(1981). This type of limit theorems was originally…
We relate various concepts of fractal dimension of the limiting set C in fractal percolation to the dimensions of the set consisting of connected components larger than one point and its complement in C (the "dust"). In two dimensions, we…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…
We investigate the influence of the range of interactions in the two-dimensional bond percolation model, by means of Monte Carlo simulations. We locate the phase transitions for several interaction ranges, as expressed by the number $z$ of…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…