Related papers: Honeycomb Lattices with Defects
In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
The star-triangle transformation is used to obtain an equivalence extending over the set of all (in)homogeneous bond percolation models on the square, triangular and hexagonal lattices. Among the consequences are box-crossing (RSW)…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We collect together results for bond percolation on various lattices from two to fourteen dimensions which, in the limit of large dimension $d$ or number of neighbors $z$, smoothly approach a randomly diluted Erd\H{o}s-R\'enyi graph. We…
The spontaneous formation of double helices for filaments under torsion is common and significant. For example, the research on the supercoiling of DNA is helpful for understanding the replication and transcription of DNA. Similar double…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
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}),…
I construct a two-dimensional lattice on which the inhomogeneous site percolation threshold is exactly calculable and use this result to find two more lattices on which the site thresholds can be determined. The primary lattice studied…
Recent advances in realizing artificial gauge fields on optical lattices promise experimental detection of topologically non-trivial energy spectra. Self-similar fractal energy structures generally known as Hofstadter butterflies depend…
Certain localised displacement fluctuations in the planar honeycomb lattice may be identified as precursors to topological defects. We show that these fluctuations are among the most pronounced {\em non-affine} distortions of an elemental…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
A complete methodology, based on a two-scale asymptotic approach, that enables the homogenisation of elastic lattices at non-zero frequencies is developed. Elastic lattices are distinguished from scalar lattices in that two or more types of…
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…
An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…
Inspired by the recent creation of the honeycomb optical lattice and the realization of the Mott insulating state in a square lattice by shaking, we study here the shaken honeycomb optical lattice. For a periodic shaking of the lattice, a…
We obtain the exact solution of the bond-percolation thresholds with inhomogenous probabilities on the square lattice. Our method is based on the duality analysis with real-space renormalization, which is a profound technique invented in…
This paper is based on the study of random lozenge tilings of non-convex polygonal regions with interacting non-convexities (cuts) and the corresponding asymptotic kernel as in [3] and [4] (discrete tacnode kernel). Here this kernel is used…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…