Discrete Probability and Algorithms

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

Full description

Bibliographic Details
Other Authors: Aldous, David (Editor), Diaconis, Persi (Editor), Spencer, Joel (Editor), Steele, J. Michael (Editor)
Format: eBook
Language:English
Published: New York, NY Springer New York 1995, 1995
Edition:1st ed. 1995
Series:The IMA Volumes in Mathematics and its Applications
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02750nmm a2200349 u 4500
001 EB000618314
003 EBX01000000000000000471396
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781461208013 
100 1 |a Aldous, David  |e [editor] 
245 0 0 |a Discrete Probability and Algorithms  |h Elektronische Ressource  |c edited by David Aldous, Persi Diaconis, Joel Spencer, J. Michael Steele 
250 |a 1st ed. 1995 
260 |a New York, NY  |b Springer New York  |c 1995, 1995 
300 |a XVII, 158 p  |b online resource 
505 0 |a On simulating a Markov chain stationary distribution when transition probabilities are unknown -- A note on network reliability -- Rectangular arrays with fixed margins -- Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics -- The move-to-front rule for self-organizing lists with Markov dependent requests -- The asymptotic lower bound on the diagonal Ramsey numbers: A closer look -- Random walks and undirected graph connectivity: A survey -- Sidon sets with small gaps -- Variations on the monotone subsequence theme of Erd?s and Szekeres -- Randomised approximation schemes for Tutte-Gröthendieck invariants -- Quasi-additive Euclidean functionals 
653 |a Statistics, general 
653 |a Combinatorics 
653 |a Statistics  
653 |a Probability Theory and Stochastic Processes 
653 |a Probabilities 
653 |a Combinatorics 
700 1 |a Diaconis, Persi  |e [editor] 
700 1 |a Spencer, Joel  |e [editor] 
700 1 |a Steele, J. Michael  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a The IMA Volumes in Mathematics and its Applications 
856 4 0 |u https://doi.org/10.1007/978-1-4612-0801-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.6 
520 |a Discrete 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