We stand with Ukraine  

Geoffrey R. Grimmett

Orcid: 0000-0001-7646-3368

Affiliations:
  • University of Cambridge, UK


According to our database1, Geoffrey R. Grimmett authored at least 20 papers between 1976 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Hyperbolic Site Percolation.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Random Struct. Algorithms, January, 2025

2020
Cubic graphs and the golden mean.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Discret. Math., 2020

2019
On influence and compromise in two-tier voting systems.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
Math. Soc. Sci., 2019

2018
Locality of connective constants.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Discret. Math., 2018

2017
Self-Avoiding Walks and Amenability.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Electron. J. Comb., 2017

2015
Bounds on connective constants of regular graphs.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Comb., 2015

2014
Strict Inequalities for Connective Constants of Transitive Graphs.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
SIAM J. Discret. Math., 2014

2013
Self-Avoiding Walks and the Fisher Transformation.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Zhongyang Li
Electron. J. Comb., 2013

2012
A power-weighted variant of the EU27 Cambridge Compromise.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Kai-Friederike Oelbermann
,
Friedrich Pukelsheim
Math. Soc. Sci., 2012

European apportionment via the Cambridge Compromise.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
Math. Soc. Sci., 2012

2010
Percolation of arbitrary words in one dimension.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Thomas M. Liggett
,
Thomas Richthammer
Random Struct. Algorithms, 2010

Random graphs with forbidden vertex degrees.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Svante Janson
Random Struct. Algorithms, 2010

2009
Random Even Graphs.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Svante Janson
Electron. J. Comb., 2009

2004
Stochastic Apportionment.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
Am. Math. Mon., 2004

Negative association in uniform forests and connected graphs.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Stephan N. Winkler
Random Struct. Algorithms, 2004

2003
On smallest triangles.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
,
Svante Janson
Random Struct. Algorithms, 2003

2001
Infinite paths in randomly oriented lattices.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
Random Struct. Algorithms, 2001

1986
An exact threshold theorem for random graphs and the node-packing problem.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
J. Comb. Theory B, 1986

1985
The shortest-path problem for graphs with random arc-lengths.
[BibTeX]
[DOI]
Alan M. Frieze
,
Geoffrey R. Grimmett
Discret. Appl. Math., 1985

1976
An upper bound for the number of spanning trees of a graph.
[BibTeX]
[DOI]
Geoffrey R. Grimmett
Discret. Math., 1976


  Loading...