arXiv subjects

Geoffrey R. Grimmett

Publications and source records attributed to Geoffrey R. Grimmett.

At least 37 records · Page 2Linked to original sources

arXiv2019

Weighted self-avoiding walks

We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height functions', and this permits the study of SAWs with the special property of being bridges. The group structure is relevant in the interaction between the height function and the weight function. The main difficulties arise when the support of the weight function is unbounded, since the corresponding graph is no longer locally finite. There are two principal results, of which the first is a condition under which the weighted connective constant and the weighted bridge constant are equal. When the weight function has unbounded support, we work with a generalized notion of the 'length' of a walk, which is subject to a certain condition. In the second main result, the above equality is used to prove a continuity theorem for connective constants on the space of weight functions endowed with a suitable distance function.

math.CO↗

arXiv2019

On influence and compromise in two-tier voting systems

We examine two aspects of the mathematical basis for two-tier voting systems, such as that of the Council of the European Union. These aspects concern the use of square-root weights and the choice of quota. Square-root weights originate in the Penrose square-root system, which assumes that votes are cast independently and uniformly at random, and is based around the concept of equality of influence of the voters across the Union. There are (at least) two distinct definitions of influence in current use in probability theory, namely, absolute and conditional influence. These are in agreement when the underlying random variables are independent, but not generally. We review their possible implications for two-tier voting systems, especially in the context of the so-called collective bias model. We show that the two square-root laws invoked by Penrose are unified through the use of conditional influence. In an elaboration of the square-root system, Slomczynski and Zyczkowski have proposed an exact value for the quota $q=q^*$ to be achieved in a successful vote of a two-tier system, and they have presented numerical and theoretical evidence in its support. We indicate some numerical and mathematical issues arising in the use of a Gaussian (or normal) approximation in this context, and we propose that other values of $q$ may be as good if not better than $q^*$. We discuss certain aspects of the relationship between theoreticians and politicians in the design of a two-tier voting system, and we reach the conclusion that the choice of quota in the square-root system is an issue for politicians informed by theory.

math.PR↗

arXiv2018

Extendable self-avoiding walks

The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultaneously to a doubly infinite self-avoiding walk. We prove that the connective constants for forward, backward, and doubly extendable self-avoiding walks, denoted respectively by mu^F, mu^B, mu^FB, exist and satisfy mu = mu^F = mu^B = mu^FB for every infinite, locally finite, strongly connected, quasi-transitive directed graph. The proofs rely on a 1967 result of Furstenberg on dimension, and involve two different arguments depending on whether or not the graph is unimodular.

math.CO↗

arXiv2018

Locality of connective constants

