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

http://www.cybaea.net/Journal/OptimizeViralMarketing.html

or go straight for the goods at

http://www.cs.cornell.edu/home/kleinber/kdd03-inf.pdf

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….

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

Cheers,
Ace

http://www.orkut.com/Profile.aspx?uid=6185523418686534706

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*

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.)

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,…