
A numerical value assigned to a connection in a network, indicating the strength of the relationship.In network science, a weight is a numerical value assigned to a connection (edge) between two nodes, quantifying the strength, capacity, or intensity of that relationship. Unlike an unweighted network where all connections are equal, a weighted network captures heterogeneity: a weight could represent the number of interactions, the amount of flow, or the similarity between nodes. For instance, in a social network, the weight of a friendship edge might be the frequency of communication; in a transportation network, it might be the number of passengers or the travel time. Weights are fundamental to analyzing network structure and dynamics, as they influence path lengths, centrality measures, and community detection.
The formal use of weights in networks dates back to the 1950s in the study of social networks and transportation, but it became widespread with the rise of complex network theory in the late 1990s, particularly through the work of physicists like Mark Newman and Albert-László Barabási.
Weights are typically assigned based on empirical data or model assumptions. Once assigned, they modify the mathematical operations on the network: the shortest path between two nodes is computed by summing weights along edges, and centrality measures like PageRank or eigenvector centrality incorporate weights to give more influence to stronger connections. In many algorithms, weights are normalized or transformed to ensure stability, and they can be directed (different weights for each direction) or undirected.
Weighted networks are used in internet routing (where link weights represent bandwidth or latency), in recommendation systems (where user-item weights are predicted), and in neuroscience (where brain connectivity weights reflect synaptic strength).
In the famous 'six degrees of separation' experiment, the weights of social ties are not all equal—a close friend counts more than a distant acquaintance, which is why the effective network diameter is often smaller than the raw hop count.








