Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-06T08:14:57.475Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  12 January 2018

Geoffrey Grimmett
Affiliation:
Statistical Laboratory, University of Cambridge
Get access

Summary

Within themenagerie of objects studied in contemporary probability theory, a number of related animals have attracted great interest amongst probabilists and physicists in recent years. The inspiration for many of these objects comes from physics, but the mathematical subject has taken on a life of its own and many beautiful constructions have emerged. The overall target of these notes is to identify some of these topics, and to develop their basic theory at a level suitable for mathematics graduates.

If the two principal characters in these notes are random walk and percolation, they are only part of the rich theory of uniform spanning trees, self-avoiding walks, random networks, models for ferromagnetism and the spread of disease, and motion in random environments. This is an area that has attracted many fine scientists, by virtue, perhaps, of its special mixture of modelling and problem-solving. There remain many open problems. It is the experience of the author that these may be explained successfully to a graduate audience open to inspiration and provocation.

The material described here may be used for personal study and also as the bases of lecture courses of between 16 and 48 hours duration. Little is assumed about the mathematical background of the audience beyond some basic probability theory, but students should be willing to get their hands dirty if they are to profit. Care should be taken in the setting of examinations, since problems can be unexpectedly difficult. Successful examinations may be designed, and some help is offered through the inclusion of exercises at the ends of chapters. As an alternative to a conventional examination, students could be asked to deliver presentations on aspects and extensions of the topics studied.

Chapter 1 is devoted to the relationship between randomwalks (on graphs) and electrical networks. This leads to the Thomson andRayleigh principles, and thence to a proof of Pólya's theorem. In Chapter 2,we describeWilson's algorithm for constructing a uniform spanning tree (UST), and we discuss boundary conditions and weak limits for UST on a lattice. This chapter includes a brief introduction to Schramm–Löwner evolutions (SLEs).

Type
Chapter
Information
Probability on Graphs
Random Processes on Graphs and Lattices
, pp. ix - xii
Publisher: Cambridge University Press
Print publication year: 2018

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
  • Geoffrey Grimmett, Statistical Laboratory, University of Cambridge
  • Book: Probability on Graphs
  • Online publication: 12 January 2018
  • Chapter DOI: https://doi.org/10.1017/9781108528986.001
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
  • Geoffrey Grimmett, Statistical Laboratory, University of Cambridge
  • Book: Probability on Graphs
  • Online publication: 12 January 2018
  • Chapter DOI: https://doi.org/10.1017/9781108528986.001
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
  • Geoffrey Grimmett, Statistical Laboratory, University of Cambridge
  • Book: Probability on Graphs
  • Online publication: 12 January 2018
  • Chapter DOI: https://doi.org/10.1017/9781108528986.001
Available formats
×