Topics in Occupation Times and Gaussian Free Fields

29.00 €

Order
Topics in Occupation Times and Gaussian Free Fields
This book grew out of a graduate course at ETH Zurich during the Spring term 2011. It explores various links between such notions as occupation times of Markov chains, Gaussian free fields, Poisson point processes of Markovian loops, and random interlacements, which have been the object of intensive research over the last few years. These notions are developed in the convenient set-up of finite weighted graphs endowed with killing measures. The book first discusses elements of continuous-time Markov chains, Dirichlet forms, potential theory, together with some consequences for Gaussian free fields. Next, isomorphism theorems and generalized Ray-Knight theorems, which relate occupation times of Markov chains to Gaussian free fields, are pre- sented. Markovian loops are constructed and some of their key properties derived. The field of occupation times of Poisson point processes of Markovian loops is investigated. Of special interest are its connection to the Gaussian free field, and a formula of Symanzik. Finally, links between random interlacements and Markovian loops are discussed, and some further connections with Gaussian free fields are mentioned.

More from the series "Zurich Lectures in Advanced Mathematics"

More books by Alain-Sol Sznitman

Log in to get access to this book and to automatically save your books and your progress.

Purchase this book or upgrade to dav Pro to read this book.

When you buy this book, you can access it regardless of your plan. You can also download the book file and read it in another app or on an Ebook reader.

80 % of the price goes directly to the author.

ISBN: 9783037191095

Language: English

Publication date: 05.2012

Number of pages: 114

Our shipping costs are a flat rate of €2.50, regardless of the order.
Currently, we only ship within Germany.

Shipping is free for PocketLib Pro users.

An error occured. Please check your internet connection or try it again later.