Connective constant explained

In mathematics, the connective constant is a numerical quantity associated with self-avoiding walks on a lattice. It is studied in connection with the notion of universality in two-dimensional statistical physics models.^[1] While the connective constant depends on the choice of lattice so itself is not universal (similarly to other lattice-dependent quantities such as the critical probability threshold for percolation), it is nonetheless an important quantity that appears in conjectures for universal laws. Furthermore, the mathematical techniques used to understand the connective constant, for example in the recent rigorous proof by Duminil-Copin and Smirnov that the connective constant of the hexagonal lattice has the precise value

\sqrt{ 2+ \sqrt{ 2 }} , may provide clues^[2] to a possible approach for attacking other important open problems in the study of self-avoiding walks, notably the conjecture that self-avoiding walks converge in the scaling limit to the Schramm–Loewner evolution.

Definition

The connective constant is defined as follows. Let

c _{n} denote the number of n-step self-avoiding walks starting from a fixed origin point in the lattice. Since every n + m step self avoiding walk can be decomposed into an n-step self-avoiding walk and an m-step self-avoiding walk, it follows that c _{n+m} \leq c _{n} c _{m} . Then by applying Fekete's lemma to the logarithm of the above relation, the limit \mu = \lim _{n} c ^{1 /n} _{n} can be shown to exist. This number \mu is called the connective constant, and clearly depends on the particular lattice chosen for the walk since c _{n} does. The value of \mu is precisely known only for two lattices, see below. For other lattices, \mu has only been approximated numerically. It is conjectured that c _{n} ≈ \mu ^{n} n ^{\gamma} as n goes to infinity, where \mu and A , the critical amplitude, depend on the lattice, and the exponent \gamma , which is believed to be universal and dependent on the dimension of the lattice, is conjectured to be \gamma =43 / 32 .^[3]

Known values

Lattice	Connective constant
Hexagonal	\sqrt{ 2 + \sqrt{ 2 }}\simeq 1 . 85
Triangular	4 . 15079 ( 4 )
Square	2 . 63815853032790 ( 3 )
Kagomé	2 . 56062
Manhattan	1 . 733535 ( 3 )
L-lattice	1 . 5657 ( 15 )
( 3 . 12 ^{2)} lattice	1 . 7110412 ...
( 4 . 8 ^{2)} lattice	1 . 80883001 ( 6 )

These values are taken from the 1998 Jensen–Guttmann paper ^[4] and a more recent paper by Jacobsen, Scullard and Guttmann.^[5] The connective constant of the ( 3 . 12 ^{2)} lattice, since each step on the hexagonal lattice corresponds to either two or three steps in it, can be expressed exactly as the largest real root of the polynomialx ^{12} - 4 x ^{8} - 8 x ^{7} - 4 x ^{6} + 2 x ^{4} + 8 x ^{3} + 12 x ^{2} + 8 x + 2

given the exact expression for the hexagonal lattice connective constant. More information about these lattices can be found in the percolation threshold article.

Duminil-Copin–Smirnov proof

In 2010, Hugo Duminil-Copin and Stanislav Smirnov published the first rigorous proof of the fact that

\mu = \sqrt{ 2 + \sqrt{ 2 }} for the hexagonal lattice. This had been conjectured by Nienhuis in 1982 as part of a larger study of O(n) models using renormalization techniques.^[6] The rigorous proof of this fact came from a program of applying tools from complex analysis to discrete probabilistic models that has also produced impressive results about the Ising model among others.^[7] The argument relies on the existence of a parafermionic observable that satisfies half of the discrete Cauchy–Riemann equations for the hexagonal lattice. We modify slightly the definition of a self-avoiding walk by having it start and end on mid-edges between vertices. Let H be the set of all mid-edges of the hexagonal lattice. For a self-avoiding walk \gamma between two mid-edges a and b , we define \ell(\gamma) to be the number of vertices visited and its winding W _{\gamma} (a,b) as the total rotation of the direction in radians when \gamma is traversed from a to b . The aim of the proof is to show that the partition functionZ(x) = \sum _{\gamma:} x ^{\ell(\gamma)} = \sum ^{inf ty} _{n =0} c _{n} x ^{n}

