I logged into Orkut today and was pleasantly surprised to find that the first two connectors were neither Joi nor Marc. Instead, they are two men from outside the States (Brazil, Czech Republic) with a relatively small cohort of friends (73, 19). This is intriguing.
Now, i know that there are games being played, so i checked out their friends. Almost all are from their countries of origin and most have relatively few friends. Now, this would make sense in a normal model, but i’m curious who these central bridges are – how are they playing such a significant role on the network?
I also received an email from Marc Canter encouraging people to make more friends so that he can be more of a connector. This was a kind reminder of how fake the data really is.
Since it’s fake anyways, i encourage all of you geeks with times on your hands to play. The trick to being the biggest connector is not a game of collecting people. It’s a graph theory game. You need to bridge the most disparate groups as well as connect to the hubs strategically. Remember: it’s an algorithm of average path length. Thus, you don’t want exceptionally long path lengths factored into the average. But, if you bridge the hubs and the disparate groups, you’ve reduced the average for everyone.
Anyhow, i’ve got to get back to work and should not focus on this instead of writing, but it’s a really fun math problem that i’d love for someone to solve. What is the algorith to minimize your average path length? Given the data, what strategic connections need to be made for a newcomer?
Orkut – ett spel?
Mer Orkut- och topplistetrivia. En connector i Orkut r de personer med lgst average path, dvs har kortast vg till samtiliga av sina vnner i vn-ntverket. I gr lyckades tv svenskar, bland annat “vr egen” Gunnar R. Johansson p gunnar.net,…
> how are they playing such a significant role on the network?
Well, one thing to note is that, in a global sense, they may not really playing all that significant a role, in the sense that the variance in average path is quite small. I mean, is this Czech fellow’s average path length of 2.718 indicative of his actually bringing the overall network closer together that much more than someone with an average path of 2.9? I’m guessing not.
However, that aside, the “best” strategy for decreasing one’s own average path will depend greatly on your metric for how “good” a strategy is. For example, Marc’s approach of asking other people to connect up might not be a bad way to do it. Certainly trying to just make as many new friends as possible can’t hurt. If what you really mean is what would be the most efficient way, from the point of view of greatest decrease in average path with fewest new friends made, then the first obvious thing is to start by befriending the 4-steps-away people… But which ones of the many tens of thousands of people at that distance is the tougher question, I suspect. If one had the whole graph available to play with, I’d venture to guess that a good heuristic might be to start by identifying clusters in the graph, and then befriend a single well-connected member of the largest cluster, then iterate. Or something. (Of course I’m just making this up, haven’t really worked any of it out.)
Would you invite me to Orkut, Please ?
None, of my friends are on it.
I was wondering the same thing about “average path length”, glad you summarized this. I’ll offer my 2 cent shot at gaming it.
The shortest path is between me and one other person, right? So the lower limit on path length should be 1.0. So if an isolated network of four friends all interconnect to each other, the average path of that network should be 1.0. That assumes that orkut isn’t doing any black box magic in calculating average path length.
So, to test this, (someone with time can) generate 20 fake accounts and interconnect them (avoiding jail, somehow) isolated from anyone else on the network and take a screenshot before they accounts get zorched.
I really really want to see this put to the test. *eg*
I’m curious what orkut is sorting on when they display community members or people’s friends. For some reason, even in large communities, I always show up near the top, but I am not particularly popular or connected. Maybe it goes by newer members, but I think I have been on long enough to be closer to the bottom by now.
Well, guys. The mystics of the average path.
Did you notice the average path is calculated different sometimes ? Because, a week after I first joined, the amount of people I was connected with, dropped 50%. Average path increased about 0.7 points. That was way before there was a stats page.
Then a couple of days ago, average path dropped 0.5, I was suddenly connected to 91% of the people, and that Czech guy (I love the Cezchs! Check with the Czechs!) was the top connector with a below three average.
Hey, I know someone who lost his only friend – so he has zero friends – and his average path is… 1 !
It sure is all about graphs 🙂 Just read the last paragraph of this: http://www.google.com/codejam/
and you know that they are supposed to calculate the average path 😛
I asked them. Orkut is now sorting friends and community lists by who has logged in most recently. This explains why you generally find yourself near the top of any list.
Gaming Orkut Connectors.
Thanks to Ace for pointing this one out. apophenia: gaming Orkut connectors Without a punishment associated with the game theory the gamers are using, they shall run amok….
> What is the algorith to minimize your average path length? Given the data, what strategic connections need to be made for a newcomer?
I could be wrong (again!) but is this not essentially the same problem that Davd Kempe et al. solved a couple of months ago under the title “Maximizing the Spread of Influence through a Social Network”?
Links and my summary at
or go straight for the goods at
Congrats to Jiri and Ricardo!
🙂 Now danah are I are in sync! The fact that: Jiri Slovacek male, 23, single Czech Republic and Ricardo Capitanio Martins da Silva male, 23, committed Brazil …..are the leading conenctors – totally fascinates me!