Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sufficient statistic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Bernoulli distribution=== If ''X''<sub>1</sub>, ...., ''X''<sub>''n''</sub> are independent [[Bernoulli trial|Bernoulli-distributed]] random variables with expected value ''p'', then the sum ''T''(''X'') = ''X''<sub>1</sub> + ... + ''X''<sub>''n''</sub> is a sufficient statistic for ''p'' (here 'success' corresponds to ''X''<sub>''i''</sub> = 1 and 'failure' to ''X''<sub>''i''</sub> = 0; so ''T'' is the total number of successes) This is seen by considering the joint probability distribution: :<math> \Pr\{X=x\}=\Pr\{X_1=x_1,X_2=x_2,\ldots,X_n=x_n\}.</math> Because the observations are independent, this can be written as :<math> p^{x_1}(1-p)^{1-x_1} p^{x_2}(1-p)^{1-x_2}\cdots p^{x_n}(1-p)^{1-x_n} </math> and, collecting powers of ''p'' and 1 β ''p'', gives :<math> p^{\sum x_i}(1-p)^{n-\sum x_i}=p^{T(x)}(1-p)^{n-T(x)} </math> which satisfies the factorization criterion, with ''h''(''x'') = 1 being just a constant. Note the crucial feature: the unknown parameter ''p'' interacts with the data ''x'' only via the statistic ''T''(''x'') = Ξ£ ''x''<sub>''i''</sub>. As a concrete application, this gives a procedure for distinguishing a [[Fair coin#Fair results from a biased coin|fair coin from a biased coin]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)