Geoffrey Grimmett

Last updated

Geoffrey Grimmett
Geoffrey Grimmett cropped for small screen use.jpg
Born
Geoffrey Richard Grimmett

(1950-12-20) 20 December 1950 (age 73) [2]
Birmingham, England, UK
NationalityBritish
Alma mater Merton College, Oxford (BA, DPhil)
Spouse
Rosine Bonay
(m. 1986)
[2] [3]
ChildrenHugo Grimmett [3]
Awards
Scientific career
Fields
Institutions
Thesis Random Fields and Random Graphs  (1974)
Doctoral advisor
Website www.statslab.cam.ac.uk/~grg

Geoffrey Richard Grimmett (born 20 December 1950) [2] is an English mathematician known for his work on the mathematics of random systems arising in probability theory [7] [8] [9] and statistical mechanics, especially percolation theory [10] and the contact process. [11] [4] He is the Professor of Mathematical Statistics in the Statistical Laboratory, University of Cambridge, and was the Master of Downing College, Cambridge, from 2013 to 2018. [12]

Contents

Education

Grimmett was educated at King Edward's School, Birmingham and Merton College, Oxford. He graduated in 1971, and completed his DPhil in 1974 [13] under the supervision of John Hammersley and Dominic Welsh. [6]

Career and research

Grimmett served as the IBM Research Fellow at New College, Oxford, from 1974 to 1976 before moving to the University of Bristol. [2] [14] He was appointed Professor of Mathematical Statistics at the University of Cambridge in 1992, becoming a fellow of Churchill College, Cambridge. [15] He was Director of the Statistical Laboratory from 1994 to 2000, Head of the Department of Pure Mathematics and Mathematical Statistics (DPMMS) from 2002 to 2007, and is a trustee of the Rollo Davidson Prize. [16]

Grimmett is particularly recognised for his achievements in the rigorous theory of disordered physical systems. [1] Especially influential is his work on and around percolation theory, the contact model for stochastic spatial epidemics, and the random-cluster model, a class that includes the Ising/Potts models of ferromagnetism. [1] His monograph on percolation is a standard work in a core area of probability, and is widely cited. [1] His breadth within probability is emphasized by his important contributions to probabilistic combinatorics and probabilistic number theory. [1]

In October 2013 he was appointed Master of Downing College, Cambridge, succeeding Barry Everitt. [3] He ended his term as Master on 30 September 2018, being replaced by Alan Bookbinder. [17]

He was appointed Chair of the Heilbronn Institute for Mathematical Research in September 2020. [18] He was succeeded by Catherine Hobbs on September 1 2023. [19]

Awards and honours

Grimmett was awarded the Rollo Davidson Prize in 1989 [20] and elected a Fellow of the Royal Society (FRS) in 2014. [1]

Personal life

Grimmett is the son of Benjamin J Grimmett and Patricia W (Lewis) Grimmett. [21]

He competed at the 1976 Summer Olympics in Montreal as a member of the Great Britain Men's Foil Team, finishing 6th. [22]

Related Research Articles

<span class="mw-page-title-main">Percolation theory</span> Mathematical theory on behavior of connected clusters in a random graph

In statistical physics and mathematics, percolation theory describes the behavior of a network when nodes or links are added. This is a geometric type of phase transition, since at a critical fraction of addition the network of small, disconnected clusters merge into significantly larger connected, so-called spanning clusters. The applications of percolation theory to materials science and in many other disciplines are discussed here and in the articles Network theory and Percolation.

<span class="mw-page-title-main">Percolation</span> Filtration of fluids through porous materials

In physics, chemistry, and materials science, percolation refers to the movement and filtering of fluids through porous materials. It is described by Darcy's law. Broader applications have since been developed that cover connectivity of many systems modeled as lattices or graphs, analogous to connectivity of lattice components in the filtration problem that modulates capacity for percolation.

<span class="mw-page-title-main">Random graph</span> Graph generated by a random process

In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability distribution, or by a random process which generates them. The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective, random graphs are used to answer questions about the properties of typical graphs. Its practical applications are found in all areas in which complex networks need to be modeled – many random graph models are thus known, mirroring the diverse types of complex networks encountered in different areas. In a mathematical context, random graph refers almost exclusively to the Erdős–Rényi random graph model. In other contexts, any graph model may be referred to as a random graph.

<span class="mw-page-title-main">Béla Bollobás</span> Hungarian mathematician

Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős from the age of 14.

<span class="mw-page-title-main">John Hammersley</span> British mathematician

John Michael Hammersley, was a British mathematician best known for his foundational work in the theory of self-avoiding walks and percolation theory.

