Uncovering the Unreliable Friend Distribution

R-bloggers 2013-05-31

(This article was first published on Probability and statistics blog » r, and kindly contributed to R-bloggers)

Head down to your local hardware store and pick up a smoke detector. Pop off the cover and look inside. You’ll see a label that mentions Americium 241, a radioactive isotope. Put on your HEV suit, grab a pair of tweezers and a fine-tipped pen, and remove the 0.3 millionths of a gram of Americium. If you need reading glasses, now might be a good time to put them. Pick out one of atoms and label it with an X. Now watch closely. Sooner or later, it will spit out an Alpha particle.

Just how long will you have to wait? Decay rates are measured in half-lives, which is the amount of time needed for half of the particles to decay (any particular atom has a 1/2 chance of decaying in this time as well). The stated half-life for this isotope is 432 years, and your waiting time will follow an exponential distribution. The strange, oddly beguiling quality about this distribution is that the conditional probabilities remains constant. In other words, no matter how long you’ve waited, there’s still a 1 in 2 chance that your Americium isotope will decay in the next 432 years. Waiting for an exponentially distributed event to happen leads to an odd feeling, at least for me. The longer you wait, the more you “expect” the event to happen soon, even knowing that your expected wait time never changes. I wrote about that feeling previously, and created an exponential timer you can try out for yourself. I would suggest setting it to less than 432 years.

Cranking uncertainty up to 11 Recently, as I waited patiently for my own particle of Americium to give up its Alpha, I got to thinking about conditional uncertainty. No matter how long we wait for out event, we never get any smarter about when it will happen. But we don’t any dumber, either. Would it be possible, I wondered, to build a kind of “super-exponential” distribution, where the longer we wait, the less we know. In other words, can we take our level of uncertainty up to 11?

Imagine the following scenario: first we sample from a standard uniform distribution, which gives us a number somewhere between 0 and 1. Call this number $U$ . Then we take $U$ (without looking at it!), and plug it into the exponential distribution as the parameter $\lambda$ . This gives us a random variable with a mean waiting time of $\frac{1}{U}$ for the first occurrence. (Note that this mean isn’t the same as the half-life, which is actually the median. To convert from mean to half-life, multiply by the natural log of 2).

My prediction was that this method would increase the overall level of uncertainty about our waiting time, and, even worse, make our uncertainty grow over time. Why? The longer we’ve waited, I figured, the more likely our (presumed) $\lambda$ will be small, which in turn means the expectation and variance of our exponential waiting time grow, widening our confidence intervals.

At this point, I had the vague feeling that this probability distribution should already exist as a known thing, that it may even be a version of something I’ve encountered before. Another way to look at the exponential is in terms of the failure rate, or, conversely, the survival rate. When Ed Norton, the un-named narrator of Fight Club (I know, I know), says that “on a long enough timeline, the survival rate for everyone drops to zero,” this is what he means. Only Norton is referring to the cumulative survival rate, whereas it’s usually most interesting to look at the instantaneous (or marginal, for my economist friends) rate. For the exponential this rate is constant, ie flat. There is a distribution specifically crafted to let you simulate failure rates when the rate itself is variable, it’s called the Weibull. It can be used to model products whose expected durability increases with time (note that we are not saying the product becomes more durable over time, but that the fact that it has survived tells us that it is highly durable). Did I just rediscover the Weibull, or one it’s friends in the same family of extreme distributions?

Before breaking out my great big Compendium of Probability Distributions, I dove right in with a quick Monte Carlo simulation. As with all my posts using R, you’ll find the code at the end of this post.

A wave of plots Here’s the histogram for our sample, with the rightmost tail chopped off (because your screen, unlike mine, is just too damn small):

