To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

# Borel distribution

Parameters ${\displaystyle \mu \in [0,1]}$ ${\displaystyle n\in \{1,2,3,\ldots \}}$ ${\displaystyle {\frac {e^{-\mu n}(\mu n)^{n-1}}{n!}}}$ ${\displaystyle {\frac {1}{1-\mu }}}$ ${\displaystyle {\frac {\mu }{(1-\mu )^{3}}}}$

The Borel distribution is a discrete probability distribution, arising in contexts including branching processes and queueing theory. It is named after the French mathematician Émile Borel.

If the number of offspring that an organism has is Poisson-distributed, and if the average number of offspring of each organism is no bigger than 1, then the descendants of each individual will ultimately become extinct. The number of descendants that an individual ultimately has in that situation is a random variable distributed according to a Borel distribution.

• 1/1
Views:
5 082
• ✪ Mod-01 Lec-14 THE BOREL-CANTELLI LEMMAS

## Definition

A discrete random variable X  is said to have a Borel distribution[1][2] with parameter μ ∈ [0,1] if the probability mass function of X is given by

${\displaystyle P_{\mu }(n)=\Pr(X=n)={\frac {e^{-\mu n}(\mu n)^{n-1}}{n!}}}$

for n = 1, 2, 3 ....

## Derivation and branching process interpretation

If a Galton–Watson branching process has common offspring distribution Poisson with mean μ, then the total number of individuals in the branching process has Borel distribution with parameter μ.

Let X  be the total number of individuals in a Galton–Watson branching process. Then a correspondence between the total size of the branching process and a hitting time for an associated random walk[3][4][5] gives

${\displaystyle \Pr(X=n)={\frac {1}{n}}\Pr(S_{n}=n-1)}$

where Sn = Y1 + … + Yn, and Y1 … Yn are independent identically distributed random variables whose common distribution is the offspring distribution of the branching process. In the case where this common distribution is Poisson with mean μ, the random variable Sn has Poisson distribution with mean μn, leading to the mass function of the Borel distribution given above.

Since the mth generation of the branching process has mean size μm − 1, the mean of X  is

${\displaystyle 1+\mu +\mu ^{2}+\cdots ={\frac {1}{1-\mu }}.}$

## Queueing theory interpretation

In an M/D/1 queue with arrival rate μ and common service time 1, the distribution of a typical busy period of the queue is Borel with parameter μ. [6]

## Properties

If Pμ(n) is the probability mass function of a Borel(μ) random variable, then the mass function P
μ
(n) of a sized-biased sample from the distribution (i.e. the mass function proportional to nPμ(n) ) is given by

${\displaystyle P_{\mu }^{*}(n)=(1-\mu ){\frac {e^{-\mu n}(\mu n)^{n-1}}{(n-1)!}}.}$

Aldous and Pitman [7] show that

${\displaystyle P_{\mu }(n)={\frac {1}{\mu }}\int _{0}^{\mu }P_{\lambda }^{*}(n)\,d\lambda .}$

In words, this says that a Borel(μ) random variable has the same distribution as a size-biased Borel(μU) random variable, where U has the uniform distribution on [0,1].

This relation leads to various useful formulas, including

${\displaystyle \operatorname {E} \left({\frac {1}{X}}\right)=1-{\frac {\mu }{2}}.}$

## Borel–Tanner distribution

The Borel–Tanner distribution generalizes the Borel distribution. Let k be a positive integer. If X1X2,  … Xk are independent and each has Borel distribution with parameter μ, then their sum W = X1 + X2 + … + Xk is said to have Borel–Tanner distribution with parameters μ and k. [2][6][8] This gives the distribution of the total number of individuals in a Poisson–Galton–Watson process starting with k individuals in the first generation, or of the time taken for an M/D/1 queue to empty starting with k jobs in the queue. The case k = 1 is simply the Borel distribution above.

Generalizing the random walk correspondence given above for k = 1,[4][5]

${\displaystyle \Pr(W=n)={\frac {k}{n}}\Pr(S_{n}=n-k)}$

where Sn has Poisson distribution with mean . As a result, the probability mass function is given by

${\displaystyle \Pr(W=n)={\frac {k}{n}}{\frac {e^{-\mu n}(\mu n)^{n-k}}{(n-k)!}}}$

for n = kk + 1, ... .

## References

1. ^ Borel, Émile (1942). "Sur l'emploi du théorème de Bernoulli pour faciliter le calcul d'une infinité de coefficients. Application au problème de l'attente à un guichet". C. R. Acad. Sci. 214: 452–456.
2. ^ a b Tanner, J. C. (1961). "A derivation of the Borel distribution". Biometrika. 48 (1–2): 222–224. doi:10.1093/biomet/48.1-2.222. JSTOR 2333154.
3. ^ Otter, R. (1949). "The Multiplicative Process". The Annals of Mathematical Statistics. 20 (2): 206–224. doi:10.1214/aoms/1177730031.
4. ^ a b Dwass, Meyer (1969). "The Total Progeny in a Branching Process and a Related Random Walk". Journal of Applied Probability. 6 (3): 682–686. doi:10.2307/3212112. JSTOR 3212112.
5. ^ a b Pitman, Jim (1997). "Enumerations Of Trees And Forests Related To Branching Processes And Random Walks" (PDF). Microsurveys in Discrete Probability: DIMACS Workshop (41).
6. ^ a b Haight, F. A.; Breuer, M. A. (1960). "The Borel-Tanner distribution". Biometrika. 47 (1–2): 143–150. doi:10.1093/biomet/47.1-2.143. JSTOR 2332966.
7. ^ Aldous, D.; Pitman, J. (1998). "Tree-valued Markov chains derived from Galton-Watson processes" (PDF). Annales de l'Institut Henri Poincaré B. 34 (5): 637. CiteSeerX 10.1.1.30.9545. doi:10.1016/S0246-0203(98)80003-4.
8. ^ Tanner, J. C. (1953). "A Problem of Interference Between Two Queues". Biometrika. 40 (1–2): 58–69. doi:10.1093/biomet/40.1-2.58. JSTOR 2333097.
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.