Probability on discrete structures

Author(s)

Bibliographic Information

Probability on discrete structures

Harry Kesten (editor)

（Encyclopaedia of mathematical sciences / editor-in-chief, R.V. Gamkrelidze, v. 110 . Probability theory ; 1）

Springer, c2004

Available at  / 86 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

Most probability problems involve random variables indexed by space and/or time. These problems almost always have a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.

Table of Contents

The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence.- The Random-Cluster Model.- Models of First-Passage Percolation.- Relaxation Times of Markov Chains in Statistical Mechanics and Combinatorial Structures.- Random Walks on Finite Groups.

by "Nielsen BookData"

Related Books： 1-1 of 1

Details

Page Top