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. Language: English