Related papers: Iterative Site Percolation on Triangular Lattice
Mixed-wet percolation was introduced recently in the context of two-phase flow in porous media. In this model, the sites of the primal lattice are occupied with a certain probability $p$, and bonds are placed on the dual lattice between two…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here…
In the ordered phase of the 3D Ising model, minority spin clusters are surrounded by a boundary of dual plaquettes. As the temperature is raised, these spin clusters become more numerous, and it is found that eventually their boundaries…
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two $k$-cliques means that they share at least $l<k$ vertices. In this paper, we develop a theoretical…
I construct a two-dimensional lattice on which the inhomogeneous site percolation threshold is exactly calculable and use this result to find two more lattices on which the site thresholds can be determined. The primary lattice studied…
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…
To establish the bond-site duality of explosive percolations in 2 dimension, the site and bond explosive percolation models are carefully defined on a square lattice. By studying the cluster distribution function and the behavior of the…
Phase transition of the Ising model is investigated on a planar lattice that has a fractal structure. On the lattice, the number of bonds that cross the border of a finite area is doubled when the linear size of the area is extended by a…
When a finite volume of an etching solution comes in contact with a disordered solid, a complex dynamics of the solid-solution interface develops. Since only the weak parts are corroded, the solid surface hardens progressively. If the…
We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…
Rigidity percolation provides an important basis for understanding the onset of mechanical stability in disordered materials. While most studies on the triangular lattice have focused on static properties at fixed bond~(site) occupation…
This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…
Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactions, implying that nodes can merge into clusters only if they…
The asymptotic behavior of the percolation threshold $p_c$ and its dependence upon coordination number $z$ is investigated for both site and bond percolation on four-dimensional lattices with compact extended neighborhoods. Simple…
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…