## Discrete probability and algorithmsDiscrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

On simulating a Markov chain stationary distribution when | 1 |

A note on network reliability | 11 |

at the interface | 43 |

Copyright | |

6 other sections not shown

### Other editions - View all

Discrete Probability and Algorithms David Aldous,Laurent Saloff-Coste,Joel Spencer,J. Michael Steele Limited preview - 2012 |

### Common terms and phrases

5-tuples Aldous algorithm analysis Applications asymptotic Avner Friedman bootstrap chi-square color column sums combinatorial complete Computer Science consider constant contingency tables convergence to stationarity counts the number defined dense graphs Diaconis dual Editors Efron enumeration Erdos Erdos-Szekeres theorem estimate Euclidean functional evaluation example exists a fpras expected number fc-clique finite given gives graph G hyperbola increasing subsequence independent inequality integer Jerrum Joel Spencer Lemma linear Lovasz Markov chain Math Mathematics matroids MMTF monotone subsequence Monte Carlo move-to-front number of steps pairs permutations Persi Diaconis planar graph points probabilistic probability problem proof of Theorem prove quasi-additive functionals random variables random walk request chain result row and column sampling Section semi-matching sequence Sidon set simulation space-time product spanning tree stationary distribution statistical Stochastic subadditive subgraph subset superadditivity theory total variation distance transition matrix Tutte polynomial upper bound values vertex vertices Volume