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...
| Other Authors: | , , , |
|---|---|
| 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 |
Table of Contents:
- 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