Use the intended model of independent random variables with exponential distributions of rates . For , independence gives the survival function
Thus
The variance is , obtained from the standard first two exponential moments, and .
For these competing exponential clocks, ties have probability zero. Integrating over Alice's firing time gives
Let denote the event that the next shot hits, and use the stated success probability as . Bill's corresponding conditional success probability is one. The law of total probability gives
The Bayes' theorem therefore yields
The printed assumptions specify the two marginal exponential distributions but do not explicitly specify their independence. The answers above require that extra assumption; marginals alone do not determine the race. For a concrete counterexample, take one and set , . These have the required marginals, but ; if , Alice always fires first and . Thus the independence qualification changes actual answers, rather than merely their derivation.
For , independence factors the survival function of the minimum:
The minimum is nonnegative, and this is exactly the survival function of an exponential distribution. Hence
The parameter here is the rate, rather than the mean. The calculation is the simplest example of competing exponential clocks.
An exponential distribution of rate has density for and zero for , with survival probability . For , its memoryless property follows from
For the minimum, independence gives . Hence
The density is zero for negative . The comparison probability follows from identical continuous laws and zero tie probability; directly it is . These are competing exponential clocks.
For the last density, substitute into the normalizing integral to obtain , the Gaussian integral. Equivalently, each variable has a gamma distribution with shape and rate one. Independence permits convolution of the densities. For ,
Putting turns the integral into . Consequently
This is also the additivity of independent gamma distributions with a common rate: their shapes add to one. Density values at the single endpoint zero are immaterial.
Initially, the infection and recovery transition intensities are and . By competing exponential clocks, the first-event waiting time has distribution
The first event causes extinction precisely when it is recovery of the sole initially infectious individual. An infection would instead give two infectious individuals. The competing exponential clocks calculation therefore gives the first-event extinction probability
The competing exponential clocks calculation gives
so is exponential with rate . Also
Put . Since the variables have continuous distributions, the minimum is unique almost surely. Integrating over its possible value gives
This is the joint tail calculation for competing exponential clocks.
Integrate over the region :
Therefore
This is also the two-clock case of competing exponential clocks. A larger mean time to noise increases this probability, while a larger mean service length decreases it.
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 function
The chemical master equation before the first production, with production treated as killing, is
Multiplying by and summing gives a partial differential equation for the probability generating function:
Its solution, verifiable by direct differentiation, is
Thus , 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 is
The 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 is
The 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 imply
The 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 gives
These are two distinct, explicitly specified interpretations of the printed conditioning.
Compute all three probabilities. From the preceding part, . Integrating the joint probability density function over gives
On one has and , so
Therefore and are independent events. The minimum waiting time and the identity of the first clock are independent for competing exponential clocks; unequal rates change the winner probabilities but do not destroy that independence.