**How was NY Pizza Suprema?**

- Average (51%, 23 Votes)
- Good (31%, 14 Votes)
- Excellent (11%, 5 Votes)
- Poor (7%, 3 Votes)
- Never Again (0%, 0 Votes)

Total Voters: **45**

Aggregated results.

Results from individual previous polls are below. Continue reading

**How was NY Pizza Suprema?**

- Average (51%, 23 Votes)
- Good (31%, 14 Votes)
- Excellent (11%, 5 Votes)
- Poor (7%, 3 Votes)
- Never Again (0%, 0 Votes)

Total Voters: **45**

Loading …

Aggregated results.

Results from individual previous polls are below. Continue reading

A friend of mine has told me on numerous occasions that since 1960 the Yankees have not won a World Series while a Republican was President. Upon hearing this my Republican friends (both Yankee and Red Sox fans) turn incredulous and say that this is ridiculous. So I decided to investigate. To be clear this is in no way shows causality, but just checks the numbers.

The data was easily attainable so it really came down to plotting.

The plot above shows every Yankee win (and loss) since 1960 and the party of the President at the time. It is clear to see that all nine Yankees World Series wins came while a Democrat inhabited the White House. The fluctuation plot below shows Yankee wins both before and after 1960 and the complete lack of a block for Republican/Post-1960 simply makes the case.

There are similar plots for the American League after the jump.

**How was Pizza Mercato?**

- Good (46%, 6 Votes)
- Average (31%, 4 Votes)
- Never Again (15%, 2 Votes)
- Poor (8%, 1 Votes)
- Excellent (0%, 0 Votes)

Total Voters: **13**

Loading …

Wes McKinney and I are hosting our first ever Open Statistical Programming meetup tomorrow night after taking over for Drew Conway. Please attend, have some pizza, enjoy the talk then come out for some beer.

This meetup is about EDA, Visualization and Collaboration on the Web and will be presented by Carlos Scheidegger from AT&T Labs.

This month’s pizza will be from Pizza Mercato in the Village.

Couldn’t resist showing off this article in Wired Magazine that quotes me. It’s a good take on the new, semi-corporate hacking culture, but then again, I may be a bit biased.

http://www.wired.com/business/2012/06/hackathons-arent-just-for-hacking/

With tonight’s Mega Millions jackpot estimated to be over $640 million there are long lines of people waiting to buy tickets. Of course you always hear about the probability of winning which is easy enough to calculate: Five numbers ranging from 1 through 56 are drawn (without replacement) then a sixth ball is pulled from a set of 1 through 46. That means there are choose(56, 5) * 46 = 175,711,536 possible different combinations. That is why people are constantly reminded of how unlikely they are to win.

But I want to see how likely it is that SOMEONE will win tonight. So let’s break out R and ggplot!

As of this afternoon it was reported (sorry no source) that two tickets were sold for every American. So let’s assume that each of these tickets is an independent Bernoulli trial with probability of success of 1/175,711,536.

Running 1,000 simulations we see the distribution of the number of winners in the histogram above.

So we shouldn’t be surprised if there are multiple winners tonight.

The R code:

winners <- rbinom(n=1000, size=600000000, prob=1/175000000) qplot(winners, geom="histogram", binwidth=1, xlab="Number of Winners")

This year’s Pi Cake courtesy of Chrissie Cook:

Side View:

And don’t forget this is Albert Einstein’s birthday was well.

How are you celebrating this fantastic geek holiday?

Like last year, the NYC Data Mafia will be out celebrating with (round) pizza.

Shortly after the Giants fantastic defeat of the Patriots in Super Bowl XLVI (I was a little disappointed that Eli, Coughlin and the Vince Lombardi Trophy all got off the parade route early and the views of City Hall were obstructed by construction trailers, but Steve Weatherford was awesome as always) a friend asked me to settle a debate amongst some people in a Super Bowl pool.

He writes:

