Network analysis on high school hierarchy of friends

Posted to Statistics  |  Tags: ,  |  Nathan Yau

Brian Ball and M. E. J. Newman analyzed friendship data from a high school and junior high, and found a hierarchy similar to the one in Mean Girls.

Here we analyze a large collection of such networks representing friendships among students at US high and junior-high schools and show that the pattern of unreciprocated friendships is far from random. In every network, without exception, we find that there exists a ranking of participants, from low to high, such that almost all unreciprocated friendships consist of a lower-ranked individual claiming friendship with a higher-ranked one.

So someone higher up on the totem poll had more people saying they were friends with him or her, but the popular one didn’t necessarily feel the same.

I told my wife this, and her reaction was basically, “Uh, yeah. And?”

Favorites

Causes of Death

There are many ways to die. Cancer. Infection. Mental. External. This is how different groups of people died over the past 10 years, visualized by age.

The Best Data Visualization Projects of 2011

I almost didn’t make a best-of list this year, but as I clicked through the year’s post, it was hard …

Top Brewery Road Trip, Routed Algorithmically

There are a lot of great craft breweries in the United States, but there is only so much time. This is the computed best way to get to the top rated breweries and how to maximize the beer tasting experience. Every journey begins with a single sip.

Years You Have Left to Live, Probably

The individual data points of life are much less predictable than the average. Here’s a simulation that shows you how much time is left on the clock.