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
Items 901–1,000 of 1,001
Nandi, M. K., & Bhattacharyya, S. M. (2019) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ab50d4 · Cited by 6
Differentially Private and Budget-Limited Bandit Learning over Matroids
Han, K., He, Y., Liu, A. X., Tang, S., & Huang, H. (2020) · INFORMS journal on computing · doi:10.1287/ijoc.2019.0903 · Cited by 5
Homogeneous open quantum walks on the line: criteria for site recurrence and absorption
Jacq, T. S., & Lardizabal, C. F. (2021) · Quantum Information and Computation · doi:10.26421/qic21.1-2-3 · Cited by 6
Probability in Electrical Engineering and Computer Science
Walrand, J. C. (2021) · Springer eBooks · doi:10.1007/978-3-030-49995-2 · Cited by 6
Efficient Representation of Large-Alphabet Probability Distributions
Adler, A., Tang, J., & Polyanskiy, Y. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3234502 · Cited by 5
Uncertain Data: Representations, Query Processing, and Applications
Ge, T., Dekhtyar, A., & Goldsmith, J. (2013) · Studies in fuzziness and soft computing · doi:10.1007/978-3-642-37509-5_4 · Cited by 6
ECPC: Preserve Downtime Data Persistence in Disruptive Sensor Networks
Xu, M., Song, W., Heo, D., et al. (2013) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass.2013.37 · Cited by 6
Joint routing and resource allocation for delay sensitive traffic in cognitive mesh networks
El-Sherif, A. A., Mohamed, A. M. S., & Hu, Y. C. (2011) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2011.6162596 · Cited by 6
Formation and arrangement of pits by a corrosive gas
Burridge, J., & Inkpen, R. (2015) · Physical Review E · doi:10.1103/physreve.91.022403 · Cited by 6
Explicit Forward Recursive Estimators for Markov Modulated Markov Processes
Ephraim, Y., & Mark, B. L. (2012) · Stochastic Models · doi:10.1080/15326349.2012.699750 · Cited by 6
A Linear Algebraic Approach for Loss Tomography in Mesh Topologies Using Network Coding
Gui, J., Shah‐Mansouri, V., & Wong, V. W. S. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5501840 · Cited by 6
Lombardi, A. V. (2003) · Progress in Aerospace Sciences · doi:10.1016/s0376-0421(03)00042-3 · Cited by 6
Analysis of Dynamic Sensor Networks: Power Law Then What?
Fleury, É., Guillaume, J., Robardet, C., et al. (2007) · doi:10.1109/comswa.2007.382427 · Cited by 6
Robust SLNR downlink beamforming based on Markov's inequality
Chung, P.-J., & Du, H. (2012) · International Conference on Communications · doi:10.1109/icc.2012.6363910 · Cited by 6
Uncertainty Quantification for Stream Depletion Tests
Cui, T., & Ward, N. D. (2012) · Journal of Hydrologic Engineering · doi:10.1061/(asce)he.1943-5584.0000695 · Cited by 6
Accurate and Efficient Network Tomography Through Network Coding
Gui, J., Shah‐Mansouri, V., & Wong, V. W. S. (2011) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2011.2149549 · Cited by 6
Tertinek, S., & Feely, O. (2011) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2011.2149650 · Cited by 6
Stochastic SIR epidemics in a population with households and schools
Ouboter, T., Meester, R. W. J., & Trapman, P. (2015) · Journal of Mathematical Biology · doi:10.1007/s00285-015-0901-4 · Cited by 6
Population models at stochastic times
Orsingher, E., Ricciuti, C., & Toaldo, B. (2016) · Advances in Applied Probability · doi:10.1017/apr.2016.11 · Cited by 6
Universal data discovery using atypicality
Høst-Madsen, A., Sabeti, E., Walton, C. B., et al. (2016) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2016.7841010 · Cited by 6
Efficiency of Power Ramping During Random Access in LTE
Mišić, J., & Mišić, V. B. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2757034 · Cited by 6
A parsimonious approach for modeling uncertainty within complex nonlinear relationships
Strîmbu, B. M., Amărioarei, A., & Păun, M. (2017) · Ecosphere · doi:10.1002/ecs2.1945 · Cited by 6
Event-Driven Control With Deadline Optimization for Linear Systems With Stochastic Delays
van Horssen, E. P., Prakash, S., Antunes, D., et al. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2763749 · Cited by 6
On the rate of convergence to equilibrium for reflected Brownian motion
Glynn, P. W., & Wang, R. J. (2018) · Queueing Systems · doi:10.1007/s11134-018-9574-1 · Cited by 6
Probabilistic Inference of Fault Condition of Cyber-Physical Systems Under Uncertainty
Tao, X., Lu, J., Chen, D., & Törngren, M. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2965400 · Cited by 6
An ergodic theorem for the weighted ensemble method
Aristoff, D. (2022) · Journal of Applied Probability · doi:10.1017/jpr.2021.38 · Cited by 7
Sassi, I., Anter, S., & Bekkhoucha, A. (2021) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2021.0120438 · Cited by 6
Abadir, K. M., Heijmans, R. D. H., & Magnus, J. R. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139016131 · Cited by 6
Universal Relation Between Skewness and Kurtosis in Complex Dynamics
Cristelli, M. (2013) · Springer theses · doi:10.1007/978-3-319-00723-6_9 · Cited by 6
Cytomulate: accurate and efficient simulation of CyTOF data
Yang, Y., Wang, K., Lu, Z., Wang, T., & Wang, X. (2023) · Genome biology · doi:10.1186/s13059-023-03099-1 · Cited by 5
MASSIVELY DISTRIBUTED CONCEPT DRIFT HANDLING IN LARGE NETWORKS
Hegedűs, I., Ormándi, R., & Jelasity, M. (2013) · Advances in Complex Systems · doi:10.1142/s0219525913500215 · Cited by 6
Adaptive sensing and inference for single-photon imaging
Lu, Y. M. (2013) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2013.6552338 · Cited by 6
Adaptive Metropolis–Hastings sampling using reversible dependent mixture proposals
Tran, M., Pitt, M. K., & Kohn, R. (2014) · Statistics and Computing · doi:10.1007/s11222-014-9509-6 · Cited by 6
Noisy feedback linear precoding: A Bayesian Cramér-Rao bound
Housfater, A. S., & Lim, T. J. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205768 · Cited by 6
Laws of Large Numbers for Non-Homogeneous Markov Systems
Vassiliou, P. C. G. (2018) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-017-9612-1 · Cited by 6
Modelling and Using Response Times in Online Courses
Rushkin, I., Chuang, I. L., & Tingley, D. H. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 6
Order optimal information spreading using algebraic gossip
Avin, C., Borokhovich, M., Censor-Hillel, K., et al. (2013) · Distributed Computing · doi:10.1007/s00446-013-0187-y · Cited by 6
Exact results for the roughness of a finite size random walk
Alfi, V., Coccetti, F., Marotta, M., et al. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.020 · Cited by 6
Dynamic phenomena arising from an extended Core Group model
Greenhalgh, D., & Griffiths, M. (2009) · Mathematical Biosciences · doi:10.1016/j.mbs.2009.08.003 · Cited by 6
Ant-based adaptive message forwarding scheme for challenged networks with sparse connectivity
La, R. J., & Ranjan, P. (2009) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2009.5379884 · Cited by 6
Queue Length Stability in Trees Under Slowly Convergent Traffic Using Sequential Maximal Scheduling
Sarkar, S. S., & Kar, K. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2006819 · Cited by 6
A Bayesian Framework-Based End-to-End Packet Loss Prediction in IP Networks
Backhouse, A. G., & Gu, I. Y. (2005) · doi:10.1109/mmse.2004.1 · Cited by 6
Mean Square Analytic Solutions of Random Linear Models
Sanjuán, G. C. (2010) · doi:10.4995/thesis/10251/8721 · Cited by 6
How Experience Confirms the Gambler's Fallacy when Sample Size is NeglectedPreprint
Miller, J. B., & Sanjurjo, A. (2018) · doi:10.31219/osf.io/m5xsk · Cited by 6
Yan, X., Feng, S., Sun, H., & Liu, H. X. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3571966 · Cited by 21
First-Hitting Times Under Additive Drift
Kötzing, T., & Krejca, M. S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99259-4_8 · Cited by 5
Kara, M. (2021) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2021.107965 · Cited by 5
Quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians
Barash, L., Babakhani, A., & Hen, I. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013281 · Cited by 5
Multiple-Task Coded Computing for Distributed Computation Framework: Modeling and Delay Analysis
Ji, Z., Chen, L., Fu, H., Zhao, X., Xu, J., Meng, L., & Liu, J. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3381711 · Cited by 5
Secure Ranging with IEEE 802.15.4z HRP UWB
Luo, X., Kalkanli, C., Zhou, H., Zhan, P., & Cohen, M. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00238 · Cited by 5
Pearl, M., Sergi, B. S., & Muszynski, R. J. (2025) · World · doi:10.3390/world6010034 · Cited by 5
Quantum Algorithm for Exact Monte Carlo Sampling
Destainville, N., Georgeot, B., & Giraud, O. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.250502 · Cited by 5
Weiß, C. H., & Zoubir, A. M. (2014) · IEEE Workshop on Statistical Signal Processing (SSP) · doi:10.1109/ssp.2014.6884647 · Cited by 5
A Novel Approach to Evaluation of Pest Insect Abundance in the Presence of Noise
Embleton, N., & Petrovskaya, N. B. (2014) · Bulletin of Mathematical Biology · doi:10.1007/s11538-014-9940-z · Cited by 5
Dutta, B., Budhiraja, R., & Koilpillai, R. D. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2661999 · Cited by 5
Predicting the Evolution of Controlled Systems Modeled by Finite Markov Processes
Li, S., & Pozzi, M. (2021) · IEEE Transactions on Reliability · doi:10.1109/tr.2021.3067595 · Cited by 5
Batz, P., Ruttor, A., Thiel, S., Wegener, J., Zautke, F., Schwekendiek, C., & Bienefeld, K. (2022) · Biology Methods and Protocols · doi:10.1093/biomethods/bpac005 · Cited by 6
Wu, Y. (2022) · Statistics in Medicine · doi:10.1002/sim.9409 · Cited by 5
Can foreign exchange rates violate Bell inequalities?
Raedt, H. A. D., Katsnelson, M. I., Jattana, M. S., Mehta, V., Willsch, M., Willsch, D., Michielsen, K. F. L., & Jin, F. (2024) · Annals of Physics · doi:10.1016/j.aop.2024.169742 · Cited by 6
Long-Term Feature Extraction via Frequency Prediction for Efficient Reinforcement Learning
Wang, J., Ye, M., Kuang, Y., Yang, R., Zhou, W., Li, H., & Wu, F. H. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3529264 · Cited by 5
Chance-Constrained Gaussian Mixture Steering to a Terminal Gaussian Distribution
Kumagai, N., & Oguri, K. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886105 · Cited by 5
Modeling the Interactions between Discrete and Continuous Causal Factors in Bayesian Networks
Lucas, P., & Hommersom, A. (2015) · International Journal of Intelligent Systems · doi:10.1002/int.21698 · Cited by 5
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks
Zhang, R., Ingelrest, F., Barrenetxea, G., et al. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2391689 · Cited by 5
Raw and central moments of binomial random variables via Stirling numbers
Griffiths, M. (2012) · International Journal of Mathematical Education in Science and Technology · doi:10.1080/0020739x.2012.678899 · Cited by 5
Super-stable Poissonian structures
Eliazar, I. (2012) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/45/41/415103 · Cited by 5
A randomized gossip consensus algorithm on convex metric spaces
Matei, I., Somarakis, C., & Baras, J. S. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426628 · Cited by 5
Intelligently querying incomplete instances for improving classification performance
Sankaranarayanan, K., & Dhurandhar, A. (2013) · Proceedings of the ... ACM International Conference on Information & Knowledge Management · doi:10.1145/2505515.2505570 · Cited by 5
Shanmugam, K., & Caire, G. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284043 · Cited by 5
Effects of model errors on multiple antenna based spectrum sensing using sequential detection
Suratman, F. Y., & Zoubir, A. M. (2013) · International Conference on Communications, Signal Processing, and their Applications (ICCSPA) · doi:10.1109/iccspa.2013.6487263 · Cited by 5
Heuristics, biases and traps in managerial decision making
Gál, P., Milos, M., & Meško, M. (2013) · Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis · doi:10.11118/actaun201361072117 · Cited by 5
Grimmett, G., & Janson, S. (2003) · Random Structures and Algorithms · doi:10.1002/rsa.10092 · Cited by 5
Self-citationFirst-passage properties of bursty random walks
Volovik, D., & Redner, S. (2010) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2010/06/p06018 · Cited by 5
Idempotent copulæ: Ordinal sums and Archimedean copulæ
Albanese, A. A., & Sempi, C. (2016) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2016.02.037 · Cited by 5
Baetica, A.-A., Yuan, Y., Gonçalves, J. M., et al. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402699 · Cited by 5
Du, Q. (2020) · ASEE Annual Conference & Exposition · doi:10.18260/1-2--743 · Cited by 5
Contingency Ranking in Power Systems Via Reliability Rates
Cervantes, C. J. F., Kazemtabrizi, B., & Troffaes, M. C. M. (2018) · IEEE International Conference on Environment and Electrical Engineering and IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe) · doi:10.1109/eeeic.2018.8493853 · Cited by 5
Bounded Entanglement Entropy in the Quantum Ising Model
Grimmett, G. R., Osborne, T. J., & Scudo, P. F. (2019) · Journal of Statistical Physics · doi:10.1007/s10955-019-02432-y · Cited by 5
Self-citationNon-Markovian Stochastic Epidemics in Extremely Heterogeneous Populations
House, T. (2014) · Springer Link (Chiba Institute of Technology) · doi:10.1051/mmnp/20149210/pdf · Cited by 5
A New Framework for Online Testing of Heterogeneous Treatment Effect
Yu, M., Lu, W., & Song, R. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i06.6594 · Cited by 5
Mishura, Y. S., Ralchenko, K., & Shklyar, S. V. (2020) · Risks · doi:10.3390/risks8010011 · Cited by 5
A network formation game for the emergence of hierarchies
Cisneros‐Velarde, P., & Bullo, F. (2021) · PLoS ONE · doi:10.1371/journal.pone.0255990 · Cited by 5
Bounded Entanglement Entropy in the Quantum Ising Model
Grimmett, G., Osborne, T. J., & Scudo, P. F. (2019) · Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover) · doi:10.15488/10530 · Cited by 5
Self-citationUsing spatial patterns of English folk speech to infer the universality class of linguistic copying
Burridge, J., & Blaxter, T. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043053 · Cited by 9
Learning to reflect: A unifying approach for data-driven stochastic control strategies
Christensen, S., Strauch, C., & Trottner, L. (2024) · Bernoulli · doi:10.3150/23-bej1665 · Cited by 5
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
Aspnes, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24100-0_36 · Cited by 5
THE TALENT VERSUS LUCK MODEL AS AN ENSEMBLE OF ONE-DIMENSIONAL RANDOM WALKS
Simão, R., ROSENDO, F., & Wardil, L. L. (2021) · Advances in Complex Systems · doi:10.1142/s0219525921500107 · Cited by 8
Traditional vs. Machine-Learning Techniques for OSM Quality Assessment
Jilani, M., Bertolotto, M., Corcoran, P., & Alghanim, A. (2019) · IGI Global eBooks · doi:10.4018/978-1-5225-8054-6.ch022 · Cited by 5
Bocharov, S. S., Harris, S. C., Kominek, E., Mooers, A. Ø., & Steel, M. (2022) · Systematic Biology · doi:10.1093/sysbio/syac059 · Cited by 5
An algorithmic approach to identify irrelevant information in sequential teams
Mahajan, A., & Tatikonda, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.08.002 · Cited by 5
Design and performance evaluation of a covert timing channel
Archibald, R., & Ghosal, D. (2015) · Security and Communication Networks · doi:10.1002/sec.1336 · Cited by 5
Fast Simulation of Facilitated Spin Models
Ashton, D. J., Hedges, L. O., & Garrahan, J. P. (2006) · Journal of Physics Conference Series · doi:10.1088/1742-6596/40/1/012 · Cited by 5
Forgetfulness can help you win games
Burridge, J., Gao, Y., & Mao, Y. J. (2015) · Physical Review E · doi:10.1103/physreve.92.032119 · Cited by 5
A Lower Bound on Work Extraction Probability Prescribed by Nonequilibrium Work Relation
Yamano, T. (2017) · doi:10.3390/ecea-4-05015 · Cited by 5
Analytic-Numerical Solution of Random Parabolic Models: A Mean Square Fourier Transform Approach
Casabán, M. ‐., Cortés, J. ‐., & Jódar, L. (2018) · Mathematical Modelling and Analysis · doi:10.3846/mma.2018.006 · Cited by 5
Risk Constrained Energy Consumption Control for Commercial Buildings
Raza, A., Khan, M. F. N., & Malik, T. N. (2019) · International Conference on Computing, Mathematics and Engineering Technologies (iCoMET) · doi:10.1109/icomet.2019.8673458 · Cited by 5
A Framework for Formal Dynamic Dependability Analysis Using HOL Theorem Proving
Elderhalli, Y., Hasan, O., & Tahar, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53518-6_7 · Cited by 5
Some factors of nonsingular Bernoulli shifts
Kosloff, Z., & Soo, T. (2021) · Studia Mathematica · doi:10.4064/sm201013-7-4 · Cited by 5
ARQ-Based Symmetric-Key Generation Over Correlated Erasure Channels
Khiabani, Y. S., & Wei, S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2264461 · Cited by 5
A risk analysis of disk backup or repository maintenance
Burgess, M., & Reitan, T. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2006.06.003 · Cited by 5
Enabling Secondary Access through Robust Primary User Channel Assignment
Nasreddine, J. N., Achtzehn, A., Riihijärvi, J., et al. (2010) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2010.5683150 · Cited by 5
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
