Search results

From Maths
Jump to: navigation, search
  • * [[Discrete probability measure]] ==Notes==
    6 KB (941 words) - 14:39, 16 August 2016
  • ...agram to remember. I remember ''ring'' easily (it's what you'd need to "do probability" on, unions and set-subtractions, and the empty set (required to have subtr ==Other Notes==
    3 KB (449 words) - 20:06, 19 August 2016
  • | {{M|\backslash}}-closed<ref name="PTACC">Probability Theory - A comprehensive course - Second Edition - Achim Klenke</ref> ==Notes==
    2 KB (360 words) - 20:43, 15 June 2015
  • ...al{A} }} is a system of subsets of {{M|\Omega}} such that<ref name="PTACC">Probability Theory - A comprehensive course - Achim Klenke</ref>: ==Notes==
    1 KB (165 words) - 20:50, 15 June 2015
  • ==Notes for further claims== ==Notes==
    3 KB (490 words) - 11:38, 21 August 2016
  • See [[Notes:Just what is in a generated sigma-algebra|Just what is in a generated {{Sig ...the [[Power set|power set]] of {{M|\Omega}}) there exists<ref name="PTACC">Probability Theory - A Comprehensive Course - Second Edition - Achim Klenke</ref> a sma
    2 KB (286 words) - 22:02, 17 March 2016
  • '''Note: '''a Dynkin system is also called a "{{M|d}}-system"<ref>Probability and Stochastics - Erhan Cinlar</ref> and the page [[d-system]] just redirec ==Notes==
    1 KB (184 words) - 01:54, 19 March 2016
  • ...\mathcal{D}\subseteq\mathcal{P}(X)}} is a ''Dynkin system''<ref name="PAS">Probability and Stochastics - Erhan Cinlar</ref> on {{M|X}} if: ==Notes==
    719 B (120 words) - 23:22, 2 August 2015
  • ...\mathcal{F}=\sigma(\mathcal{G})}}</ref> we have{{rMIAMRLS}}<ref name="PAS">Probability and Stochastics - Erhan Cinlar</ref>: ==Notes==
    2 KB (328 words) - 13:23, 18 March 2016
  • ! Numerical function on {{M|A}}<ref name="PAS">Probability and Stochastics - Erhan Cinlar</ref> ==Notes==
    1 KB (165 words) - 02:07, 3 August 2015
  • ...ef><ref group="Note">Product sometimes means 'intersection' according to ''Probability and Stochastics - Erhan Cinlar'' - this is Dynkin's own naming system</ref> ==Notes==
    960 B (158 words) - 15:43, 28 August 2015
  • : Also; in probability I can observe an event ''not'' happening, this suggests I might actually wa ==Notes (yes on a notes page)==
    5 KB (771 words) - 03:06, 21 March 2016
  • * Let {{M|X\sim\text{Geometrically}(p)}} where {{M|p}} is the [[probability]] of an event happening. ** {{M|1=\mathbb{P}\left[X=n\right]=(1-p)^{n-1}p}} - that is the probability of an event not happing {{M|n-1}} times, then happening on the {{M|n^\text{
    968 B (171 words) - 19:37, 2 June 2016
  • ! [[Ring of sets|Ring]]<ref name="PTACC">Probability Theory - A comprehensive course - second edition - Achim Klenke</ref>{{rMTH ==Notes==
    4 KB (573 words) - 20:00, 19 August 2016
  • {{Stub page|grade=A**|msg=This page is a stub and just notes, it needs to be done formally and fleshed out [[User:Alec|Alec]] ([[User ta ...l that {{MM|\E{X}:\eq\int^\infty_0 xf(x)\mathrm{d}x}} for {{M|f(x)}} the [[probability density function]].
    1 KB (246 words) - 21:29, 11 January 2018
  • |data1=[[Discrete probability distribution|Discrete]], over {{M|\mathbb{N}_{\ge 0} }} |label2=[[Probability mass function|p.m.f]]
    8 KB (1,401 words) - 00:52, 20 July 2018
  • Define a [[probability space]], {{M|(S,\Omega,\mathbb{P})}} as follows: ==PAGE NOTES==
    7 KB (1,100 words) - 19:36, 13 September 2017
  • Let {{M|f(x)}} be a [[probability density function|p.d.f]] for which computing {{M|F^{-1}(x)}} is either diff ...{h(x)}{\int_Ah(t)\mathrm{d}t} }} - note that this makes {{M|g}} itself a [[probability density function|p.d.f]]
    3 KB (484 words) - 00:18, 1 October 2017
  • #* For example, there were 38 values of six, if random we'd expect the probability of any individual 6 value being recorded in any particular digit as 1/5 ==Notes==
    5 KB (670 words) - 15:05, 2 October 2017
  • ** [[Geometric distribution]] - a [[probability distribution]] with ties to geometric sequences. ==Notes==
    3 KB (494 words) - 23:08, 6 October 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)