<span class="mw-page-title-main">David George Kendall</span> English statistician and mathematician

David George Kendall FRS was an English statistician and mathematician, known for his work on probability, statistical shape analysis, ley lines and queueing theory. He spent most of his academic life in the University of Oxford (1946–1962) and the University of Cambridge (1962–1985). He worked with M. S. Bartlett during World War II, and visited Princeton University after the war.

<span class="mw-page-title-main">Contact process (mathematics)</span>

The contact process is a stochastic process used to model population growth on the set of sites of a graph in which occupied sites become vacant at a constant rate, while vacant sites become occupied at a rate proportional to the number of occupied neighboring sites. Therefore, if we denote by the proportionality constant, each site remains occupied for a random time period which is exponentially distributed parameter 1 and places descendants at every vacant neighboring site at times of events of a Poisson process parameter during this period. All processes are independent of one another and of the random period of time sites remains occupied. The contact process can also be interpreted as a model for the spread of an infection by thinking of particles as a bacterium spreading over individuals that are positioned at the sites of , occupied sites correspond to infected individuals, whereas vacant correspond to healthy ones.

<span class="mw-page-title-main">Olav Kallenberg</span> Swedish American mathematician

Olav Kallenberg is a Swedish-American mathematician, working in all areas of probability theory. He is especially known for his work on random measures and probabilistic symmetries, and for his graduate-level textbooks and monographs. Since 2018 he is an Emeritus Professor of Mathematics at Auburn University, AL.

<span class="mw-page-title-main">Peter Gavin Hall</span> Australian statistician (1951–2016)

Peter Gavin Hall was an Australian researcher in probability theory and mathematical statistics. The American Statistical Association described him as one of the most influential and prolific theoretical statisticians in the history of the field. The School of Mathematics and Statistics Building at The University of Melbourne was renamed the Peter Hall building in his honour on 9 December 2016.

<span class="mw-page-title-main">David Williams (mathematician)</span> Welsh mathematician

David Williams FRS is a Welsh mathematician who works in probability theory.

<span class="mw-page-title-main">Harry Kesten</span> American mathematician (1931–2019)

Harry Kesten was a Jewish American mathematician best known for his work in probability, most notably on random walks on groups and graphs, random matrices, branching processes, and percolation theory.

The Hammersley–Clifford theorem is a result in probability theory, mathematical statistics and statistical mechanics that gives necessary and sufficient conditions under which a strictly positive probability distribution can be represented as events generated by a Markov network. It is the fundamental theorem of random fields. It states that a probability distribution that has a strictly positive mass or density satisfies one of the Markov properties with respect to an undirected graph G if and only if it is a Gibbs random field, that is, its density can be factorized over the cliques of the graph.

János Komlós is a Hungarian-American mathematician, working in probability theory and discrete mathematics. He has been a professor of mathematics at Rutgers University since 1988. He graduated from the Eötvös Loránd University, then became a fellow at the Mathematical Institute of the Hungarian Academy of Sciences. Between 1984–1988 he worked at the University of California, San Diego.

<span class="mw-page-title-main">James R. Norris</span> British mathematician

James Ritchie Norris is a mathematician working in probability theory and stochastic analysis. He is the Professor of Stochastic Analysis in the Statistical Laboratory, University of Cambridge.

Rollo Davidson was a probabilist, alpinist, and Fellow-elect of Churchill College, Cambridge, who died aged 25 on Piz Bernina. He is known for his work on semigroups, stochastic geometry, and stochastic analysis, and for the Rollo Davidson Prize, given in his name to early-career probabilists.

<span class="mw-page-title-main">Sourav Chatterjee</span> Indian mathematician (born 1979)

Sourav Chatterjee is an Indian Bengali mathematician from West Bengal, specializing in mathematical statistics and probability theory. Chatterjee is credited with work on the study of fluctuations in random structures, concentration and super-concentration inequalities, Poisson and other non-normal limits, first-passage percolation, Stein's method and spin glasses. He has received a Sloan Fellowship in mathematics, Tweedie Award, Rollo Davidson Prize, Doeblin Prize, Loève Prize, and Infosys Prize in mathematical sciences. He was an invited speaker at the International Congress of Mathematicians in 2014.

James Anthony Dominic Welsh was an English mathematician and emeritus professor of Oxford University's Mathematical Institute. He was an expert in matroid theory, the computational complexity of combinatorial enumeration problems, percolation theory, and cryptography.

<span class="mw-page-title-main">Gordon Douglas Slade</span> Canadian mathematician

