| Author |
Comment/Response |
Randi Griffin
|
 10/06/09 1:35pm
Hi,
I have written a program that simulates spreading on networks, and I am trying to explore the way in which community substructure (as measured by community modularity) effects the efficiency of spreading.
What I am trying to do now is generate networks that span the range of community modularity from cm=0 to cm=1 (for the partition, I am using "CommunityStructureAssignment"), but I have run into a problem: I can't come up with a network that has a community modularity of greater that 0.5!
From my understanding of the metric, it should be straightforward to design a network that has cm=1; it should be a network that has completely disconnected subgroups, such that it is not a connected graph. Here is a graph g=Graph:<6,6,Undirected>
In:
g = FromAdjacencyMatrix[{{0, 1, 1, 0, 0, 0}, {1, 0, 1, 0, 0, 0}, {1,
1, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 1}, {0, 0, 0, 1, 0, 1}, {0, 0, 0,
1, 1, 0}}];
CommunityModularity[g, CommunityStructureAssignment[g]]
Out:
0.5
I can't understand why the community modularity for this network is not 1, and I am clueless as to what a network of cm=1 would look like (if not like this one). Any help is greatly appreciated!
Randi
Attachment: Untitled-1.nb, URL: , |
|
