Social Network of KDE mailing lists

Grey relation are considered stronger. Distance between vertices can be interpreted in some way (close vertices are considered more linked). But distance should be considered as less bad solution.

Size of vertices cannot be compared accross images. Size in only meaningfull in relation to the size of another mailing list on the same network.
Definition of relation bewteen mailing lists:
if Mil is the number of message sent by a member of the list i on mailing list l:
Link between mailing list l and k : SUMi(sqrt(Mik*Mil)).

Members of a peculiar mailing lists are person sending more or equal T, a threshold number of message. In the first set it's 24 (1 message per week on average). In the second set, it is 12 (2 message per month on average). Mailing lists that doesn't have at least one member are not shown.
See other social network analysis and some tips to read the graph
If a team send me a request to do the graph with names on it, I will do it. Just contact me.

Social Network, size of vertices according to centrality in the network (threshold for membership=24)

Social Network, size of vertices according to number of members (threshold for membership=24)

Social Network, size of vertices according to centrality in the network (threshold for membership=12)

Social Network, size of vertices according to number of members (threshold for membership=12)

Social Network, size of vertices according to number of messages on mailing list (threshold for membership=12)

Social Network, size of vertices according to commit done by members (threshold for membership=12)