Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html below:

CommunityStructurePartition—Wolfram Documentation

We deliver solutions for the AI era—combining symbolic computation, data-driven insights and deep technical expertise

• Data & Computational Intelligence
• Model-Based Design
• Algorithm Development
• Wolfram|Alpha for Business
• Blockchain Technology
• Education Technology
• Quantum Computation

WolframConsulting.com

CommunityStructurePartition[g]

gives the partition of a graph g into communities.

• 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

This defines a small graph:

This finds that the network is grouped into two communities:

CommunityStructurePartition has been superseded by FindGraphCommunities:

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:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4