converges for

x<x _{c} and diverges for x>x _{c} where the critical parameter is given by x _{c=1/} \sqrt{ 2+ \sqrt{ 2 }} . This immediately implies that \mu = \sqrt{ 2+ \sqrt{ 2 }} .

Given a domain

\Omega in the hexagonal lattice, a starting mid-edge a , and two parameters x and \sigma , we define the parafermionic observableF(z) = \sum _{\gamma\subset\Omega:a\to} e ^{- i\sigma W _{\gamma} (a,z)} x ^{\ell(\gamma)} .

If

x = x _{c=1/\sqrt{2} + \sqrt{ 2 }} and \sigma =5 / 8 , then for any vertex v in \Omega , we have(p - v)F(p) + (q - v)F(q) + (r - v)F(r) =0 ,

where

p,q,r are the mid-edges emanating from v . This lemma establishes that the parafermionic observable is divergence-free. It has not been shown to be curl-free, but this would solve several open problems (see conjectures). The proof of this lemma is a clever computation that relies heavily on the geometry of the hexagonal lattice.

Next, we focus on a finite trapezoidal domain

S _{T,L} with 2L cells forming the left hand side, T cells across, and upper and lower sides at an angle of \pm \pi/ 3 . (Picture needed.) We embed the hexagonal lattice in the complex plane so that the edge lengths are 1 and the mid-edge in the center of the left hand side is positioned at -1/2. Then the vertices in S _{T,L} are given byV(S _{T,L} ) = \{ z\in V( H ) : 0 \leq Re(z)\leq (3 T +1)/(2) , |\sqrt{ 3 }Im(z) - Re(z)|\leq 3 L\}.

We now define partition functions for self-avoiding walks starting at

a and ending on different parts of the boundary. Let \alpha denote the left hand boundary, \beta the right hand boundary, \epsilon the upper boundary, and \bar{\epsilon} the lower boundary. LetA ^{x: = \sum} _{\gamma \in S _{T,L} :a\to \alpha\setminus\{a\} } x^,\quad B_^x:=\sum_ x^, \quadE_^x:=\sum_ x^.

By summing the identity

(p - v)F(p) + (q - v)F(q) + (r - v)F(r) =0

over all vertices in

V(S _{T,L} ) and noting that the winding is fixed depending on which part of the boundary the path terminates at, we can arrive at the relation1= \cos( 3 \pi/ 8 ) A ^{x _{c}} _{T,L} + B ^{x _{c}} _{T,L} + \cos(\pi/ 4 ) E ^{x _{c}} _{T,L}

after another clever computation. Letting

L\to inf ty , we get a strip domain S _{T} and partition functionsA ^{x: = \sum} _{\gamma \in S _{T} :a\to \alpha\setminus\{a\} } x^,\quad B_^x:=\sum_ x^, \quadE_^x:=\sum_ x^.

It was later shown that

E ^{x _{c}} _{T,L} =0 , but we do not need this for the proof.^[8] We are left with the relation1= \cos( 3 \pi/ 8 ) A ^{x _{c}} _{T,L} + B ^{x _{c}} _{T,L} .

From here, we can derive the inequality

A ^{x _{c}} _{T +1} - A ^{x _{c}} _{T} \leq x _{c} (B ^{x _{c}} _{T +1} ) ^{2}

And arrive by induction at a strictly positive lower bound for

B ^{x _{c}} _{T} . Since Z(x _{c)\geq\sum} _{T>0} B ^{x _{c}} _{T} =inf ty , we have established that \mu\geq\sqrt{ 2+ \sqrt{ 2 }} .

For the reverse inequality, for an arbitrary self avoiding walk on the honeycomb lattice, we perform a canonical decomposition due to Hammersley and Welsh of the walk into bridges of widths

