Related papers: Critical surfaces for general inhomogeneous bond p…
We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…
We studied the rigidity percolation (RP) model for aperiodic (quasi-crystal) lattices. The RP thresholds (for bond dilution) were obtained for several aperiodic lattices via computer simulation using the "pebble game" algorithm. It was…
In this paper we present the proof of the convergence of the critical bond percolation exploration process on the square lattice to the trace of SLE$_{6}$. This is an important conjecture in mathematical physics and probability. The case of…
A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…
We have derived long series expansions of the percolation probability for site, bond and site-bond percolation on the directed triangular lattice. For the bond problem we have extended the series from order 12 to 51 and for the site problem…
The 1-2 model on the hexagonal lattice is a model of statistical mechanics in which each vertex is constrained to have degree either $1$ or $2$. There are three types of edge, and three corresponding parameters $a$, $b$, $c$. It is proved…
We study mixed site-bond directed percolation on 2D and 3D lattices by using time-dependent simulations. Our results are compared with rigorous bounds recently obtained by Liggett and by Katori and Tsukahara. The critical fractions…
The aim of this paper is to explore possible ways of extending Smirnov's proof of Cardy's formula for critical site-percolation on the triangular lattice to other cases (such as bond-percolation on the square lattice); the main question we…
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…
We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…
We study the percolation of randomly rotating patchy particles on $11$ Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there…
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…
In previous work with Scullard, we defined a graph polynomial P_B(q,T) that gives access to the critical temperature T_c of the q-state Potts model on a general two-dimensional lattice L. It depends on a basis B, containing n x m unit cells…
We consider the problem of counting the number of 3-colourings of the edges (bonds) of the 4-8 lattice and the 3-12 lattice. These lattices are Archimedean with coordination number 3, and can be regarded as decorated versions of the square…
In 1991 Aizenman and Grimmett claimed that any `essential enhancement' of site or bond percolation on a lattice lowers the critical probability, an important result with many implications, such as strict inequalities between critical…
We determine the site and bond percolation thresholds for a system of disordered jammed sphere packings in the maximally random jammed state, generated by the Torquato-Jiao algorithm. For the site threshold, which gives the fraction of…
We study percolation in the following random environment: let $Z$ be a Poisson process of constant intensity in the plane, and form the Voronoi tessellation of the plane with respect to $Z$. Colour each Voronoi cell black with probability…
We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…