Gambler's ruin in Astro and the accuracy of Gaussian approximation [3]
Patrick Saux
Last updated on
Nov 14, 2022
7 min read
In the previous posts, we calculated the distribution of the so-called “flight time” , interpreted as the (random) number of Astro card a player can scratch before loosing more than their initial investment (typically is €2), both in closed-form under a continuous time Gaussian setting and empirically using random simulations of the exact Astro loss random walk. These two approaches showed that , where is the average loss of random walk step, was a good estimation of ; in the case of Astro, this estimate is . We now show that this estimation is actually correct. We will actually prove a more general result, namely a closed-form expression of the Laplace transform of , based on the method of martingales already used in the Gaussian approximation.
We recall that denotes a i.i.d sequence of random Astro losses and let
be the cumulative loss after steps, and that the flight time is defined by the equation
What goes wrong in the method of martingales for discrete random walks?
In the continuous time Gaussian setting, we replaced and with and satisfying the stochastic differential equation , driven by a Brownian motion . Then for any ,
defines a martingale and a standard application of Doob’s optional stopping theorem showed that . Now in general, this gives information on two random variables simultaneously: and . The whole trick is to disentangle the contribution of each of these variables and extract the Laplace transform of , which is for . In the continuous time setting, the almost sure continuity of and the definition of shows that (almost surely), which is not random at all, thus revealing information directly on .
By contrast, the discrete time counterpart does not satisfy a similar equality in general, but only the inequality . Worse, the distribution of can be quite difficult to characterise as there are potentially many different sequences of steps that result in crossing the barrier . In a special case of step distribution however, takes a simple form, namely if the process can only increase by a fixed step size, or decrease by multiples of the same step size. More precisely, let , such that for all and , and define the i.i.d. step sequence by
Indeed, this forces the process to move over the grid , and since and can only increase by , this implies that can only take a single value corresponding to and , i.e. , where denotes the ceil operator (smallest integer larger than ).
As it turns out, this rather specific property is satisfied by the Astro step distribution: is equal to €2 minus the gain of the -th ticket, and since all gains are multiple of €2, with a minimum of 0€, the above property holds with equal to €2 and the corresponding gain probabilities.
Exponential supermartingale and expected flight time
Using the property that , the martingale method developed in the first part for the Gaussian approximation can be applied to the process essentially unchanged. Let denote a generic random variable following the Astro step distribution and define
Then, for any , the process defined for by is a martingale. Using the expression of the step size sequence, we have
Moreover, by convexity and Jensen’s inequality, where
and hence .
The same arguments as for the Gaussian approximation (dominated convergence, Doob’s optional stopping theorem) apply and show that . Noting that is invertible and using the change of variable , we deduce that
which is the expression of the Laplace transform of . To obtain the expected flight time , we differentiate with respect to , which gives
since .
The term can be calculated using the inverse function rule, which yields . A direct calculation shows that
and thus . Going back to the expected flight time, we have
In particular for the Astro distribution, ; in other words, , i.e. the Gaussian approximation was actually correct in expectation!
Going further: higher moments
Thanks to the exact calculation of the Laplace transform of , it is possible to derive higher moments by differentiating multiple times. A key observation is that the function fully describes the cumulants of the distribution of , which are an alternative to moments (intuitively, the -th cumulant is the component of the -th moment that is “independent” of the previous moments; for instance, is the variance of rather than ). More formally, the cumulants are defined by the power series expansion
in particular . Therefore, by successive differentiations of or , we can obtain the successive moments or cumulants of .
For instance, applying twice the inverse function rule yields
and thus the variance of is
where is the standard deviation of . As it turns out, this is also exactly the formula provided by the inverse Gaussian distribution , i.e. !
A natural question is whether higher moments/cumulants are also well approximated by the inverse Gaussian distribution. Intuitively, this should not be the case since the Gaussian distribution used in this approximation only matches the first two moments of , which is also suggested by the empirical analysis performed in the second post. We confirm this by an explicit calculation of the third cumulant of .
Indeed, on the one hand, the third cumulant of the inverse Gaussian distribution is given by
On the other hand, yet another application of the inverse function rule shows that
and thus
where is the third cumulant of . In other words, negative skewness in the true Astro distribution translates into higher skewness in the flight time distribution than the inverse Gaussian approximation suggests.
Conclusion
We can summarize the Gaussian approximation using the diagram below. Moving from the true Astro step variable to its continuous time Gaussian approximation preserves both mean and variance (as these are the two degrees of freedom of a Gaussian distribution), and this moment matching property is transferred at the level of flight times. However, this commutative diagram does not hold for higher order moments.