
2
and, interestingly, that the fine statistical properties of
the RP clusters and of the CP clusters share surpris-
ing similarities, despite belonging to distinct universality
classes.
Model and Methods – We perform three independent
numerical tests of conformal invariance, based on the
study of a geometrical property of the random rigid clus-
ters, their so-called n−point connectivity [26]:
p12···n(z1,··· , zn)def
= Prob [z1,··· , zn∈ RC].(1)
ziare points in the two-dimensional space and RC de-
notes a rigid cluster. (1) gives therefore the probability
that npoints are connected by paths inside the same rigid
cluster. These quantities have been very useful to un-
derstand connectivity percolation [27–31]. We make the
central assumption that, in the scaling limit, the connec-
tivities (1) can be described by a field theory, and more
precisely that they are given by correlation functions of a
scaling field that we denote Φc, of scaling dimension ∆c:
p12···n(z1,··· , zn)scaling
→
lim.a(n)
0hΦc(z1)···Φc(zn)i(2)
where a(n)
0is a non-universal constant that depends on
the microscopic details of the model.
When present, conformal symmetry constrains the
form of correlations, hence of the connectivities, in a pre-
cise way. In this work we use a lattice model of rigid-
ity percolation to measure numerically certain rigid clus-
ter connectivities on specific geometries. Using (2) gives
the corresponding CFT predictions for these probabili-
ties, which we can compare with the measurements. The
Geometr ic percolation Rigidity percolation
(a) (b)
Rigid cluster
Liquid Solid
(c)
FIG. 1. Examples of site-diluted triangular lattice configura-
tions showing connectivity percolation transition (a) at pCP
c
for which the system is macroscopically liquid. (b) Rigid clus-
ter decomposition where red particles belong to the largest
rigid cluster obtained via constraints counting analysis (peb-
ble game) and (c) macroscopic rigidity percolation transition
at pRP
cexhibiting a percolating rigid cluster in the two direc-
tions able to sustain external loads.
model is a site-diluted triangular lattice with local spatial
correlations. It has been recently introduced to model
the rigidity percolation of soft solids [22]. At each step,
particles are drawn randomly one by one to populate a
doubly-periodic triangular lattice of size L1×L2, accord-
ing to the following probability p= (1 −c)6−Nn, where
c∈[0,1[ represents the degree of correlation and Nnis
the number of nearest filled sites varying between 0 to
6 for fully occupied neighboring sites. Since the filling
probability depends only on the degree of occupation of
the first neighbors, the introduced correlations are local
and in the limit of c= 0 we recover the classical uncorre-
lated random percolation where all particles has the same
filling probability. In practice, the larger cthe smallest is
the critical probability threshold pRP
c(equivalently crit-
ical volume fraction) which yields to macroscopic finite
elasticity. These correlations are irrelevant and the large-
scale behaviour is unaffected by the value of c, so that
the transition still belongs to the same universality class
as classical uncorrelated RP [22]. In practice we used
c= 0.3 at which pRP
c(c= 0.3) ∼0.66.
To identify rigid clusters on a discrete lattice, we
use the so-called ’Pebble game’, a fast combinatory
algorithm[25, 32]. It is based on Laman’s theorem
for graphs’ rigidity, which uses Maxwell’s constraint
counting argument for each subgraph to detect over-
constrained clusters highlighting rigidity [33]. Figure 1
shows an example of cluster decomposition while increas-
ing p. Connectivity percolation arises at pCP
cand is
characterized by a space-spanning percolating cluster (in
blue). The system is macroscopically liquid and cannot
sustain external loads. Figure 1b and 1c show the largest
rigid cluster (in red) that percolates at pRP
c> pCP
c, lead-
ing to macroscopic elasticity.
In the following, we analyse the statistical properties of
the rigid clusters at the critical point. We first obtain
a direct measurement of the anomalous dimension expo-
nent η, then move on to test conformal invariance, using
the 3-point and 2-point connectivities. Finally we high-
light the similarities with CP in the structure of these
functions.
Anomalous dimension – We measure the 2-point con-
nectivity p12(r, θ) on the lattice, ie the probability that
points (i, j) and (i+rcos(θ+π/3), j +rsin(θ+π/3))
are in the same rigid cluster. θis the angle wrt the
short cycle of the doubly-periodic lattice, and rthe dis-
tance between the two points. We use translation in-
variance to average over the L1×L2positions (i, j), as
well as symmetry by reflection about θ= 0, so that p12
is an average over 2L1L2Nmeasurements with Nthe
number of samples (N= 1200 for the largest sizes).
The inset in figure 3 shows the data points in log-log
scale which follow a power law in the scaling region
1rL2/2. This is expected from scale invari-
ance, namely that for points separation 1 z12 L2,
the 2-point connectivity decays as p12(z1, z2)∼ |z12|−η,
where ηis the so-called anomalous dimension, satisfy-
ing the hyperscaling relations η= 2β/ν = 4 −2df[34].
Using assumption (2) and that hΦc(z1)Φc(z2)i=z−2∆c
12
[35], gives the scaling dimension of Φcas ∆c=η/2.
Expected deviations in the region r∼L2/2 are due
to universal finite size effects coming from the doubly-
periodic boundary conditions. Fitting the data points
corresponding to the angle that minimises such effects