Gordon Douglas Slade is a Canadian mathematician, specializing in probability theory.

<span class="mw-page-title-main">Ioannis Kontoyiannis</span> Greek mathematician and information theorist

Ioannis Kontoyiannis is a Greek mathematician and information theorist. He is the Churchill Professor of Mathematics of Information with the Statistical Laboratory, in the Department of Pure Mathematics and Mathematical Statistics, of the University of Cambridge. He is also a Fellow of Darwin College, Cambridge, and Chairman of the Rollo Davidson Trust.

<span class="mw-page-title-main">Bunkbed conjecture</span> Conjecture in probabilistic combinatorics

The bunkbed conjecture is a statement in percolation theory, a branch of mathematics that studies the behavior of connected clusters in a random graph. The conjecture is named after its analogy to a bunk bed structure. It was first posited by Pieter Kasteleyn in 1985. A preprint giving a proposed counterexample to the conjecture was posted on the arXiv in October 2024 by Nikita Gladkov, Igor Pak, and Alexander Zimin.

References

  1. 1 2 3 4 5 6 Anon (2014). "Professor Geoffrey Grimmett FRS". royalsociety.org. London: Royal Society. Archived from the original on 11 June 2018. Retrieved 1 May 2014. One or more of the preceding sentences incorporates text from the royalsociety.org website where:
    "All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." --Royal Society Terms, conditions and policies at the Wayback Machine (archived 2016-11-11)
  2. 1 2 3 4 5 Anon (2014). "Grimmett, Prof. Geoffrey Richard" . Who's Who (online Oxford University Press  ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.U18289.(Subscription or UK public library membership required.)
  3. 1 2 3 Professor Geoffrey Grimmett elected as next Master
  4. 1 2 Geoffrey Grimmett publications indexed by Google Scholar OOjs UI icon edit-ltr-progressive.svg
  5. Grimmett, G. R.; McDiarmid, C. J. H. (2008). "On colouring random graphs". Mathematical Proceedings of the Cambridge Philosophical Society. 77 (2): 313. doi:10.1017/S0305004100051124. S2CID   3421302.
  6. 1 2 Geoffrey Grimmett at the Mathematics Genealogy Project
  7. Grimmett, G. R.; Stirzaker, D. R. (2001). Probability and Random Processes. Oxford University Press. ISBN   0198572220.
  8. Grimmett, G. R. (2010). Probability on Graphs. Cambridge University Press. ISBN   978-0521147354.
  9. Aldous, David (2013). "Book Review: Probability on graphs: random processes on graphs and lattices by Geoffrey Grimmett". Bulletin of the American Mathematical Society. 51 (1): 173–175. doi: 10.1090/S0273-0979-2013-01428-9 . ISSN   0273-0979.
  10. Grimmett, G. (1999). "What is Percolation?". Percolation. Grundlehren der mathematischen Wissenschaften. Vol. 321. pp. 1–31. doi:10.1007/978-3-662-03981-6_1. ISBN   978-3-642-08442-3.
  11. "Geoffrey Grimmett's homepage at the University of Cambridge".
  12. Geoffrey Grimmett publications indexed by the Scopus bibliographic database. (subscription required)
  13. Grimmett, Geoffrey (1974). Random Fields and Random Graphs (DPhil thesis). University of Oxford. OCLC   500458360. EThOS   uk.bl.ethos.457489. Archived from the original on 17 September 2018. Retrieved 16 September 2018.
  14. Frieze, A. M.; Grimmett, G. R. (1985). "The shortest-path problem for graphs with random arc-lengths". Discrete Applied Mathematics. 10: 57–77. doi: 10.1016/0166-218X(85)90059-9 .
  15. "Fellows of the Colleges: Churchill". Cambridge University Reporter. University of Cambridge. 2 October 2008. Retrieved 7 May 2009.
  16. "Trustees of the Rollo Davidson Trust". Archived from the original on 29 September 2008. Retrieved 7 May 2009.
  17. "Downing College announces Master Elect". 29 November 2017.
  18. "Heilbronn Institute for Mathematical Research | New Chair".
  19. "Heilbronn Institute for Mathematical Research | New Chair".
  20. "Rollo Davidson Awards 1976 – 2023". University of Cambridge Statistical Laboratory. Retrieved 19 April 2024.
  21. "Index entry". FreeBMD. ONS. Retrieved 10 May 2014.
  22. "SR/Olympic Sports". Archived from the original on 20 October 2012.
Academic offices
Preceded by Master of Downing College, Cambridge
20132018
Succeeded by

Creative Commons by small.svg  This article incorporates text available under the CC BY 4.0 license.