Probability on Discrete Structures / Edition 1

Probability on Discrete Structures / Edition 1

ISBN-10:
3642056474
ISBN-13:
9783642056475
Pub. Date:
12/01/2010
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3642056474
ISBN-13:
9783642056475
Pub. Date:
12/01/2010
Publisher:
Springer Berlin Heidelberg
Probability on Discrete Structures / Edition 1

Probability on Discrete Structures / Edition 1

$109.99
Current price is , Original price is $109.99. You
$109.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

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 shastic 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.


Product Details

ISBN-13: 9783642056475
Publisher: Springer Berlin Heidelberg
Publication date: 12/01/2010
Series: Encyclopaedia of Mathematical Sciences , #110
Edition description: Softcover reprint of hardcover 1st ed. 2004
Pages: 351
Product dimensions: 6.10(w) x 9.25(h) x 0.24(d)

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.
From the B&N Reads Blog

Customer Reviews