So it looks like a variant of the exponential, but this plot doesn’t tell us much. To really understand the distribution we have to see it as if we were inside the distribution, waiting for the event to happen. All we know is the process, and we have to come up with a guess about our distribution curve conditional on how long we’ve waited so far. In order to understand this curve, we first need to make a guess about $\lambda$ , which is to say $U$ . Can we put a probability distribution on $U$ given how long we’ve been waiting so far? Yes, we most certainly can! And, because our prior distribution on $U$ is uniform (of course), our posterior is our likelihood. Here’s what our (posterior) curves look like:

Each curve is a probability distribution on our belief about $U$ . In other words, the peaks represent what we believe to be the most likely value for $U$ , given how long we’ve waited so far. The biggest curve is our distribution for $U$ after waiting for one unit of time (let’s just call them “minutes”). As you can tell, if we continue to wait, our maximum likelihood estimate (MLE) for $U$ shifts left, and it looks like our curve flattens out. But wait! Each of these curves has a different area. To treat them like a true probability distribution, we should normalize each of the areas to one. Here’s what those same curves look like after normalization:

From this handsome chart, we can tell that expected range of values for $U$ is narrowing, not broadening. So could our uncertainty be decreasing along with our wait, as we hone in on the true value of $U$ ? Let’s take a look at what happens to our additional wait time as time passes.

You can think of these curves as the chance that your friend will show up in the coming minutes, given how long you’ve already been waiting. At the very beginning of your wait, modeled by the orange curve at the far left, you can be almost certain that your friend will show up in the next 10 minutes. But by the time you’ve been waiting for 500 minutes, as seen in the blue curve at the far right, you are only 50% sure that she will show up in the next 500 minutes. Are those probabilities exact? It seems like it, but let’s zoom in on the first 25 minutes:

The X’s represent the median time for your friend’s arrival. If this was always equal to your wait time so far, all of the X’s would be in a straight line at 0.5. From this plot, it’s clear that this is not the case from the beginning, but only becomes so as you wait longer. So what have we got here? At this point I’m at the limit of what I can get out of Monte Carlo. It’s time to do math! (or not, feel free to skip this next section).

The formula To get the pdf for this distribtion, I start by noting that if we had two possible choices for $\lambda$ with a one-half chance each of being picked, then the probability our waiting time would be less than $x$ would be:

$P(t < x) = \frac{1}{2}(1 - e^{-x \lambda_1}) + \frac{1}{2} (1 - e^{-x \lambda_2})$ where $(1 - e^{-x \lambda_i})$ is the cumulative distribution function (CDF) of the exponential distribution with parameter $\lambda_i$ . If you really know your exponential, you may have noticed some similarities with the hyperexponential distribution, but we’re gonna take it to the limit, and create a kind of hyper-hyperexponential. More generally, for a sample of $\lambda_i$ :

$P(t < x) = \frac{1}{n} \sum_{i=1}^n (1 - e^{-\lambda_i x})$

Since the $\lambda_i$ are uniformly distributed, the more of them we sample, the more our order statistics are going to look like $(\frac{1}{n}, \frac{2}{n}, \frac{3}{n}... \frac{n}{n})$ where our sample size is n (proof is left as an exercise for you, my dear reader).

$P(t < x) = \frac{1}{n}\sum_{i=1}^n (1 - e^{-xi/n})$ Ready to take it to the limit?

$\lim_{n \rightarrow \infty} \frac{1}{n}\sum_{i=1}^n (1 - e^{-xi/n}) = \int_0^1 1 - e^{xt} dt$ Solving this integral, we get:

$F(t) = \frac{e^{-t} + t - 1}{t}$ Did we get it right? Maybe you trust my math, maybe you don’t and skimmed over the last section. Either way, let’s see how well the math matches the data. Here I’ve plotted the log of the observed (Monte Carlo) density versus what the math says it should be:

Looks like we nailed it, no? But wait, why are the blue points at the beginning of the curve in between the red points? That’s because we took the differences between points on the empirical CDF, so each density reading is really in-between the true pdf values. So far as Monte Carlo confirmation goes, it doesn’t get much better than this.

