Title | Discrete Probability and Algorithms [electronic resource] / edited by David Aldous, Persi Diaconis, Joel Spencer, J. Michael Steele |
---|---|
Imprint | New York, NY : Springer New York : Imprint: Springer, 1995 |
Connect to | http://dx.doi.org/10.1007/978-1-4612-0801-3 |
Descript | XVII, 158 p. online resource |
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