Geoffrey R. Grimmett

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2025 J jnl
Hyperbolic Site Percolation.
Random Struct. Algorithms
Geoffrey R. Grimmett, Zhongyang Li
2024 J jnl
Percolation critical probabilities of matching lattice-pairs.
Random Struct. Algorithms
Geoffrey R. Grimmett, Zhongyang Li
2020 J jnl
Cubic graphs and the golden mean.
Discret. Math.
Geoffrey R. Grimmett, Zhongyang Li
2019 J jnl
On influence and compromise in two-tier voting systems.
Math. Soc. Sci.
Geoffrey R. Grimmett
2018 J jnl
Locality of connective constants.
Discret. Math.
Geoffrey R. Grimmett, Zhongyang Li
2017 J jnl
Self-Avoiding Walks and Amenability.
Electron. J. Comb.
Geoffrey R. Grimmett, Zhongyang Li
2015 J jnl
Bounds on connective constants of regular graphs.
Comb.
Geoffrey R. Grimmett, Zhongyang Li
2014 J jnl
Strict Inequalities for Connective Constants of Transitive Graphs.
SIAM J. Discret. Math.
Geoffrey R. Grimmett, Zhongyang Li
2013 J jnl
Self-Avoiding Walks and the Fisher Transformation.
Electron. J. Comb.
Geoffrey R. Grimmett, Zhongyang Li
2012 J jnl
A power-weighted variant of the EU27 Cambridge Compromise.
Math. Soc. Sci.
Geoffrey R. Grimmett, Kai-Friederike Oelbermann, Friedrich Pukelsheim
2012 J jnl
European apportionment via the Cambridge Compromise.
Math. Soc. Sci.
Geoffrey R. Grimmett
2010 J jnl
Percolation of arbitrary words in one dimension.
Random Struct. Algorithms
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer
2010 J jnl
Random graphs with forbidden vertex degrees.
Random Struct. Algorithms
Geoffrey R. Grimmett, Svante Janson
2009 J jnl
Random Even Graphs.
Electron. J. Comb.
Geoffrey R. Grimmett, Svante Janson
2004 J jnl
Negative association in uniform forests and connected graphs.
Random Struct. Algorithms
Geoffrey R. Grimmett, Stephan N. Winkler
2004 J jnl
Stochastic Apportionment.
Am. Math. Mon.
Geoffrey R. Grimmett
2003 J jnl
On smallest triangles.
Random Struct. Algorithms
Geoffrey R. Grimmett, Svante Janson
2001 J jnl
Infinite paths in randomly oriented lattices.
Random Struct. Algorithms
Geoffrey R. Grimmett
1986 J jnl
An exact threshold theorem for random graphs and the node-packing problem.
J. Comb. Theory B
Geoffrey R. Grimmett
1985 J jnl
The shortest-path problem for graphs with random arc-lengths.
Discret. Appl. Math.
Alan M. Frieze, Geoffrey R. Grimmett
1976 J jnl
An upper bound for the number of spanning trees of a graph.
Discret. Math.
Geoffrey R. Grimmett