相关论文: Dimer percolation and jamming on simple cubic latt…
We determine the dimensional dependence of the percolative exponents of the jamming transition via numerical simulations in four and five spatial dimensions. These novel results complement literature ones, and establish jamming as a mixed…
We have looked into an experiment that has been termed the ``canonical example'' of jamming: granular material, clogging the outlet of a container as it is discharged by gravity. We present quantitative data of such an experiment. The…
We determine thresholds $p_c$ for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN)…
The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds $p_c$ for…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours…
We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…
Numerical simulations and finite-size scaling analysis have been carried out to study standard and inverse percolation of straight rigid rods on triangular lattices. In the case of standard (inverse) percolation, the lattice is initially…
In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the…
We extend the method of Balister, Bollob\'as and Walters for determining rigorous confidence intervals for the critical threshold of two dimensional lattices to three (and higher) dimensional lattices. We describe a method for determining a…
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose…
In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold $p_c$ and the strength of percolation clusters $P_\infty$ for a square lattice with $(1,…
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 problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…
In this paper we compute the square lattice random sites percolation thresholds in case when sites from the 4th and the 5th coordination shells are included for neighbourhood. The obtained results support earlier claims, that (a) the…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
In this paper we consider independent site percolation in a triangulation of $\mathbb{R}^2$ given by adding $\sqrt{2}$-long diagonals to the usual graph $\mathbb{Z}^2$. We conjecture that $p_c=\frac{1}{2}$ for any such graph, and prove it…
The jamming and percolation for two generalized models of random sequential adsorption (RSA) of linear $k$-mers (particles occupying $k$ adjacent sites) on a square lattice are studied by means of Monte Carlo simulation. The classical…