Related papers: Percolation in high dimensions is not understood
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…
The basic notion of percolation in physics assumes the emergence of a giant connected (percolation) cluster in a large disordered system when the density of connections exceeds some critical value. Until recently, the percolation phase…
We examine the effects of introducing a wall or edge into a directed percolation process. Scaling ansatzes are presented for the density and survival probability of a cluster in these geometries, and we make the connection to surface…
The diffusive transport in two-dimensional incompressible turbulent fields is investigated with the aid of high-quality direct numerical simulations. Three classes of turbulence spectra that are able to capture both short and long-range…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
The percolation of Kandel, Ben-Av and Domany clusters for 2d fully frustrated Ising model is extensively studied through numerical simulations. Critical exponents, cluster distribution and fractal dimension of percolative cluster are given.
We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…
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…
We show that only considering the largest cluster suffices to obtain a first-order percolation transition. As opposed to previous realizations of explosive percolation our models obtain Gaussian cluster distributions and compact clusters as…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…
The frequency dependence of the Raman coupling coefficient $C(\omega)$ is calculated numerically for square and cubic percolation clusters. No general scaling law in terms of the macroscopic parameters such as the fractal dimension $D$ or…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…
The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold Pc=1/2. The calculated probabilities for free boundary…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
An exact formula is given for the probability that there exists a spanning cluster between opposite boundaries of an annulus, in the scaling limit of critical percolation. The entire distribution function for the number of distinct spanning…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
The partition function of the finite $1+\epsilon$ state Potts model is shown to yield a closed form for the distribution of clusters in the immediate vicinity of the percolation transition. Various important properties of the transition are…
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
We consider the effects of spatial correlations in a two-dimensional site percolation model. By generalizing the Newman-Ziff Monte Carlo algorithm to include spatial correlations, percolation thresholds and fractal dimensions of percolation…