The DOI matches its Crossref record.
Probability Theory: Independence, Interchangeability, Martingales
Abstract
1 Classes of Sets, Measures, and Probability Spaces.- 1.1 Sets and set operations.- 1.2 Spaces and indicators.- 1.3 Sigma-algebras, measurable spaces, and product spaces.- 1.4 Measurable transformations.- 1.5 Additive set functions, measures, and probability spaces.- 1.6 Induced measures and distribution functions.- 2 Binomial Random Variables.- 2.1 Poisson theorem, interchangeable events, and their limiting probabilities.- 2.2 Bernoulli, Borel theorems.- 2.3 Central limit theorem for binomial random variables, large deviations.- 3 Independence.- 3.1 Independence, random allocation of balls into cells.- 3.2 Borel-Cantelli theorem, characterization of independence, Kolmogorov zero-one law.- 3.3 Convergence in probability, almost certain convergence, and their equivalence for sums of independent random variables.- 3.4 Bernoulli trials.- 4 Integration in a Probability Space.- 4.1 Definition, properties of the integral, monotone convergence theorem.- 4.2 Indefinite integrals, uniform integrability, mean convergence.- 4.3 Jensen, Holder, Schwarz inequalities.- 5 Sums of Independent Random Variables.- 5.1 Three series theorem.- 5.2 Laws of large numbers.- 5.3 Stopping times, copies of stopping times, Wald's equation.- 5.4 Chung-Fuchs theorem, elementary renewal theorem, optimal stopping.- 6 Measure Extensions, Lebesgue-Stieltjes Measure,Kolmogorov Consistency Theorem.- 6.1 Measure extensions, Lebesgue-Stieltjes measure 165 6.2 Integration in a measure space.- 6.3 Product measure, Fubini's theorem, n-dimensional Lebesgue-Stieltjes measure.- 6.4 Infinite-dimensional product measure space, Kolmogorov consistency theorem.- 6.5 Absolute continuity of measures, distribution functions Radon-Nikodym theorem.- 7 Conditional Expectation, Conditional Independence, Introduction to Martingales.- 7.1 Conditional expectations.- 7.2 Conditional probabilities, conditional probability measures.- 7.3 Conditional independence, interchangeable random variables.- 7.4 Introduction to martingales.- 7.5 U-statistics.- 8 Distribution Functions and Characteristic Functions.- 8.1 Convergence of distribution functions, uniform integrability, Helly-Bray theorem.- 8.2 Weak compactness, Frechet-Shohat, GlivenkoCantelli theorems.- 8.3 Characteristic functions, inversion formula, Levy continuity theorem.- 8.4 The nature of characteristic functions, analytic characteristic functions, Cramer-Levy theorem.- 8.5 Remarks on k-dimensional distribution functions and characteristic functions.- 9 Central Limit Theorems.- 9.1 Independent components.- 9.2 Interchangeable components.- 9.3 The martingale case.- 9.4 Miscellaneous central limit theorems.- 9.5 Central limit theorems for double arrays.- 10 Limit Theorems for Independent Random Variables.- 10.1 Laws of large numbers.- 10.2 Law of the iterated logarithm.- 10.3 Marcinkiewicz-Zygmund inequality, dominated ergodic theorems.- 10.4 Maxima of random walks.- 11 Martingales.- 11.1 Uperossing inequality and convergence.- 11.2 Martingale extension of Marcinkiewicz-Zygmund inequalities.- 11.3 Convex function inequalities for martingales.- 11.4 Stochastic inequalities.- 12 Infinitely Divisible Laws.- 12.1 Infinitely divisible characteristic functions.- 12.2 Infinitely divisible laws as limits.- 12.3 Stable laws.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Foundations of Modern Probability
Kallenberg, O. (2021) · Probability Theory and Stochastic Modelling · doi:10.1007/978-3-030-61871-1 · Cited by 2,832
Huang, M., Caines, P. E., & Malhame, R. P. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.904450 · Cited by 1,091
Semiparametric regression for the mean and rate functions of recurrent events
Lin, D. Y., Wei, L. J., Yang, I., & Ying, Z. (2000) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00259 · Cited by 969
Wavelet Threshold Estimators for Data with Correlated Noise
Johnstone, I. M., & Silverman, B. W. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00071 · Cited by 833
Elements of Large-Sample Theory
Strawderman, W. E., Lehmann, E. L., & Holmes, S. P. (2012) · Selected Works of E. L. Lehmann · doi:10.1007/978-1-4614-1412-4_97 · Cited by 818
Stability, queue length, and delay of deterministic and stochastic queueing networks
Chang, C.-S. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.284868 · Cited by 815
Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and Scheduling
Hochwald, B. M., Marzetta, T. L., & Tarokh, V. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833345 · Cited by 674
Li, T., & Zhang, J.-F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2042982 · Cited by 606
Large-scale matrix factorization with distributed stochastic gradient descent
Gemulla, R., Nijkamp, E., Haas, P. J., & Sismanis, Y. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020426 · Cited by 589
Deviations from Purchasing Power Parity in the Long Run
ADLER, M., & LEHMANN, B. (1983) · The Journal of Finance · doi:10.1111/j.1540-6261.1983.tb03835.x · Cited by 495
Distributed tracking control of leader–follower multi-agent systems under noisy measurement
Hu, J., & Feng, G. (2010) · Automatica · doi:10.1016/j.automatica.2010.05.020 · Cited by 488
Li, T., & Zhang, J.-F. (2009) · Automatica · doi:10.1016/j.automatica.2009.04.017 · Cited by 453
A characterization of the distributions that imply mean—Variance utility functions
Chamberlain, G. (1983) · Journal of Economic Theory · doi:10.1016/0022-0531(83)90129-1 · Cited by 434
Huang, M., & Manton, J. H. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/06067359x · Cited by 401
A Three-step Method for Choosing the Number of Bootstrap Repetitions
Andrews, D. W. K., & Buchinsky, M. (2000) · Econometrica · doi:10.1111/1468-0262.00092 · Cited by 306
Metadata
- Authors
- Lund, R. B., Chow, Y. S., & Teicher, H.
- Venue
- Journal of the American Statistical Association
- Publisher
- JSTOR
- Published
- 1998-12
- Volume
- 93
- Issue
- 444
- Pages
- 1528
- ISSN
- 0162-1459 (ISSN-L)
- OpenAlex
- W1981121741
- Cited by
- 1,066
- References
- 0
- FWCI
- 37.24
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.