T _{-I} < … < T _{-1} and T _{0> …} > T _{j} . Note that we can boundB ^{x\leq} _{T} (x/x ^{T} _{c)} B ^{x _{c}} _{T} \leq (x/x ^{T} _{c)}

which implies

\prod _{T>0} ( 1+ B ^{x)< inf ty} _{T} . Finally, it is possible to bound the partition function by the bridge partition functionsZ(x)\leq \sum _{T _{-I} < … < T _{-1} , T _{0> …} > T _{j}} 2 \left(\prod ^{j} _{k =- I} B ^{x\right) =2 \left(\prod} _{T> 0} ( 1+ B ^{x)\right)} _{T} ^{2<infty.}

And so, we have that

\mu = \sqrt{ 2+ \sqrt{ 2 }} as desired.

Conjectures

Nienhuis argued in favor of Flory's prediction that the mean squared displacement of the self-avoiding random walk

\langle |\gamma(n)| ^{2} \rangle satisfies the scaling relation\langle |\gamma(n)| ^{2} \rangle = (1)/(c _{n}) \sum _{n step SAW} |\gamma(n)| ^{2=n} ^{2\nu} ,with \nu =3 / 4 .The scaling exponent \nu and the universal constant 11 / 32 could be computed if the self-avoiding walk possesses a conformally invariant scaling limit, conjectured to be a Schramm–Loewner evolution with \kappa =8 / 3 .^[9]

See also

• Percolation threshold

Notes and References

1. Book: Madras . N. . Slade . G. . 1996 . The Self-Avoiding Walk . Birkhäuser . 978-0-8176-3891-7 .
2. Duminil-Copin . Hugo . Smirnov . Stanislav . 2010 . The connective constant of the honeycomb lattice equals \sqrt{ 2 + \sqrt{ 2 }} . 1007.0575 . math-ph.
3. Vöge . Markus . Guttmann . Anthony J. . 2003 . On the number of hexagonal polyominoes . Theoretical Computer Science . 307 . 2 . 433–453 . 10.1016/S0304-3975(03)00229-9.
4. Jensen . I. . Guttmann . A. J. . 1998 . Self-avoiding walks, neighbor-avoiding walks and trails on semi-regular lattices . Journal of Physics A . 31 . 40 . 8137–45 . 10.1088/0305-4470/31/40/008 . 1998JPhA...31.8137J.
5. Jesper Lykke Jacobsen, Christian R Scullard and Anthony J Guttmann, 2016 J. Phys. A: Math. Theor. 49 494004
6. Nienhuis . Bernard . 1982 . Exact critical point and critical exponents of O(n) models in two dimensions . Physical Review Letters . 49 . 15 . 1062–1065 . 1982PhRvL..49.1062N . 10.1103/PhysRevLett.49.1062.
7. Book: Smirnov . Stanislav . 2010 . Discrete Complex Analysis and Probability . Proceedings of the International Congress of Mathematicians (Hyderabad, India) 2010 . 565–621 . 1009.6077 . 2010arXiv1009.6077S.
8. Smirnov . Stanislav . 2014 . The critical fugacity for surface adsorption of SAW on the honeycomb lattice is 1+ \sqrt{ 2 } . Communications in Mathematical Physics . 326 . 3 . 727–754 . 1109.0358 . 2014CMaPh.326..727B . 10.1007/s00220-014-1896-1. 54799238 .
9. Book: Lawler . Gregory F. . Schramm . Oded . Werner . Wendelin . 2004 . On the scaling limit of planar self-avoiding walk . Lapidus . Michel L. . van Frankenhuijsen . Machiel . Fractal Geometry and Applications: A Jubilee of Benoît Mandelbrot, Part 2: Multifractals, Probability and Statistical Mechanics, Applications . Proceedings of Symposia in Pure Mathematics . 72 . 339–364 . math/0204277 . 2002math......4277L . 10.1090/pspum/072.2/2112127 . 9780821836385 . 2112127. 16710180 .