Modern Discrete Probability
From MaRDI portal
Publication:6085328
Recommendations
- Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding
- Probability on trees and networks
- Probability and Computing
- The probabilistic method
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
Cited in
(8)- Optimal sequencing depth for single-cell RNA-sequencing in Wasserstein space
- Lower bounds on the sample complexity of species tree estimation when substitution rates vary across loci
- Asymptotic error of Bonferroni procedure under weak dependence via Chen-Stein method
- A tight lower bound on non-adaptive group testing estimation
- Extremal shot noise processes and random cutout sets
- Likelihood-based root state reconstruction on a tree: sensitivity to parameters and applications
- Large deviations of the giant in supercritical kernel-based spatial random graphs
- PAC verification of statistical algorithms
This page was built for publication: Modern Discrete Probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085328)