Related papers: Percolation in Finite Matching Lattices
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…
Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
The shape-dependent universality of the excess percolation cluster number and cross-configuration probability on a torus is discussed. Besides the aspect ratio of the torus, the universality class depends upon the twist in the periodic…
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at or near critical external fields. The incipient infinite cluster (IIC) measure in the sense of Kesten is constructed. As a…
We theoretically investigate the quantum percolation problem on Lieb lattices in two and three dimensions. We study the statistics of the energy levels through random matrix theory, and determine the level spacing distributions, which, with…
The theoretical basis of continuum percolation has changed greatly since its beginning as little more than an analogy with lattice systems. Nevertheless, there is yet no comprehensive theory of this field. A basis for such a theory is…
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the…
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx…
We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability $x_A$ of choosing an A…
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…
We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…
Consider critical Bernoulli percolation on $\mathbb{Z}^d$ for $d$ large; let $y_0, \dots, y_{k-1}$ be $k$ distinct points in $\mathbb{R}^d$. We prove that the probability that $\{\lfloor n y_i\rfloor\}_{i=0}^{k-1}$ all lie in the same open…
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.
In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning…
We study the two-dimensional domain morphology of twisted nematic liquid crystals during their phase-ordering kinetics [R. A. L. Almeida, Phys. Rev. Lett. 131 (2023) 268101], which is a physical candidate to self-generate critical clusters…
I report on the experimental confirmation that critical percolation statistics underlie the ordering kinetics of twisted nematic phases in the Allen-Cahn universality class. Soon after the ordering starts from a homogeneous disordered phase…