Abstract
A random vector (Y 1, ..., Y k ) is multinomial (n;p 1, ..., p k ) when
where EquationSource<m:math display='block'> <m:mrow> <m:mstyle displaystyle='true'> <m:munderover> <m:mo>∑</m:mo> <m:mrow> <m:mi>j</m:mi><m:mo>=</m:mo><m:mn>1</m:mn> </m:mrow> <m:mi>k</m:mi> </m:munderover> <m:mrow> <m:msub> <m:mi>p</m:mi> <m:mi>j</m:mi> </m:msub> </m:mrow> </m:mstyle><m:mo>=</m:mo><m:mn>1</m:mn> </m:mrow> </m:math> ]]</EquationSource><EquationSource Format="TEX"><![CDATA[$$\sum\limits_{j = 1}^k {{p_j}} = 1$$ and all p j′s are nonnegative. Y 1 is said to be binomial (n, p 1).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Devroye, L. (1986). Auxiliary Results from Probability Theory. In: Lecture Notes on Bucket Algorithms. Progress in Computer Science, vol 6. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4899-3531-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4899-3531-1_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3328-8
Online ISBN: 978-1-4899-3531-1
eBook Packages: Springer Book Archive