The DOI matches its Crossref record.
Probability and Random Processes.
Abstract
Abstract This third edition of this successful text gives a rigorous and extensive introduction to probability theory and an account in some depth of the most important random processes. It includes various topics which are suitable for undergraduate courses, but are not routinely taught. It is suitable for students of probability at all levels. There are four main aims: 1) to provide a thorough but straightforward account of basic probability, giving the reader a natural feel for the subject unburdened by oppressive technicalities, 2) to discuss important random processes in depth with many examples. 3) to cover a range of important but less routine topics, 4) to impart to the beginner the flavour of more advanced work. The book begins with basic ideas common to many undergraduate courses in mathematics, statistics and the sciences; it concludes with topics usually found at graduate level. The ordering and numbering of material in this third edition has been mostly preserved from the second. Minor alterations and additions have been added for clearer exposition. Highlights include new sections on sampling and Markov chain Monte Carlo, geometric probability, coupling and Poisson approximation, large deviations, spatial Poisson processes, renewal-reward, queuing networks, stochastic calculus, Itô's formula and option pricing in the Black- Scholes model for financial markets. In addition there are many (nearly 400) new exercises and problems that are entertaining and instructive; their solutions can be found in the companion volume 'One Thousand Exercises in Probability', (OUP).
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“An important theorem from probability theory (see, e.g., p. 232 in [39]) states that if is irreducible (i.e., any state in can be reached from any other state in in finitely many steps with probability ) and aperiodic (i.e., its state transitions cannot be trapped in deterministic cycles), then the probability converges for to a probability that does not depend on the initial state .”
From Neural dynamics as sampling: a model for stochastic computation in recurrent networks of spiking neurons (2011) · cites this paper as [39]
Citations
Cited by
Sorted by citations
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,368
A Kernel Method for the Two-Sample-Problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., & Smola, A. J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0069 · Cited by 2,167
Inverse problems: A Bayesian perspective
Stuart, A. M. (2010) · Acta Numerica · doi:10.1017/s0962492910000061 · Cited by 1,941
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,679
Codling, E. A., Plank, M. J., & Benhamou, S. (2008) · Journal of The Royal Society Interface · doi:10.1098/rsif.2008.0014 · Cited by 1,482
Metadata
- Authors
- Grimmett, G. R., & Stirzaker, D. R.
- ORCID
- Grimmett, Geoffrey R
- Publisher
- Oxford University PressOxford
- Published
- 2001-05-31
- OpenAlex
- W4388297583
- Cited by
- 1,850
- References
- 0
- Citations by year
- 2026: 32 · 2025: 43 · 2024: 77 · 2023: 71 · 2022: 93 · 2021: 95 · 2020: 90 · 2019: 128 · 2018: 137 · 2017: 87 · 2016: 87 · 2015: 113 · 2014: 106 · 2013: 105 · 2012: 108
- FWCI
- 5.56
- Type
- book
- Language
- en
- Open access
- closed
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Mathematics › Applied Mathematics › Point processes and geometric inequalities
- Keywords
- probability theory, stochastic processes, Markov chain Monte Carlo, geometric probability, coupling, Poisson approximation, large deviations, spatial Poisson process, queueing networks, stochastic calculus, Itô formula, option pricing, Black-Scholes model, sampling
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review