The connective constant $μ(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin (and a further condition is satisfied). The proof exploits a generalized bridge decomposition of self-avoiding walks, which is valid subject to the assumption that the underlying graph is quasi-transitive and possesses a so-called unimodular graph height function.

math.CO↗

arXiv2018

Degressive representation of Member States in the European Parliament 2019-2024

Primary law of the European Union demands that the allocation of the seats of the European Parliament between the Member States must obey the principle of degressive proportionality. The principle embodies the political aim that the more populous states agree to be underrepresented in order to allow the less populous states to be better represented. This paper reviews four allocation methods achieving this goal: the Cambridge Compromise, the Power Compromise, the Modified Cambridge Compromise, and the 0.5-DPL Method. After a year of committee deliberations, Parliament decreed on 7 February 2018 an allocation of seats for the 2019 elections that realizes degressive proportionality, but otherwise lacks methodological grounding. The allocation emerged from haggling and bargaining behind closed doors.

physics.soc-ph↗

arXiv2017

Critical surface of the 1-2 model

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 that, when $a \ge b \ge c > 0$, the surface given by $\sqrt a = \sqrt b + \sqrt c$ is critical. The proof hinges upon a representation of the partition function in terms of that of a certain dimer model. This dimer model may be studied via the Pfaffian representation of Fisher, Kasteleyn, and Temperley. It is proved, in addition, that the two-edge correlation function converges exponentially fast with distance when $\sqrt a \ne \sqrt b + \sqrt c$. Many of the results may be extended to periodic models.

math.PR↗

arXiv2016

Connective constants and height functions for Cayley graphs

The connective constant $μ(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective constants, namely, that the connective constants of two graphs are close in value whenever the graphs agree on a large ball around the origin. A condition of the theorem was that the graphs support so-called 'unimodular graph height functions'. When the graphs are Cayley graphs of infinite, finitely generated groups, there is a special type of unimodular graph height function termed here a 'group height function'. A necessary and sufficient condition for the existence of a group height function is presented, and may be applied in the context of the bridge constant, and of the locality of connective constants for Cayley graphs. Locality may thereby be established for a variety of infinite groups including those with strictly positive deficiency. It is proved that a large class of Cayley graphs support unimodular graph height functions, that are in addition harmonic on the graph. This implies, for example, the existence of unimodular graph height functions for the Cayley graphs of finitely generated solvable groups. It turns out that graphs with non-unimodular automorphism subgroups also possess graph height functions, but the resulting graph height functions need not be harmonic. Group height functions, as well as the graph height functions of the previous paragraph, are non-constant harmonic functions with linear growth and an additional property of having periodic differences. The existence of such functions on Cayley graphs is a topic of interest beyond their applications in the theory of self-avoiding walks.

math.CO↗

arXiv2016

The work of Lucio Russo on percolation

The contributions of Lucio Russo to the mathematics of percolation and disordered systems are outlined. The context of his work is explained, and its ongoing impact on current work is described and amplified.

math.PR↗

arXiv2016

Correlation inequalities for the Potts model

Correlation inequalities are presented for ferromagnetic Potts models with external field, using the random-cluster representation of Fortuin and Kasteleyn, together with the FKG inequality. These results extend and simplify earlier inequalities of Ganikhodjaev and Razak, and also of Schonmann, and include GKS-type inequalities when the spin-space is taken as the set of $q$th roots of unity.

math-ph↗

arXiv2016

Critical surface of the hexagonal polygon model

The hexagonal polygon model arises in a natural way via a transformation of the 1-2 model on the hexagonal lattice, and it is related to the high temperature expansion of the Ising model. There are three types of edge, and three corresponding parameters $α,β,γ>0$. By studying the long-range order of a certain two-edge correlation function, it is shown that the parameter space $(0,\infty)^3$ may be divided into subcritical and supercritical regions, separated by critical surfaces satisfying an explicitly known formula. This result complements earlier work on the Ising model and the 1-2 model. The proof uses the Pfaffian representation of Fisher, Kasteleyn, and Temperley for the counts of dimers on planar graphs.

math-ph↗

arXiv2015

Self-avoiding walks and amenability

The connective constant $μ(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the current work. Various properties of connective constants depend on the existence of so-called 'graph height functions', namely: (i) whether $μ(G)$ is a local function on certain graphs derived from $G$, (ii) the equality of $μ(G)$ and the asymptotic growth rate of bridges, and (iii) whether there exists a terminating algorithm for approximating $μ(G)$ to a given degree of accuracy. In the context of amenable groups, it is proved that the Cayley graphs of infinite, finitely generated, elementary amenable groups support graph height functions, which are in addition harmonic. In contrast, the Cayley graph of the Grigorchuk group, which is amenable but not elementary amenable, does not have a graph height function. In the context of non-amenable, transitive graphs, a lower bound is presented for the connective constant in terms of the spectral bottom of the graph. This is a strengthening of an earlier result of the same authors. Secondly, using a percolation inequality of Benjamini, Nachmias, and Peres, it is explained that the connective constant of a non-amenable, transitive graph with large girth is close to that of a regular tree. Examples are given of non-amenable groups without graph height functions, of which one is the Higman group.

math.GR↗

arXiv2015

The 1-2 model

The current paper is a short review of rigorous results for the 1-2 model. 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. It was proposed in a study by Schwartz and Bruck of constrained coding systems, and is strongly connected to the dimer model on a decoration of the lattice, and to an enhanced Ising model and an associated polygon model on the graph derived from the hexagonal lattice by adding a further vertex in the middle of each edge. The general 1-2 model possesses three parameters $a$, $b$, $c$. The fundamental technique is to represent probabilities of interest as ratios of counts of dimer coverings of certain associated graphs, and to apply the Pfaffian method of Kasteleyn, Fisher, and Temperley. Of special interest is the existence (or not) of phase transitions. It turns out that all clusters of the infinite-volume limit are almost surely finite. On the other hand, the existence (with strictly positive probability) of infinite `homogeneous' clusters, containing vertices of given type, depends on the values of the parameters. A further type of phase transition emerges in the study of the two-edge correlation function, and in this case the critical surface may be found explicitly. For instance, when $a \ge b \ge c > 0$, the surface given by $\sqrt a = \sqrt b + \sqrt c$ is critical.

math.PR↗

arXiv2015

Counting self-avoiding walks

The connective constant $μ(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph $G$. Firstly, when $G$ is cubic, we study the effect on $μ(G)$ of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss upper and lower bounds for $μ(G)$ when $G$ is regular. Thirdly, we present strict inequalities for the connective constants $μ(G)$ of vertex-transitive graphs $G$, as $G$ varies. As a consequence of the last, the connective constant of a Cayley graph of a finitely generated group decreases strictly when a new relator is added, and increases strictly when a non-trivial group element is declared to be a generator. Special prominence is given to open problems.

math.CO↗

arXiv2014

The Potts and random-cluster models

This is a short account of connections between the Tutte polynomial and the Ising, Potts, and random-cluster models. The four principal elements are the Ising model of 1925, the Tutte polynomial of 1947, the Potts model of 1952, and the random-cluster model of 1972.

math.CO↗

arXiv2014

Strict inequalities for connective constants of transitive graphs

The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.

math.CO↗

arXiv2014

Criticality, universality, and isoradiality

Critical points and singularities are encountered in the study of critical phenomena in probability and physics. We present recent results concerning the values of such critical points and the nature of the singularities for two prominent probabilistic models, namely percolation and the more general random-cluster model. The main topic is the statement and proof of the criticality and universality of the canonical measure of bond percolation on isoradial graphs (due to the author and Ioan Manolescu). The key technique used in this work is the star--triangle transformation, known also as the Yang--Baxter equation. The second topic reported here is the identification of the critical point of the random-cluster model on the square lattice (due to Beffara and Duminil-Copin), and of the criticality of the canonical measure of the random-cluster model with q \ge 4 on periodic isoradial graphs (by the same authors with Smirnov). The proof of universality for percolation is expected to extend to the random-cluster model on isoradial graphs.

math.PR↗

arXiv2013

Percolation of finite clusters and infinite surfaces

Two related issues are explored for bond percolation on the d-dimensional cubic lattice (with d > 2) and its dual plaquette process. Firstly, for what values of the parameter p does the complement of the infinite open cluster possess an infinite component? The corresponding critical point p_fin satisfies p_fin >= p_c, and strict inequality is proved when either d is sufficiently large, or d >= 7 and the model is sufficiently spread out. It is not known whether d >= 3 suffices. Secondly, for what p does there exist an infinite dual surface of plaquettes? The associated critical point p_surf satisfies p_surf >= p_fin.

math.PR↗

arXiv2013

Universality for bond percolation in two dimensions

All (in)homogeneous bond percolation models on the square, triangular, and hexagonal lattices belong to the same universality class, in the sense that they have identical critical exponents at the critical point (assuming the exponents exist). This is proved using the star-triangle transformation and the box-crossing property. The exponents in question are the one-arm exponent $ρ$, the 2j-alternating-arms exponents $ρ_{2j}$ for $j\ge1$, the volume exponent $δ$, and the connectivity exponent $η$. By earlier results of Kesten, this implies universality also for the near-critical exponents $β$, $γ$, $ν$, $Δ$ (assuming these exist) for any of these models that satisfy a certain additional hypothesis, such as the homogeneous bond percolation models on these three lattices.

math.PR↗