Percolation Threshold, Fisher Exponent, and Shortest Path Exponent for 4 and 5 Dimensions
arXiv:cond-mat/0101136 · doi:10.1103/PhysRevE.64.026115
Abstract
We develop a method of constructing percolation clusters that allows us to build very large clusters using very little computer memory by limiting the maximum number of sites for which we maintain state information to a number of the order of the number of sites in the largest chemical shell of the cluster being created. The memory required to grow a cluster of mass s is of the order of bytes where ranges from 0.4 for 2-dimensional lattices to 0.5 for 6- (or higher)-dimensional lattices. We use this method to estimate , the exponent relating the minimum path to the Euclidean distance r, for 4D and 5D hypercubic lattices. Analyzing both site and bond percolation, we find (4D) and (5D). In order to determine to high precision, and without bias, it was necessary to first find precise values for the percolation threshold, : (4D) and (5D) for site and (4D) and (5D) for bond percolation. We also calculate the Fisher exponent, , determined in the course of calculating the values of : (4D) and (5D).
Cited by in corpus (33)
- Percolation on complex networks: Theory and application
- The Relationship of Dynamical Heterogeneity to the Adam-Gibbs and Random First-Order Transition Theories of Glass Formation
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Five loop renormalization of theory with applications to the Lee-Yang edge singularity and percolation theory
- Critical Percolation in High Dimensions
- Phase Transitions in Cooperative Coinfections: Simulation Results for Networks and Lattices
- Gaussian model of explosive percolation in three and higher dimensions
- Ferromagnetic phase transition for the spanning-forest model (q \to 0 limit of the Potts model) in three or more dimensions
- Percolation Thresholds and Fisher Exponents in Hypercubic Lattices
- Scaling behavior of self-avoiding walks on percolation clusters
- Critical percolation clusters in seven dimensions and on a complete graph
- Efficient space virtualisation for Hoshen--Kopelman algorithm
- Walking on fractals: diffusion and self-avoiding walks on percolation clusters
- Precise bond percolation thresholds on several four-dimensional lattices
- On the Aizenman exponent in critical percolation
- Scaling of cluster heterogeneity in percolation transitions
- Asynchronously parallelised percolation on distributed machines
- Logarithmic corrections to scaling in critical percolation and random resistor networks
- Critical exponents and universal excess cluster number of percolation in four and five dimensions
- High-temperature series expansions for the -state Potts model on a hypercubic lattice and critical properties of percolation
- -cluster correlations in four- and five-dimensional percolation
- Logarithmic Corrections in Dynamic Isotropic Percolation
- Fractal Behavior of the Shortest Path Between Two Lines in Percolation Systems
- Explosive percolation in finite dimensions
- Minimal spanning trees at the percolation threshold: a numerical calculation
- Phase diagram of inhomogeneous percolation with a defect plane
- Surface and bulk criticality in midpoint percolation
- Fractal Dimension of 3-Blocks in 4d, 5d, and 6d Percolation Systems
- What are the limits of universality?
- Concentration Gradient, Diffusion, and Flow Through Open Porous Medium Near Percolation Threshold via Computer Simulations
- Field-theoretic Analysis of Dynamic Isotropic Percolation: Three-loop Approximation
- Conjectured Exact Percolation Thresholds of the Fortuin-Kasteleyn Cluster for the +-J Ising Spin Glass Model
- Extended-range percolation in five dimensions