evan_tech

Previous Entry Share Next Entry
02:01 pm, 1 Apr 04

graph-join now public

Put my graph-join implementation up in my arch repo in martine@danga.com--2004/graphjoin--dev--0.1. I haven't touched it in a few months.

After I ran it over my friend sets, I got this:

0 (221 self) | 2^16 6^7 7^16 9 25 7 288 318 331 382
2 (375 self) | 0^17 2^4 6^53 7^38 9^44 6 25^9 31^4 38^35 73^2 6^4 7^6 38^2 6^2 288^2 318^2 9 331
6 (89 self) | 0^10 2^67 6 7^28 9^10 25^2 38^10
7 (204 self) | 0^15 2^44 6^22 7^3 9^16 38^10 73 127 244 249 277 288 318 331 601 976
9 (154 self) | 0 2^43 6^6 7^17 9^2 31^3 6 73 224 6 251 38 382
25 (63 self) | 0 2^8 6^2 25 29 38
31 (58 self) | 4 9^3 29 31 162 179
38 (95 self) | 2^37 6^9 7^11 6 9 25 38

final q: 1.210416


Each line is a group, while the numbers afterwards (before the carets) indicate members of the group.
This indicates it collapsed the hundreds of people into eight or so groups. I can map the numbers to names, but what I'd really like is a representative name from each group.

Is there some canonical measure of how "central" a node is to a graph? Maybe something like the node with the lowest average distance to all other nodes?