The network density calculator gives the mean degree, the density, the number of possible edges and the clustering and average path length expected in a random graph of the same size.
How the calculation works
- Enter the number of nodes.
- Enter the number of edges.
- The calculator gives the mean degree, the density, the possible edges, the random clustering, the average path length and the connectivity ratio.
Example
A network of 1,000 nodes and 5,000 edges has a mean degree of 2 × 5,000 / 1,000 = 10.00. It could have 1,000 × 999 / 2 = 499,500 edges, so its density is 1.001 %. A random graph of this size and degree has a clustering of 0.0100 and an average path of ln 1,000 / ln 10 = 3.00 steps. The ratio of degree to ln n is 1.45, above 1, so it is usually connected.
Why it matters
The calculator helps students of network science, social network analysts and developers who study graphs of users, links or computers and want a baseline to compare with.
Good to know
The formulas here are for undirected networks without self-loops or multiple edges. For directed networks, the density is edges divided by n × (n − 1), and the mean degree splits into in-degree and out-degree. Real networks often have hubs, nodes with very many links, which makes the degree distribution very uneven and the mean degree less informative. The path length estimate of a random graph is a typical order of magnitude, valid for a large connected network with a mean degree above 1. If your measured clustering is much larger than the random value while the path length is similar, the network has small-world properties.
Related tools
The probability calculator covers chances, the logarithm calculators help with ln, the Metcalfe law calculator values a network by its connections and the normal distribution calculator describes bell curves.