Dimer Covering and Percolation Frustration
arXiv:1507.04411 · doi:10.1103/PhysRevE.92.032134
Abstract
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by non-overlapping dimers has not evidently been considered. Here, we propose a novel procedure for generating random dimer coverings of a given lattice. We then compute the bond percolation threshold on random and ordered coverings of the square and the triangular lattice, on the remaining bonds connecting the dimers. We obtain and for random coverings of the square and the triangular lattice, respectively. We observe that the percolation frustration induced as a result of dimer covering is larger in the low-coordination-number square lattice. There is also no relationship between the existence of long-range order in a covering of the square lattice, and its percolation threshold. In particular, an ordered covering of the square lattice, denoted by shifted covering in this work, has an unusually low percolation threshold, and is topologically identical to the triangular lattice. This is in contrast to the other ordered dimer coverings considered in this work, which have higher percolation thresholds than the random covering. In the case of the triangular lattice, the percolation thresholds of the ordered and random coverings are very close, suggesting the lack of sensitivity of the percolation threshold to microscopic details of the covering in highly-coordinated networks.
arXiv comment11 pages, 7 figures
References in corpus (29)
- A fast Monte Carlo algorithm for site or bond percolation
- Disordered, Quasicrystalline and Crystalline Phases of Densely Packed Tetrahedra
- Precise determination of the bond percolation thresholds and finite-size scaling corrections for the s.c., f.c.c., and b.c.c. lattices
- Relaxation time for a dimer covering with height representation
- Jamming Percolation and Glass Transitions in Lattice Models
- Phase Diagram of Hard Tetrahedra
- Percolation and jamming in random sequential adsorption of linear segments on square lattice
- Square lattice site percolation at increasing ranges of neighbor interactions
- Four-tap shift-register-sequence random-number generators
- Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
- Convergence of threshold estimates for two-dimensional percolation
- Percolation of linear -mers on square lattice: from isotropic through partially ordered to completely aligned state
- Calculation of percolation thresholds in high dimensions for fcc, bcc, and diamond lattices
- Degenerate Quasicrystal of Hard Triangular Bipyramids
- A Monte-Carlo Analysis of Percolation of Line-Segments on a Square Lattice
- Determination of the bond percolation threshold for the Kagome lattice
- Percolation thresholds on 2D Voronoi networks and Delaunay triangulations
- Glassy Dislocation Dynamics in 2-D Colloidal Dimer Crystals
- Estimation of Bond Percolation Thresholds on the Archimedean Lattices
- Correction-to-scaling exponent for two-dimensional percolation
- Restricted Dislocation Motion in Crystals of Colloidal Dimer Particles
- Percolation of the aligned dimers on a square lattice
- Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors
- Percolation of overlapping squares or cubes on a lattice
- Critical surfaces for general inhomogeneous bond percolation problems
- The critical manifolds of inhomogeneous bond percolation on bow-tie and checkerboard lattices
- Percolation in Networks with Voids and Bottlenecks
- Percolation thresholds on planar Euclidean relative neighborhood graphs
- Percolation thresholds on 3-dimensional lattices with 3 nearest neighbors