The Optimal London Pub Crawl

mapfinallarge-01

In this third of a trinity of posts involving the travelling salesman problem, we finally use the sophisticated algorithms at our disposal as they were intended: drinking with peak efficiency.

With the aid of a well-placed Christmas present detailing the best pubs in London, I found the optimal route around a reasonable subset of them.

Continue reading

Advertisements

Stochastic geometry and the London underground

PoissonPoints

Way back when I was analysing London house price data for the Summer Data Challenge, I made a histogram of the distances from a random point in London to the nearest tube station. I noted that it peaked around half a kilometre, but ignored the shape of the distribution itself. This is an unfortunate faux pas for the accomplished procrastinator, so let’s right that wrong with the help of some stochastic geometry.

Continue reading

Two Come Along at Once

NextvsSubsequentAnnotated

As the old saying goes, you wait ages for a bus and then two come along at once (or more!). Is this true though? My own anecdotal evidence would suggest yes, every single bloody time. However, we love data and maths in this blog almost as much as we hate waiting for the bus, so let’s have a more thorough look at the issue.

Continue reading