Conditioning on the observed time. The native PDF defines as the first production time and then conditions on that production occurring at . If the intended information is its numerical value , the answer depends on . We first compute this conditional probability using a conditional probability density; conditioning on an exact value of a continuous random variable means a density ratio, since .
Before , no molecules of the second chemical species are present, so the joint-removal chemical reaction cannot occur. Molecules of the first chemical species arrive as a rate- Poisson process, and each independently starts a clock with a rate- exponential distribution for producing the first molecule of the second chemical species. Define the unnormalized probability mass functionThe chemical master equation before the first production, with production treated as killing, isMultiplying by and summing gives a partial differential equation for the probability generating function:Its solution, verifiable by direct differentiation, isThus , the survival function is , and the conditional distribution of given survival to is a Poisson distribution of mean .
Production in from Markov chain state has joint probability . Therefore the probability density function of isThe first production leaves unchanged. Taking the density ratio gives a size-biased distribution of the surviving count:In particular, under this reading the requested conditional probability isThe shift by one matters: an observation made exactly when production occurs preferentially selects larger counts, since their production reaction propensity function is larger.
Without observing the numerical time. If the conditioning merely repeats the definition of , the requested probability is instead the unconditional count at that stopping time. Before production, increases by one at rate , while production occurs at rate in Markov chain state . The competing exponential clocks implyThe first factor requires a second arrival before production from count one; the second requires production before a third arrival. The first arrival itself is certain. Production eventually occurs with probability one, as is also clear from . As a consistency check, averaging the time-conditioned answer against givesThese are two distinct, explicitly specified interpretations of the printed conditioning.
Multiply the master equation by and sum over . Shifting indices producesThe apparent negative power causes no problem at when . Let , so . If the rates are polynomials in , replace their arguments by to obtain a finite-order partial differential equation:For arbitrary rates the weighted sums still give an exact generating-function evolution, but need not reduce to a finite-order differential operator. The probability generating function obeyswhich is the normalization condition. The evolution has when the rate sums converge, so an initially normalized distribution stays normalized. Its derivatives at also give the factorial moments, and expansion around recovers individual probabilities.
For the binomial distribution, the binomial theorem givesDifferentiation of the probability generating function recovers the first expected value and second factorial moment:Since , the variance isThusThe formulas also hold for and the degenerate choices , with derivatives read directly from the resulting polynomial.
For a discrete random variable taking nonnegative integer values, its probability generating function isIt is defined at least for . The usual probability generating function is intended for nonnegative integer-valued random variables; a general discrete real-valued random variable need not have this form. The coefficient of recovers .
Differentiate the probability generating function to obtainThe first derivative is the expected value, and the second gives the factorial moment . HenceIn particular, .
Put . Summing the geometric series in the definition of the probability generating function givesThis is the zero-based geometric distribution, counting failures before the first success.
Since , the probability generating function identities giveSubtracting the squared mean yields the variance
The probability generating function of a nonnegative integer-valued random variable isUse , including at . The power series converges absolutely for every real , since . In particular it is always defined on the usual probability-generating interval . It may also be defined for , depending on the radius of convergence and convergence at its endpoints; the precise real domain of finite expectation is .
For , condition on . Its independence from the preserves their independent common distribution, so part (ii) givesFor , this is , agreeing with . By the law of total expectation,This proves the probability generating function of an independent random sum. For nonnegative outside , the same argument is valid whenever the right side is finite, by Tonelli's theorem for nonnegative sums. For signed or complex , a sufficient absolute-convergence condition is ; it holds automatically on . Outside this domain, mere evaluation of an analytically extended expression is not a substitute for existence of the probability generating function.
The probability generating function of a nonnegative integer-valued random variable isusing also at . It is always defined for , and indeed the power series converges absolutely for all real or complex with , becauseIt may be defined beyond the unit disk where this power series converges absolutely; such a larger domain depends on the distribution. In particular and .
For each student, the probability of both falling asleep and dreaming about mathematics is . These indicators are independent across students, so the same Poisson thinning calculation gives, for the requested count ,Explicitly , the probability generating function of that Poisson distribution.
Let indicate that student stays awake. These indicators have independent Bernoulli distributions with parameter , and . The Poisson distribution has probability generating functionThe probability generating function of an independent random sum now givesRecognizing the Poisson distribution,This is Poisson thinning.
Using the two masses of the Bernoulli distribution,This probability generating function is a polynomial, so it exists for every finite .
Summing a geometric series gives the probability generating function of the zero-based geometric distribution:The series converges for , in particular on . At , , , and . The factorial moment identities give and . Thus
For a nonnegative integer-valued random variable , its probability generating function isAt , use so . The series also converges absolutely for complex ; for near zero, its coefficients recover the probability mass function.
A Bernoulli random variable with parameter has . Part (i) and the geometric distribution formula giveComparing coefficients in the probability generating function identifiesThus has the zero-based geometric distribution with success parameter . The probabilities sum to one, and its mean agrees with the random-sum mean .
By definition, the probability generating function isSubstituting the Poisson distribution and evaluating the exponential series givesThe series converges for every finite complex ; in particular it gives the probability generating function on .
For independent random variables, the probability generating function of an independent sum is the product of the individual probability generating functions. ThusExpanding this last expression as identifies each probability coefficient. Therefore
The expected value is the derivative of the probability generating function at one. The expression from part (ii) givesIts finiteness also follows directly from the exponentially decaying geometric probabilities.
Summing a geometric series gives the probability generating functionThe series converges absolutely for . Differentiating the rational expression yields