Patrick's interests

Patrick's posts

Post has attachment

Public

Had fun figuring out how to implement dynamic Voronoi diagrams in Scratch. I currently have a couple of students working on this as a project, so I figured I better see it was actually possible!

Code here: https://scratch.mit.edu/projects/140079245/

Code here: https://scratch.mit.edu/projects/140079245/

Post has attachment

Public

Thanks to Sir +Timothy Gowers, I always preface integration by parts with the method of

http://mrhonner.com/archives/7544#comment-1815

*successive approximation*.http://mrhonner.com/archives/7544#comment-1815

Post has attachment

Public

Apparently 20 years ago Bret Victor made an ASCII-based

https://www.youtube.com/watch?v=LXZVHxtFjg0

*Street Fighter*game. Because he's Bret Victor.https://www.youtube.com/watch?v=LXZVHxtFjg0

Post has shared content

Public

**Predicting the election: a bit of information**

Right now Nate Silver's site

**FiveThirtyEight**says Hillary Clinton has a 64.2% chance of winning the election, while Sam Wang's

**Princeton Election Consortium**says she has more than a 99% chance.

The obvious question is: who is right?

But that's not a very good question. For starters, maybe neither is right!

A more reasonable question is: who is closer to being right?

But even this is very tricky. For starters, it's hard to define

*what it means*to be right about such an estimate. Probability and statistics are slippery subjects. And a probabilistic prediction about

*a single event that will never be repeated*is about as slippery as it gets.

If you have technical ideas about why Nate Silver and Sam Wang get such different results, I'd be happy to hear them. Silver keeps saying that outcomes for different states are highly correlated, so that if the polls are wrong enough to change the outcome in one state, it's more likely to happen in others. It's true that if the states were completely

*uncorrelated*, we could be extremely sure about the election by now. But what exactly is Silver's model of correlation? And what is Wang's? And is this enough to explain the difference?

But if you want to discuss politics, don't do it here. There are enough other places to do that - like, the whole fucking internet. Any word endorsing or criticizing a candidate will be enough to get your comment deleted.

Personally I just have a tiny contribution to make here. I can only answer this question:

How much information would you get if you suddenly learned that Hillary Clinton had a 64.2% chance of being elected? Or a 99% chance?

This is what the concept of

**relative information**is good for. It's

*relative*, because how much information you get depends on what you believe beforehand.

If you thought that Clinton had a probability q of winning, and you learn that Clinton has a probability p of winning, you have gained this much information:

p log(p/q) + (1-p) log((1-p)/(1-q))

For example, suppose you started out thinking the candidates each have a 50% of winning. That's a reasonable assumption if you just came from Mars and are completely ignorant about the situation. Then q = 1/2, so the formula above becomes

p log(2p) + (1-p) log(2(1-p))

If we do the logarithms here in base 2, we are measuring the information in

**bits**. Then we can simplify the formula and get

1 + p log(p) + (1-p) log(1-p)

For example, suppose you learn that yes, Clinton indeed has a 50% chance of winning! Then p = 1/2 and the formula above gives 0. I will spare you the calculation, but this makes sense: you have gained no information. You thought Clinton had a 50% chance of winning, and you learned that's right, so you learned nothing new.

Or, suppose you read Nate Silver's blog and discover that Clinton has a 64.2% chance of winning. Then you've gotten this many bits of information:

1 + 0.642 log(0.642) + (1 - 0.642) log(1 - 0.642)

That's about 0.06 bits of information! Not much!

And I think it's very fascinating that such a smart guy could analyze so much polling data about the election and only feel able to extract 0.06 bits of information about this all-important question:

*who will win?*

It shows an amazing lack of confidence. But that may be a good thing. I wish I knew.

If you believe Sam Wang's blog, on the other hand, you'll discover that Clinton has an over 99% chance of winning. If we say it's 99%, then you've gotten this many bits of information:

1 + 0.99 log(0.99) + (1 - 0.99) log(1 - 0.99)

That's about 0.92 bits. In other words, almost the complete answer to the question.

All this illustrates the power, and value, of a single bit of information. Claude Shannon realized early on that if you have one bit of information that other people don't know, and you can get them to bet on it, you can double your money - on average.

Similarly, an investor who gets 1/5 a bit of such information can expect to multiply her money by 2 to the 1/5 power, which is almost 1.15. So, one fifth a bit of 'actionable information' per year is enough to make a 15% annual return!

For more on relative information, see this:

https://en.wikipedia.org/wiki/Kullback-Leibler_divergence

It goes by a lot of other names, like

**Kullback-Leibler divergence**- but I find that name hopelessly obscure. For Nate Silver's election predictions, go here:

http://projects.fivethirtyeight.com/2016-election-forecast/

It's changed a bit while I was writing this post! For Sam Wang's, go here:

http://election.princeton.edu/todays-electoral-vote-histogram/

#information #informationtheory

Post has attachment

Post has attachment

Public

"I Love Teaching Math; Maybe You Will Too", my essay encouraging math students to consider teaching as a career, appears in the latest issue of Math Horizons, a publication of the Mathematical Association of America. In addition to being in print, it is freely available online at the Aftermath blog!

http://horizonsaftermath.blogspot.com/2016/10/i-love-teaching-math-maybe-you-will-too.html

http://horizonsaftermath.blogspot.com/2016/10/i-love-teaching-math-maybe-you-will-too.html

Post has attachment

Public

Talked about rectilinear motion today in AP Calculus. As usual, Desmos came in handy.

Post has attachment

Public

In an attempt to salvage something from this dreadful election, I've written a piece for the NYT Learning Network to get students thinking about how to use data to predict the winner.

http://www.nytimes.com/2016/10/05/learning/lesson-plans/and-the-winner-is-predicting-the-2016-presidential-election.html

http://www.nytimes.com/2016/10/05/learning/lesson-plans/and-the-winner-is-predicting-the-2016-presidential-election.html

Post has attachment

Public

Just by looking at this animation, my Calculus class was able to hypothesize that the derivative of sine is (1) bounded by 1 and -1, (2) continuous, and (3) periodic. A pretty solid introduction to trig derivatives!

Post has attachment

Public

Happy Pythagorean Triple Perfect Square Day!

http://mrhonner.com/archives/17224

http://mrhonner.com/archives/17224

Wait while more posts are being loaded