相关论文: Percolation thresholds of randomly rotating patchy…
The site percolation thresholds p_c are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results p_c = 0.697043, honeycomb or (6^3), 0.807904 (3,12^{2}),…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
We use a recently developed lattice model to study the percolation of particles of different sizes and shapes in the presence of a polymer matrix. The polymer is modeled as an infinitely long semiflexible chain. We study the effects of the…
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
The preparation of many composites requires the intermixing of several macromolecular fluids along with the addition of solid filler particles. These fillers are usuallly polydisperse and there is an extensive experimental evidence that…
We determine thresholds $p_c$ for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their complex combinations. There are 31 distinct…
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 present percolation thresholds calculated numerically with the eigenvalue formulation of the method of critical polynomials; developed in the last few years, it has already proven to be orders of magnitude more accurate than traditional…
Powdered materials of sizes ranging from nanometers to microns are widely used in materials science and are carefully selected to enhance the performance of a matrix. Fillers have been used in order to improve, among the others, mechanical,…
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N$^2$), next nearest neighbors (N$^3$), next next nearest…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…
We investigate the structural and thermodynamic properties of a model of particles with $2$ patches of type $A$ and $10$ patches of type $B$. Particles are placed on the sites of a face centered cubic lattice with the patches oriented along…
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…
We explore the behavior of two-dimensional patchy colloidal particles with 8 or 10 symmetrically arranged patches by employing Monte-Carlo simulations. The particles interact according to an isotropic pair potential that possesses only one…
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)…
Maximum-density dimer packings (maximum matchings) of non-bipartite site-diluted lattices, such as the triangular and Shastry-Sutherland lattices in $d=2$ dimensions and the stacked-triangular and corner-sharing octahedral lattices in…
We study site percolation on a square lattice with random compact diamond-shaped neighborhoods. Each site $s$ is connected to others within a neighborhood in the shape of a diamond of radius $r_s$, where $r_s$ is uniformly chosen from the…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
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…