CommunityStructurePartition
CommunityStructurePartition[g]
gives the partition of a graph g into communities.
Details and Options
- CommunityStructurePartition functionality is now available in the built-in Wolfram Language function FindGraphCommunities.
- To use CommunityStructurePartition, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The partition groups the vertices into communities, such that there is a higher density of edges within communities than between them.
- The following option can be given:
-
Weighted False whether edges with higher weights are preferred during matching
Examples
open allclose allBasic Examples (2)
This finds that the network is grouped into two communities:
CommunityStructurePartition has been superseded by FindGraphCommunities:
Text
Wolfram Research (2007), CommunityStructurePartition, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html.
CMS
Wolfram Language. 2007. "CommunityStructurePartition." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html.
APA
Wolfram Language. (2007). CommunityStructurePartition. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html