Site percolation and random walks on d-dimensional Kagomé lattices
@article{Marck1998SitePA, title={Site percolation and random walks on d-dimensional Kagom{\'e} lattices}, author={Steven van der Marck}, journal={Journal of Physics A}, year={1998}, volume={31}, pages={3449-3460} }
The site percolation problem is studied on d-dimensional generalizations 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 percolation thresholds are calculated numerically for d=3, 4, 5, and 6. The scaling of these thresholds as a function of dimension d, or alternatively q, is different than for hypercubic lattices: instead of . The latter is the Bethe approximation, which is usually…
Figures and Tables from this paper
16 Citations
Bond percolation on simple cubic lattices with extended neighborhoods.
- PhysicsPhysical review. E
- 2020
The results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number z quite accurately according to a power-law p_{c}∼z^{-a} with exponent a=1.111.
Precise bond percolation thresholds on several four-dimensional lattices
- PhysicsPhysical Review Research
- 2020
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),…
Percolation threshold of a simple cubic lattice with fourth neighbors: the theory and numerical calculation with parallelization
- Physics
- 2013
The method of nding a percolation threshold xc of innite lattice in the problem of nodes is proposed. Theoretically was shown that curves of conditional probability of percolation of nite lattices…
An Investigation of Site-Bond Percolation on Many Lattices
- Computer Science
- 1999
It is shown here that there are strong deviations from the known approximate equations in the line of threshold values, and an alternative parametrization is proposed that lies much closer to the numerical values.
Calculation of Percolation Thresholds in High Dimensions for FCC, BCC and Diamond Lattices
- Materials Science
- 1998
Site and bond percolation thresholds are calculated for the face centered cubic, body centered cubic and diamond lattices in four, five and six dimensions. The results are used to study the behavior…
On the number of spanning trees on various lattices
- Mathematics
- 2010
We consider the number of spanning trees in lattices; for a lattice , one defines the bulk limit , where NST(G) is the number of spanning trees in a finite section G of . Explicit values for are…
Observation of flat band, RKKY plateau, and magnetization jump in quasi-one-dimensional triangular kagome lattice model
- Physics
- 2020
Inspired by the research interest on the realization of flatbands and magnetization plateaus in kagome lattices, herein we study the electronic properties and exchange magnetic interactions in…
Using a Dynamic Point-Source Percolation Model to Simulate Bubble Growth
- Materials Science, Physics
- 2004
Accurate modeling of nucleation, growth and clustering of helium bubbles within metal tritide alloys is of high scientific and technological importance. Of interest is the ability to predict both the…
Efficient space virtualisation for Hoshen-Kopelman algorithm
- Computer ScienceInternational Journal of Modern Physics C
- 2019
The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites' neighbourhoods containing next-next-nearest neighbours (3NN).
Soft modes and elasticity of nearly isostatic lattices: randomness and dissipation.
- PhysicsPhysical review letters
- 2010
The coherent potential approximation (CPA) is used to study how the random addition, with probability P=(z-4)/4 (z=average number of contacts), of next-nearest-neighbor (NNN) springs restores rigidity and affects phonon structure.
References
SHOWING 1-10 OF 23 REFERENCES
Bond percolation processes in d dimensions
- Mathematics
- 1978
The authors study bond percolation processes on a d-dimensional simple hypercubic lattice. Exact expansions for the mean number of clusters, K(p), and the mean cluster size, S(p), in powers of 1/…
Exact Critical Percolation Probabilities for Site and Bond Problems in Two Dimensions
- Mathematics
- 1964
An exact method for determining the critical percolation probability, pc, for a number of two‐dimensional site and bond problems is described. For the site problem on the plane triangular lattice pc…
Random walks on diamond and hexagonal close packed lattices
- Mathematics
- 1978
Abstract Random walks on the diamond (dia.) and the hexagonal close packed (h.c.p.) lattices are discussed in terms of random walk generating functions for non-Bravais lattices composed of two…
Percolation processes in d-dimensions
- Physics
- 1976
Series data for the mean cluster size for site mixtures on a d-dimensional simple hypercubical lattice are presented. Numerical evidence for the existence of a critical dimension for the cluster…
Universal formulas for percolation thresholds.
- PhysicsPhysical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
- 1996
A power law is postulated for both site and bond percolation thresh- olds and is found to be also valid for Ising critical temperatures.
Determination of the bond percolation threshold for the Kagomé lattice
- Materials Science
- 1997
The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagome lattice (and its dual, the dice lattice). For this system, the hull walk is…
Numerical studies of critical percolation in three dimensions
- Physics
- 1992
Presents results of high-statistics simulations of the spreading of 3D percolation close to the critical point. The main results are: (i) a more precise estimate of the spreading (resp. 'chemical…
The efficient determination of the percolation threshold by a frontier-generating walk in a gradient
- Physics
- 1986
The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. The existence of the gradient permits one to generate an infinite walk on a computer of finite…
On Polya random walks, lattice Green functions, and the bond percolation threshold
- Mathematics
- 1983
Based on numerical evidence, the authors conjecture a connection between the bond percolation threshold of Bravais lattices in three or more dimensions and the value at the origin of a lattice Green…
Introduction To Percolation Theory
- Physics
- 1985
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in…