Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Lectures on Contemporary Probability by…

Lectures on Contemporary Probability

by Gregory F. Lawler

MembersReviewsPopularityAverage ratingConversations



Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
Important places
Important events
Related movies
Awards and honors
First words
Last words
Disambiguation notice
Publisher's editors
Publisher series
Original language

References to this work on external resources.

Wikipedia in English


Book description
Haiku summary

Amazon.com Product Description (ISBN 082182029X, Paperback)

This volume is based on classes in probability for advanced undergraduates held at the IAS/Park City Mathematics Institute (Utah). It is derived from both lectures (Chapters 1-10) and computer simulations (Chapters 11-13) that were held during the program. The material is coordinated so that some of the major computer simulations relate to topics covered in the first ten chapters. The goal is to present topics that are accessible to advanced undergraduates, yet are areas of current research in probability. The combination of the lucid yet informal style of the lectures and the hands-on nature of the simulations allows readers to become familiar with some interesting and active areas of probability.

The first four chapters discuss random walks and the continuous limit of random walks: Brownian motion. Chapters 5 and 6 consider the fascinating mathematics of card shuffles, including the notions of random walks on a symmetric group and the general idea of random permutations.

Chapters 7 and 8 discuss Markov chains, beginning with a standard introduction to the theory. Chapter 8 addresses the recent important application of Markov chains to simulations of random systems on large finite sets: Markov Chain Monte Carlo.

Random walks and electrical networks are covered in Chapter 9. Uniform spanning trees, as connected to probability and random walks, are treated in Chapter 10.

The final three chapters of the book present simulations. Chapter 11 discusses simulations for random walks. Chapter 12 covers simulation topics such as sampling from continuous distributions, random permutations, and estimating the number of matrices with certain conditions using Markov Chain Monte Carlo. Chapter 13 presents simulations of stochastic differential equations for applications in finance. (The simulations do not require one particular piece of software. They can be done in symbolic computation packages or via programming languages such as C.)

The volume concludes with a number of problems ranging from routine to very difficult. Of particular note are problems that are typical of simulation problems given to students by the authors when teaching undergraduate probability.

(retrieved from Amazon Thu, 12 Mar 2015 18:21:13 -0400)

No library descriptions found.

Quick Links

Swap Ebooks Audio

Popular covers


Average: No ratings.

Is this you?

Become a LibraryThing Author.


You are using the new servers! | About | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 117,140,775 books! | Top bar: Always visible