Generalizations of the clustering coefficient to weighted complex networks

Jari Saramäki1, Mikko Kivelä, Jukka-Pekka Onnela

  • 1Laboratory of Computational Engineering, Helsinki University of Technology, P.O. Box 9203, FIN-02015 HUT, Finland. jsaramak@lce.hut.fi

Summary

This study explores weighted complex networks by generalizing the clustering coefficient. We compare existing methods, highlighting their strengths and weaknesses for analyzing network structures.

Related Concept Videos

Weighted Mean00:57

Weighted Mean

While taking the arithmetic, geometric, or harmonic mean of a sample data set, equal importance is assigned to all the data points. However, all the values may not always be equally important in some data sets. An intrinsic bias might make it more important to give more weightage to specific values over others.
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
Confidence Coefficient01:24

Confidence Coefficient

The confidence coefficient is also known as the confidence level or degree of confidence. It is the percent expression for the probability, 1-α, that the confidence interval contains the true population parameter assuming that the confidence interval is obtained after sufficient unbiased sampling; for example, if the CL = 90%, then in 90 out of 100 samples the interval estimate will enclose the true population parameter. Here α is the area under the curve, distributed equally under both the...
Vector Representation of Complex Numbers01:16

Vector Representation of Complex Numbers

Complex numbers, represented in Cartesian coordinates, can also be visualized as vectors. These vectors can be expressed in polar form, emphasizing their magnitude and angle. When a complex number is input into a function, the output is another complex number, highlighting the function's zero point from which the vector representation can originate.
Consider a function defined as the product of the complex factors in the numerator divided by the product of the complex factors in the denominator.
Thermodynamics: Activity Coefficient01:24

Thermodynamics: Activity Coefficient

Activity is the measure of the effective concentration of the species in solution. It can be expressed as the product of the molar concentration of the species and its activity coefficient. The activity coefficient is a dimensionless quantity and depends on the total ionic strength of the solution.
The activity coefficient is a measure of the deviation from ideal behavior. When the ionic strength of the solution is minimal, the activity coefficient of an ionic species is close to unity, making...
Network Covalent Solids02:18

Network Covalent Solids

Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Coefficient of Correlation01:12

Coefficient of Correlation

The correlation coefficient, r, developed by Karl Pearson in the early 1900s, is numerical and provides a measure of strength and direction of the linear association between the independent variable x and the dependent variable y.
If you suspect a linear relationship between x and y, then r can measure how strong the linear relationship is.
What the VALUE of r tells us:
The value of r is always between –1 and +1: –1 ≤ r ≤ 1.
The size of the correlation r indicates the strength of the linear...