Density

From SONIVIS:Wiki

Jump to: navigation, search
Density

This metric is implemented in every version.


This metric belongs to a network. Take a look at other Network measures.


The measure Density is the proportion of possible edges that are actually present in the network.

Objective

The concept of Density considers the Degree of the nodes in the network. The degree shows how strong a node is connected to other nodes. The density is high the more nodes are connected to each other.

As opposed to measures such as Diameter this measure is very useful to compare different networks.

Calculation

A network \mathcal{G}(\mathcal{N},\mathcal{L})\,\! consists of a set of nodes \mathcal{N}\,\! and a set of edges (lines) \mathcal{L}\,\! between them. The maximum number of possible edges in a network is determined by the number of nodes g\,\! as there are \frac{g(g-1)}{2} possible unordered pairs of nodes, and thus the same amount of possible edges [1].

\Delta=\frac{2L}{g(g-1)}, where L\,\! is the total number of edges and g\,\! the total number of nodes in a network.

The density of a network is 0 if there are no edges and 1 if all edges are present in the network.

For this measure directed networks are considered as undirected ones as well, therefore this calculation for directed and undirected networks is the same in SONIVIS.

Statement

R-example (igprah)
library(igraph)
g <- random.graph.game(10, 3/10)
graph.density(g, loops=TRUE)

Reference

Personal tools