We have 10 participants in a superbowl pool. The pool is a “pick the player who scores first” type pool. In a hat, there are 10 Giants players. Each participant picks 1 player out of the hat (in no particular order) until the hat is emptied. Then 10 Patriots players go in the hat and each participant picks again.

In the end, each of the 10 participants has 1 Giants player and 1 Patriots player. No one has any duplicate players as 10 different players from each team were selected. Pool looks as follows:

Participant 1 | Giant A | Patriot Q |

Participant 2 | Giant B | Patriot R |

Participant 3 | Giant C | Patriot S |

Participant 4 | Giant D | Patriot T |

Participant 5 | Giant E | Patriot U |

Participant 6 | Giant F | Patriot V |

Participant 7 | Giant G | Patriot W |

Participant 8 | Giant H | Patriot X |

Participant 9 | Giant I | Patriot Y |

Participant 10 | Giant J | Patriot Z |

Winners = First Player to score wins half the pot. First player to score in 2nd half wins the remaining half of the pot.

The question is, what are the odds that someone wins

Boththe 1st and 2nd half. Remember, the picks were random.

Before anyone asks about the safety, one of the slots was for Special Teams/Defense.

There are two probabilistic ways of thinking about this. Both hinge on the fact that whoever scores first in each half is both independent and not mutually exclusive.

First, let’s look at the two halves individually. In a given half any of 20 players can score first (10 from the Giants and 10 from the Patriots) and an individual participant can win with two of those. So a participant has a 2/20 = 1/10 chance of winning a half. Thus that participant has a (1/10) * (1/10) = 1/100 chance of winning both halves. Since there are 10 participants there is an overall probability of 10 * (1/100) = 1/10 of any single participant winning both halves.

The other way is to think a little more combinatorically. There are 20 * 20 = 400 different combinations of players scoring first in each half. A participant has two players which are each valid for each half giving them four of the possible combinations leading to a 4 / 400 = 1/100 probability that a single participant will win both halves. Again, there are 10 participants giving an overall 10% chance of any one participant winning both halves.

Since both methods agreed I am pretty confidant in the results, but just in case I ran some simulations in R which you can find after the break.

With the Super Bowl only hours away now is your last chance to buy your boxes. Assuming the last digits are not assigned randomly you can maximize your chances with a little analysis. While I’ve seen plenty of sites giving the raw numbers, I thought a little visualization was in order.

In the graph above (made using ggplot2 in R, of course) the bigger squares represent greater frequency. The axes are labelled “Home” and “Away” for orientation, but in the Super Bowl that probably doesn’t matter too much, especially considering that Indianapolis is (Peyton) Manning territory so the locals will most likely be rooting for the Giants. Further, I believe Super Bowl XLII, featuring the same two teams, had a disproportionate number of Giants fans. Bias disclaimer: GO BIG BLUE!!!

Below is the same graph broken down by year to see how the distribution has changed over the past 20 years.

All the data was scraped from Pro Football Reference. All of my code and other graphs that didn’t make the cut are at my github site.

As always, send any questions my way.

Taking a break from my normal exposition on stats, New York or pizza I’d like to espouse the wonders of baking soda and vinegar!

My sink was clogged, not with anything specific, but just years worth of gunk. So after scraping out what I could with my hands and a wire hanger–and wanting to avoid caustic chemicals like Drano–I searched the Internet to see if Listerene or Coca-Cola might do the trick. But extensive searching led me to baking soda and vinegar.

It’s very simple: Stuff a half cup of baking soda into the train then pour a half cup of vinegar down it, return the sink stopper and wait 15 minutes. Then pour down another half cup of vinegar, close the stopper and wait another 15 minutes. After that pour a gallon (a tea kettle’s worth) of boiling water down the drain and you’re done! Not only will it unclog your drain, it leaves all the chrome shining like new!

For those of us who never got to make a model volcano in science class it was really awesome watching the baking soda and vinegar react