Related papers: Iterative Site Percolation on Triangular Lattice
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
We study a generalization of site percolation on a simple cubic lattice, where not only single sites are removed randomly, but also entire parallel columns of sites. We show that typical clusters near the percolation transition are very…
When a finite volume of etching solution is in contact with a disordered solid, complex dynamics of the solid-solution interface develop. If the etchant is consumed in the chemical reaction, the dynamics stop spontaneously on a self-similar…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…
The Ising model at inverse temperature $\beta$ and zero external field can be obtained via the Fortuin-Kasteleyn (FK) random-cluster model with $q=2$ and density of open edges $p=1-e^{-\beta}$ by assigning spin +1 or -1 to each vertex in…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
We study random coloring of the hexagons of a honeycomb lattice into $2^{n-1}$ colors (that is the standard Potts model at infinite temperature). It may be considered as a generalization of percolation to $n$ pairwise independent, but…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
We study site- and bond-percolation on a class of lattices referred to as Lieb lattices. In two dimensions the Lieb lattice (LL) is also known as the decorated square lattice, or as the CuO$_2$ lattice; in three dimensions it can be…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
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…
In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…
Extensive Monte-Carlo simulations were performed to evaluate the excess number of clusters and the crossing probability function for three-dimensional percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered…