internal_density: Internal Density

In clustAnalytics: Cluster Evaluation on Graphs

Internal Density

Description

Internal density of a graph's communities. That is, the sum of weights of their edges divided by the number of unordered pairs of vertices (which is the number of potential edges).

Usage

internal_density(g, com)

Arguments

g	Graph to be analyzed (as an igraph object). If the edges have a "weight" attribute, those will be used as weights.
com	community membership integer vector. Each element corresponds to a vertex.

Value

Numeric vector with the internal density of each community.

See Also

Other cluster scoring functions: FOMD(), average_degree(), average_odf(), conductance(), coverage(), cut_ratio(), density_ratio(), edges_inside(), expansion(), max_odf(), normalized_cut(), scoring_functions(), weighted_clustering_coefficient(), weighted_transitivity()

Examples

data(karate, package="igraphdata")
internal_density(karate, membership(cluster_louvain(karate)))

clustAnalytics documentation built on May 29, 2024, 12:18 p.m.