English
Discrete Probability and Algorithms
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown
-
Altmetric BadgeChapter 2 A Note on Network Reliability
-
Altmetric BadgeChapter 3 Rectangular Arrays with Fixed Margins
-
Altmetric BadgeChapter 4 Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
-
Altmetric BadgeChapter 5 The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
-
Altmetric BadgeChapter 6 The Asymptotic Lower Bound on the Diagonal Ramsey Numbers: A Closer Look
-
Altmetric BadgeChapter 7 Random Walks and Undirected Graph Connectivity: A Survey
-
Altmetric BadgeChapter 8 Sidon Sets with Small Gaps
-
Altmetric BadgeChapter 9 Variations on the Monotone Subsequence Theme of Erdös and Szekeres
-
Altmetric BadgeChapter 10 Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
-
Altmetric BadgeChapter 11 Quasi-Additive Euclidean Functionals