Related papers: Rigidity percolation on the square lattice
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
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…
A wide range of disordered materials, from biological to geological assemblies, feature discrete elements undergoing large shape changes. How significant geometrical variations at the microscopic scale affect the response of the assembly,…
We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: By simulating oxides with a mixture of 2-coordinated and…
The freezing transition in a classical three-dimensional system of parallel hard cubes with rounded edges is studied by computer simulation and fundamental-measure density functional theory. By switching the rounding parameter s from zero…
We study loop percolation models in two and in three space dimensions, in which configurations of occupied bonds are forced to form closed loop. We show that the uncorrelated occupation of elementary plaquettes of the square and the simple…
We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…
We present some exact results on bond percolation. We derive a relation that specifies the consequences for bond percolation quantities of replacing each bond of a lattice $\Lambda$ by $\ell$ bonds connecting the same adjacent vertices,…
Recent theories predict that when a supercooled liquid approaches the glass transition, particle clusters with a special "amorphous order" nucleate within the liquid, which lead to static correlations dictating the dramatic slowdown of…
For a model of a driven interface in an elastic medium with random obstacles we prove existence of a stationary positive supersolution at non-vanishing driving force. This shows the emergence of a rate independent hysteresis through the…
Two distinct transition points have been observed in a problem of lattice percolation studied using a system of pulsating discs. Sites on a regular lattice are occupied by circular discs whose radii vary sinusoidally within $[0,R_0]$…
Numerical simulations by means of Monte Carlo method and finite-size scaling analysis have been performed to study the percolation behavior of linear $k$-mers (also denoted in the literature as rigid rods, needles, sticks) on…
The ranges of transmission of the mobiles in a Mobile Ad-hoc Network are not uniform in reality. They are affected by the temperature fluctuation in air, obstruction due to the solid objects, even the humidity difference in the environment,…
We study a system of particles in two dimensions interacting via a dipolar long-range potential $D/r^3$ and subject to a square-lattice substrate potential $V({\bf r})$ with amplitude $V$ and lattice constant $b$. The isotropic interaction…
A cascade of phase transitions from square to hexagonal lattice is studied in 2D system of particles interacting via core-softened potential. Due to the presence of two length-scales of repulsion, different local configurations with four,…
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…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…