Related papers: Percolation on Growing Lattices
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…
Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.
We consider a percolation model on square lattices with sites weighted by beta-distributed random variables $S\sim \mathrm{Beta}(a,b)$ with a positive real parameters $a>0$ and $b>0$. Using the Monte Carlo method, we estimate the…
Tissue growth underpins a wide array of biological and developmental processes, and numerical modeling of growing systems has been shown to be a useful tool for understanding these processes. However, the phenomena that can be captured are…
We study non-uniform percolation in a two-dimensional cluster growth model with multiple seeds. With increasing concentration of seeds, the percolation threshold is found to increase monotonically, while the exponents for correlation…
During the last decade, lattice-Boltzmann (LB) simulations have been improved to become an efficient tool for determining the permeability of porous media samples. However, well known improvements of the original algorithm are often not…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
We investigate percolation in the Boolean model with convex grains in high dimension. For each dimension d, one fixes a compact, convex and symmetric set K $\subset$ R d with non empty interior. In a first setting, the Boolean model is a…
In this paper I describe the computer simulations that I have performed to critically examine the Lauritzen-Hoffman and the Sadler-Gilmer theories of polymer crystallization. In particular, I have computed the free energy profile for…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…
We consider a dependent percolation model on the square lattice $\mathbb{Z}^2$. The range of dependence is infinite in vertical and horizontal directions. In this context, we prove the existence of a phase transition. The proof exploits a…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
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,…
The process of liquid silicon infiltration is investigated for channels with radii from $0.25$ to $0.75$ [mm] drilled in compact carbon preforms. The advantage of this setup is that the study of the phenomenon results to be simplified. For…
High-density (HD) percolation describes the percolation over specific $\kappa$ -clusters, which are the compact sets of sites each connected to $\kappa$ nearest filled sites at least. It takes place in the classical patterns of…
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and…
Two distinct distribution functions $P_{sp}(m)$ and $P_{ns}(m)$ of the scaled largest cluster sizes $m$ are obtained at the percolation threshold by numerical simulations, depending on the condition whether the lattice is actually spanned…