Introducing, the Unreliable Friend Distribution! So far as I can tell, other than the hyperexponential, which is merely similar and more limited, this is a brand new distribution. Have you ever been waiting for someone, and they make you wait, the more you suspect they’ve forgotten about you completely? In that person’s honor, I’m calling this the Unreliable Friend Distribution (UFD).

As seems appropriate for such a distribution, the expected wait time for the UFD is infinite. Which means that no matter how late your unreliable friend shows up, you should be grateful that he came early.

The code:

# Code by Matt Asher for StatisticsBlog.com# Feel free to modify and redistribute, but please keep this header set.seed(943) #I remembered this time! # Initial MC samplingtrials = 10^7results = rexp(trials, runif(trials)) # Plot of liklihood curves for U based on waiting time# colr = sample(colours(), 1000, replace=T) lik = function(p, t){return((1 - p)^(t-1)*p)} # x-values to plotp = seq(0,1,0.0001) # Waiting timest = 1:20 dataMatrix = matrix(nrow=length(t), ncol=length(p)) for(i in t) {dataMatrix[i,]=lik(p,rep(i+1,length(p)))} plot(p, dataMatrix[1,], col=colr[1], pch=".", cex=3, bty="n" ) for(i in 2:max(t)) {points(p, dataMatrix[i,], col=colr[i], pch=".", cex=3)} # Let's standardize the area of each curvestandardMatrix = dataMatrix/rowSums(dataMatrix) plot(p, standardMatrix[1,], col=colr[1], pch=".", cex=3, bty="n", ylim=c(0,max(standardMatrix))) for(i in 2:max(t)) {points(p, standardMatrix[i,], col=colr[i], pch=".", cex=3)} # Find wait time curves conditional on having waited t minutes # We need tail probabilities, let's find them!t = 0:1000tailP = rep(0,max(t))for(i in t) {tailP[(1+i)] = length(results[results>i])/trials} show = seq(1,25,1)  # Blank Plotplot(0,0,col="white", xlim = c(0,2*max(show)), ylim = c(0, 1), ylab="Probability that your friend will have shown up", xlab="Time") for(i in show) {# Normalizing the probabilies so that tailP[i] = 1tmp = tailP[(i+1):(max(t)+1)]tmp = tmp * 1/tmp[1]tmp = 1-tmp print(length(tmp[tmp<.5])) # par(new = TRUE)lines(i:(max(t)), tmp, col=sample(colours(), 1), lwd=3)  # Find the index of the closest tmp to tmp[i]xloc = which.min(abs(tmp[i] - tmp)) # Put a point where we cross time 2t on the curvepoints(i+xloc-1, tmp[i], pch=4, col="black", cex=2, lwd=3) }    plot(0,0,col="white", xlim = c(0,100), ylim = c(0, 0.25)) t = 1:20 tmp = results[results<quantile(results, .99)]for (i in t){par(new = TRUE)plot(density(tmp[tmp>i]), xlim = c(0,100), ylim = c(0, 0.25), col=colr[i], cex=3)} tpdf = function(x) {toReturn = (-x*exp(-x)+1-exp(-x))/x^2    return(toReturn)} tF = function(x) {toReturn = (exp(-x) + x - 1)/xreturn(toReturn)} lengths = rep(0,1000)for(i in 0:1000) {    lengths[(i+1)] = length(results[results>i])} empericalF = 1 - (lengths/trials)empericalf = diff(empericalF) # Because this the the perfect size for the dots!plot(log(tpdf(1:1000)), col=rgb(0,0,1,.2), pch=20, cex=1.3728, xlab="Wait time", ylab="Log of density")points(log(empericalf), col=rgb(1,0,0,.2), pch=20, cex=1.3728)

To leave a comment for the author, please follow the link and comment on his blog: Probability and statistics blog » r.

R-bloggers.com offers daily e-mail updates about R news and tutorials on topics such as: visualization (ggplot2, Boxplots, maps, animation), programming (RStudio, Sweave, LaTeX, SQL, Eclipse, git, hadoop, Web Scraping) statistics (regression, PCA, time series, trading) and more...