THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

DOCUMENTATION CENTER SEARCH

GRAPH UTILITIES PACKAGE SYMBOL

CommunityStructurePartition

CommunityStructurePartition[g]
gives the partition of a graph g into communities.

The partition groups the vertices into communities, such that there is a higher density of edges within communities than between them.

whether edges with higher weights are preferred during matching

This defines a small graph:

This finds that the network is grouped into two communities:

This defines a small graph:

Needs["GraphUtilities`"]

Out[2]=

This finds that the network is grouped into two communities:

Out[3]=

This specifies a weighted graph:

This plots the graph with edge weights shown:

This finds the community structure, ignoring edge weights:

This finds the community structure, taking into account the edge weights: