Skip to content
Register Sign in Wishlist

Random Walks and Heat Kernels on Graphs

$75.99 (C)

Part of London Mathematical Society Lecture Note Series

  • Date Published: April 2017
  • availability: Available
  • format: Paperback
  • isbn: 9781107674424

$ 75.99 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This introduction to random walks on infinite graphs gives particular emphasis to graphs with polynomial volume growth. It offers an overview of analytic methods, starting with the connection between random walks and electrical resistance, and then proceeding to study the use of isoperimetric and Poincaré inequalities. The book presents rough isometries and looks at the properties of a graph that are stable under these transformations. Applications include the 'type problem': determining whether a graph is transient or recurrent. The final chapters show how geometric properties of the graph can be used to establish heat kernel bounds, that is, bounds on the transition probabilities of the random walk, and it is proved that Gaussian bounds hold for graphs that are roughly isometric to Euclidean space. Aimed at graduate students in mathematics, the book is also useful for researchers as a reference for results that are hard to find elsewhere.

    • Connects geometry and probability, showing how geometric properties of the graph can be used to estimate the heat kernel
    • Introduces important analytic inequalities in the graph context
    • Written by a leading researcher who has made significant contributions to this area of study
    Read more

    Reviews & endorsements

    'This book, written with great care, is a comprehensive course on random walks on graphs, with a focus on the relation between rough geometric properties of the underlying graph and the asymptotic behavior of the random walk on it. It is accessible to graduate students but may also serve as a good reference for researchers. It contains the usual material about random walks on graphs and its connections to discrete potential theory and electrical resistance (Chapters 1, 2 and 3). The heart of the book is then devoted to the study of the heat kernel (Chapters 4, 5 and 6). The author develops sufficient conditions under which sub-Gaussian or Gaussian bounds for the heat kernel hold (both on-diagonal and off diagonal; both upper and lower bounds).' Nicolas Curien, Mathematical Review

    'The book under review delineates very thoroughly the general theory of random walks on weighted graphs. The author’s expertise in both probability and analysis is apparent in the exposition and the elegant proofs depicted in the book.' Eviatar B. Procaccia, Bulletin of the American Mathematical Society

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2017
    • format: Paperback
    • isbn: 9781107674424
    • length: 236 pages
    • dimensions: 226 x 152 x 15 mm
    • weight: 0.35kg
    • contains: 5 b/w illus. 8 exercises
    • availability: Available
  • Table of Contents

    Preface
    1. Introduction
    2. Random walks and electrical resistance
    3. Isoperimetric inequalities and applications
    4. Discrete time heat kernel
    5. Continuous time random walks
    6. Heat kernel bounds
    7. Potential theory and Harnack inequalities
    Appendix A
    References
    Index.

  • Author

    Martin T. Barlow, University of British Columbia, Vancouver
    Martin T. Barlow is Professor in the Mathematics Department at the University of British Columbia. He was one of the founders of the mathematical theory of diffusions on fractals, and more recently has worked on random walks on random graphs. He gave a talk at the International Congress of Mathematicians (ICM) in 1990, and was elected a Fellow of the Royal Society of Canada in 1998 and a Fellow of the Royal Society in 2005. He is the winner of the Jeffrey-Williams Prize of the Canadian Mathematical Society and the CRM-Fields-PIMS Prize of the three Canadian mathematics institutes (the Centre de recherches mathématiques, the Fields Institute, and the Pacific Institute for the Mathematical Sciences).

Related Books

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×