Efficient space virtualisation for Hoshen--Kopelman algorithm
arXiv:1803.09504 · doi:10.1142/S0129183119500554
Abstract
In this paper the efficient space virtualisation for Hoshen--Kopelman algorithm is presented. We observe minimal parallel overhead during computations, due to negligible communication costs. 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). The obtained percolation thresholds are , , , , , , , where 2NN and NN stand for next-nearest neighbours and nearest neighbours, respectively.
References in corpus (20)
- A fast Monte Carlo algorithm for site or bond percolation
- Recent advances in percolation theory and its applications
- Critical Percolation in High Dimensions
- Measures of critical exponents in the four dimensional site percolation
- Simple cubic random-site percolation thresholds for complex neighbourhoods
- Percolation Threshold, Fisher Exponent, and Shortest Path Exponent for 4 and 5 Dimensions
- Calculation of percolation thresholds in high dimensions for fcc, bcc, and diamond lattices
- Explosive site percolation and finite size hysteresis
- Quantum percolation and transition point of a directed discrete-time quantum walk
- Percolation Thresholds and Fisher Exponents in Hypercubic Lattices
- Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors
- Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations
- Superconductor-insulator transition in a network of 2d percolation clusters
- Site percolation and random walks on d-dimensional Kagome lattices
- Percolation Thresholds in Hyperbolic Lattices
- Spatial competition of the ground states in 1111 iron pnictides
- Dimer Covering and Percolation Frustration
- Re-examination of seven-dimensional site percolation thresholds
- The first-principles study of thermodynamical properties of random magnetic overlayers on fcc-Cu(001) substrate
- Method for estimating critical exponents in percolation processes with low sampling
Cited by in corpus (18)
- Percolation on complex networks: Theory and application
- Site percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit
- Universal behavior of site and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in 2 and 3 dimensions
- Critical polynomials in the nonplanar and continuum percolation models
- Bond percolation on simple cubic lattices with extended neighborhoods
- Noise induced unanimity and disorder in opinion formation
- Precise bond percolation thresholds on several four-dimensional lattices
- Percolation thresholds on triangular lattice for neighbourhoods containing sites up-to the fifth coordination zone
- Site percolation thresholds on triangular lattice with complex neighborhoods
- Site and bond percolation on four-dimensional simple hypercubic lattices with extended neighborhoods
- Vanishing opinions in Latané model of opinion formation
- Random site percolation on honeycomb lattices with complex neighborhoods
- Spreading processes in "post-epidemic" environments
- Thermal properties of structurally balanced systems on classical random graphs
- Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
- Percolation thresholds on high dimensional and dense packing lattices
- Spreading processes in "post-epidemic" environments. II. Safety patterns on scale-free networks
- Extended-range percolation in five dimensions