Problems and snapshots from the world of probability
This fascinating and informative book contains 125 problems and snapshots from discrete probability theory. The problems are selected on the basis of their elegance and utility whereas snapshots are intended to provide a quick overview of topics in probability. The topics include classical combinatorics, classical random walk (Banach's match box problem, etc.), problems of historical interest (Cardano, Huygens, Bernoulli, Petersburg paradox, Stirling numbers, Bayes), random permutations, coupon collecting, Poisson approximation, birthday problems, grouping by random division, records, ballot problems, urn models, cover times, card shuffling, Markov chains, patterns, embedding procedures, martingales, random walk on a chess board, rendevous problem. This book is written for a broad range of readers and serves as a lovely and important reminder even to researchers. In the Preface, the authors write: ``The first problem book of a similar kind as ours is perhaps \textit{F. Mosteller's} well-known `Fifty challenging problems in probability with solutions' (1965, reprinted 1987; Zbl 0653.60001). Possibly, our book is the second. Mosteller's book might be the first but the present book is definitely not the second. Let me recall some related ones: \textit{G. L. Wise} and \textit{E. B. Hall}, Counterexamples in probability and real analysis (Oxford University Press, 1993); \textit{J. M. Stoyanov}, Counterexamples in probability (1987; Zbl 0629.60001); and \textit{G. J. Székely}, Paradoxes in probability theory and mathematical statistics (1986; Zbl 0605.60002). In spite of the existence of these and some other related books the present one is very valuable, very nice, and entertaining. The authors show an intimate knowledge over a wide range of stochastics and thus the readers can learn a lot.
- Branching process models for mutant genes in nonstationary populations
- Covariance identity for multinomial trials.
- Illustration of some moment identities for order statistics
- Gamma-distribution order statistics, maximal multinomial frequency and randomization de\-signs
- Key-recovery attacks on \(\mathsf{ASASA}\)
- Average-case linear-time similar substring searching by the q-gram distance
- Keeping scores
- Normal order statistics and sums of geometric random variables in treatment allocation prob\-lems
- Box model of migration channels
- Celebrated problems in stochastics. From the beginnings until today
- Probability problems of Dobrushin type
- Three problems for the clairvoyant demon
- Stopping Rules in Balanced Allocation Problems: Exact and Asymptotic Distributions
- On a probability problem of Lewis Carroll
- TESTING SYMMETRY USING A TRIMMED LONGEST RUN STATISTIC
- scientific article; zbMATH DE number 4066010 (Why is no real title available?)
- scientific article; zbMATH DE number 1950486 (Why is no real title available?)
- Statistical Gambler's Ruin Problem
- Run statistics in a sequence of arbitrarily dependent binary trials
- Memory in Coal Tits: An Alternative Model
- Surprises in probability: seventeen short stories
- Sum the multiplicative odds to one and stop
- Approximating the tail probabilities of the longest run in a sequence of Bernoulli trials
- Absent-minded passengers
- Asymptotics on the number of walks until no shoes when the number of doors is large
- Randomization with non-uniform allocations: fulfillment time distributions and bias properties
- Conway's Napkin Problem
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
- Exactly solvable urn models under random replacement schemes and their applications
- Stability of \(L\)-statistics from weakly dependent observations
- Counting certain binary strings
- Three classical probability problems: the Hungarian roulette
- A martingale approach to scan statistics
- Excursions through probability theory.
- Stability of expected \(L\)-statistics against weak dependence of observations
- Gambler's ruin and winning a series by m games
- On the gambler's ruin problem for a finite Markov chain
This page was built for publication: Problems and snapshots from the world of probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276318)