Related papers: Threshold-Controlled Geometric Reorganization in 2…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $\omega_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least…
The culling process in Bootstrap Percolation is Abelian since the final stable configuration does not depend on the details of the updating procedure. An efficient algorithm is devised using this idea for the determination of the bootstrap…
A double percolation transition is identified in a binary network composed of nanoparticles of magnesium diborade superconductor and chromium oxide half-metallic ferromagnet. Anomalously high-resistance or insulating state, as compared to…
Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…
The control of wave scattering in complex non-Hermitian settings is an exciting subject -- often challenging the creativity of researchers and stimulating the imagination of the public. Successful outcomes include invisibility cloaks,…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
Percolation, describing critical behaviors of phase transition in a geometrical context, prompts wide investigations in natural and social networks as a fundamental model. The introduction of quantum-intrinsic interference and tunneling…
The dynamical critical behavior of a single directed line driven in a random medium near the depinning threshold is studied both analytically (by renormalization group) and numerically, in the context of a Flux Line in a Type-II…
This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimensional Hamming torus where each node is open with probability $p$ and the percolation threshold is 2. For each $d'<d$ we find the critical exponent…
Segregation and mixing of granular mixtures during heap formation have important consequences in industry and agriculture. This research investigates three different final particle configurations of bi-disperse granular mixtures --…
Bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at…
Photo-induced switching from the low-spin state to the high-spin state is studied in a model of spin-crossover materials, in which long-range interactions are induced by elastic distortions due to different molecular sizes the two spin…
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…
Many real-world infrastructures, from sensor and road networks to power grids, are spatially embedded and anisotropic, with constraints on the maximum number of links each node can establish. Such systems can be represented as anisotropic…
The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\theta$ starts with a random set of open…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…
We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the…