Category:Probability theorems
 | Computing portal |
Here is a list of articles in the category Probability theorems of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
P
T
Pages in category "Probability theorems"
The following 101 pages are in this category, out of 101 total.
A
- Algorithmic Lovász local lemma (computing)
- Anderson's theorem (computing)
- Arrival theorem (computing)
- Aumann's agreement theorem (computing)
B
- Bapat–Beg theorem (computing)
- Bartlett's theorem (computing)
- Bayes' theorem (computing)
- Bertrand's ballot theorem (computing)
- Binomial sum variance inequality (computing)
- Borel–Cantelli lemma (computing)
- Burke's theorem (computing)
C
- Cameron–Martin theorem (computing)
- Campbell's theorem (probability) (computing)
- Central limit theorem (computing)
- Characterization of probability distributions (computing)
- Chung–Erdős inequality (computing)
- Condorcet's jury theorem (computing)
- Continuous mapping theorem (computing)
- Contraction principle (large deviations theory) (computing)
- Coupon collector's problem (computing)
- Cox's theorem (computing)
- Cramér–Wold theorem (computing)
- Cramér's decomposition theorem (computing)
- Cramér’s decomposition theorem (computing)
- Cramér's theorem (large deviations) (computing)
- Craps principle (computing)
D
- Dawson–Gärtner theorem (computing)
- De Finetti's theorem (computing)
- Disintegration theorem (computing)
- Dominated convergence theorem (computing)
- Donsker's theorem (computing)
- Doob's martingale convergence theorems (computing)
- Doob–Dynkin lemma (computing)
- Doob–Meyer decomposition theorem (computing)
- Dynkin's formula (computing)
- Dynkin's lemma (computing)
E
- Engelbert–Schmidt zero–one law (computing)
F
- Feldman–Hájek theorem (computing)
- Feller's coin-tossing constants (computing)
- Fernique's theorem (computing)
- Freidlin–Wentzell theorem (computing)
G
- Gleason's theorem (computing)
- Glivenko's theorem (probability theory) (computing)
- Glivenko–Cantelli theorem (computing)
- Gordon–Newell theorem (computing)
H
- Hadwiger's theorem (computing)
- Hammersley–Clifford theorem (computing)
- Helly–Bray theorem (computing)
- Hewitt–Savage zero–one law (computing)
- Heyde theorem (computing)
I
- Infinite monkey theorem (computing)
- Integral representation theorem for classical Wiener space (computing)
- Isolation lemma (computing)
- Isserlis' theorem (computing)
- Itô's lemma (computing)
J
- Jessen–Wintner theorem (computing)
K
- Kakutani's theorem (measure theory) (computing)
- Karhunen–Loève theorem (computing)
- Kolmogorov's three-series theorem (computing)
- Kolmogorov's two-series theorem (computing)
- Kolmogorov's zero–one law (computing)
- Krylov–Bogolyubov theorem (computing)
- Kunita–Watanabe inequality (computing)
L
- Laplace principle (large deviations theory) (computing)
- Law of large numbers (computing)
- Law of total probability (computing)
- Le Cam's theorem (computing)
- Leftover hash lemma (computing)
- Lévy's continuity theorem (computing)
- Lévy's modulus of continuity theorem (computing)
- Lovász local lemma (computing)
- Lukacs's proportion-sum independence theorem (computing)
- Lyapunov's central limit theorem (computing)
M
- Marcinkiewicz–Zygmund inequality (computing)
- Markov chain central limit theorem (computing)
- Markov–Krein theorem (computing)
- Martingale representation theorem (computing)
- Maximal ergodic theorem (computing)
- Maxwell's theorem (computing)
O
- Optional stopping theorem (computing)
P
- Palm–Khintchine theorem (computing)
- Pickands–Balkema–de Haan theorem (computing)
- Poisson limit theorem (computing)
- Poisson scatter theorem (computing)
R
- Raikov's theorem (computing)
- Reversed compound agent theorem (computing)
- Reversible diffusion (computing)
S
- Schuette–Nesbitt formula (computing)
- Sklar's theorem (computing)
- Skorokhod's embedding theorem (computing)
- Skorokhod's representation theorem (computing)
- Slutsky's theorem (computing)
- Spitzer's formula (computing)
- Stein's lemma (computing)
- Structure theorem for Gaussian measures (computing)
T
- Tanaka's formula (computing)
- Tilted large deviation principle (computing)
U
- Uniform convergence in probability (computing)
V
- Varadhan's lemma (computing)
W
- Wendel's theorem (computing)
- Wiener–Khinchin theorem (computing)
Mathematics
Organizations
Books
About