Weighted network

From HandWiki
Short description: Network where the ties among nodes have weights assigned to them

A weighted network is a network where the ties among nodes have weights assigned to them. A network is a system whose elements are somehow connected.[1] The elements of a system are represented as nodes (also known as actors or vertices) and the connections among interacting elements are known as ties, edges, arcs, or links. The nodes might be neurons, individuals, groups, organisations, airports, or even countries, whereas ties can take the form of friendship, communication, collaboration, alliance, flow, or trade, to name a few.

In a number of real-world networks, not all ties in a network have the same capacity. In fact, ties are often associated with weights that differentiate them in terms of their strength, intensity, or capacity[2][3] On the one hand, Mark Granovetter (1973)[4] argued that the strength of social relationships in social networks is a function of their duration, emotional intensity, intimacy, and exchange of services. On the other, for non-social networks, weights often refer to the function performed by ties, e.g., the carbon flow (mg/m2/day) between species in food webs,[5] the number of synapses and gap junctions in neural networks,[6] or the amount of traffic flowing along connections in transportation networks.[7]

Example of a weighted network (weights can also be visualized by giving edges different widths)

By recording the strength of ties,[8] a weighted network can be created (also known as a valued network).

Weighted networks are also widely used in genomic and systems biologic applications.[3] For example, weighted gene co-expression network analysis (WGCNA) is often used for constructing a weighted network among genes (or gene products) based on gene expression (e.g. microarray) data.[9] More generally, weighted correlation networks can be defined by soft-thresholding the pairwise correlations among variables (e.g. gene measurements).[10]

Measures for weighted networks

Although weighted networks are more difficult to analyse than if ties were simply present or absent, a number of network measures has been proposed for weighted networks:

  • Node strength: The sum of weights attached to ties belonging to a node[2]
  • Closeness: Redefined by using Dijkstra's distance algorithm[11]
  • Betweenness: Redefined by using Dijkstra's distance algorithm[12][13]
  • The clustering coefficient (global): Redefined by using a triplet value[14]
  • The clustering coefficient (local): Redefined by using a triplet value[2] or using an algebraic formula[9]

A theoretical advantage of weighted networks is that they allow one to derive relationships among different network measures (also known as network concepts, statistics or indices).[3] For example, Dong and Horvath (2007) [15] show that simple relationships among network measures can be derived in clusters of nodes (modules) in weighted networks. For weighted correlation networks, one can use the angular interpretation of correlations to provide a geometric interpretation of network theoretic concepts and to derive unexpected relationships among them Horvath and Dong (2008) [16]

Intrinsically dense weighted networks

In network theory, intrinsically dense weighted networks represent a distinctive class of complex structures characterized by a near-completeness of links and associated weights, transcending the conventional constraints of sparser network configurations. Unlike sparse networks where the absence of links typically indicate lack of interaction, intrinsically dense networks exhibit a comprehensive interconnection among nodes, where each node is intricately linked to all others. Such systems do not have obvious natural limits for a node to have connection with any or all of the other nodes.

The term "intrinsically dense" emphasizes that edges within these networks may not solely represent positive relationships but can encompass randomness or even negative associations based on their respective weights. For instance, in scenarios where edge weights denote similarity between nodes, lower weights don't just signify a lack of similarity but may connote dissimilarity or negative underlying links. The study by Gursoy & Badur (2021) [17] introduced methods to extract meaningful and sparse signed backbones from these networks, showcasing their significance in preserving the intricate structures inherent in intrinsically dense weighted networks across various domains including certain migration, voting, human contact, and species cohabitation networks. This distinctive network paradigm expands the understanding of complex systems observed in natural, social, and technological domains, offering insights into nuanced interactions and relationships within these densely interconnected networks.

Software for analysing weighted networks

There are a number of software packages that can analyse weighted networks; see social network analysis software. Among these are the proprietary software UCINET and the open-source package tnet.[18]

The WGCNA R package implements functions for constructing and analyzing weighted networks in particular weighted correlation networks.[10]

See also

References

  1. ↑ Wasserman, S., Faust, K., 1994. Social Network Analysis: Methods and Applications. Cambridge University Press, New York, NY.
  2. ↑ 2.0 2.1 2.2 A. Barrat and M. Barthelemy and R. Pastor-Satorras and A. Vespignani (2004). "The architecture of complex weighted networks". Proceedings of the National Academy of Sciences 101 (11): 3747–3752. doi:10.1073/pnas.0400087101. PMID 15007165. Bibcode: 2004PNAS..101.3747B. 
  3. ↑ 3.0 3.1 3.2 Horvath, S., 2011. Weighted Network Analysis. Applications in Genomics and Systems Biology. Springer Book. ISBN:978-1-4419-8818-8.
  4. ↑ Granovetter, M (1973). "The strength of weak ties". American Journal of Sociology 78 (6): 1360–1380. doi:10.1086/225469. 
  5. ↑ Luczkowich, J.J.; Borgatti, S.P.; Johnson, J.C.; Everett, M.G. (2003). "Defining and measuring trophic role similarity in food webs using regular equivalence". Journal of Theoretical Biology 220 (3): 303–321. doi:10.1006/jtbi.2003.3147. PMID 12468282. Bibcode: 2003JThBi.220..303L. 
  6. ↑ D. J. Watts and Steven Strogatz (June 1998). "Collective dynamics of 'small-world' networks". Nature 393 (6684): 440–442. doi:10.1038/30918. PMID 9623998. Bibcode: 1998Natur.393..440W. http://www.tam.cornell.edu/SS_nature_smallworld.pdf. 
  7. ↑ Tore Opsahl and Vittoria Colizza and Pietro Panzarasa and Jose J. Ramasco (2008). "Prominence and control: The weighted rich-club effect". Physical Review Letters 101 (16): 168702. doi:10.1103/PhysRevLett.101.168702. PMID 18999722. Bibcode: 2008PhRvL.101p8702O. http://toreopsahl.com/2008/12/12/article-prominence-and-control-the-weighted-rich-club-effect/. Retrieved 2009-09-17. 
  8. ↑ "Operationalisation of tie strength in social networks". 2009-02-06. http://toreopsahl.com/2009/02/06/operationalisation-of-tie-strength/. 
  9. ↑ 9.0 9.1 Zhang, Bin; Horvath, Steve (2005). "A general framework for weighted gene co-expression network analysis". Statistical Applications in Genetics and Molecular Biology 4: Article17. doi:10.2202/1544-6115.1128. PMID 16646834. 
  10. ↑ 10.0 10.1 Langfelder, Peter; Horvath, Steve (2008). "WGCNA: an R package for weighted correlation network analysis". BMC Bioinformatics 9: 559. doi:10.1186/1471-2105-9-559. PMID 19114008.  open access
  11. ↑ Newman, Mark E J (2001). "Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality". Physical Review E 64 (1): 016132. doi:10.1103/PhysRevE.64.016132. PMID 11461356. Bibcode: 2001PhRvE..64a6132N. http://www-personal.umich.edu/~mejn/papers/016132.pdf. Retrieved 2009-09-17. 
  12. ↑ Brandes, U (2008). "On variants of shortest-path betweenness centrality and their generic computation". Social Networks 30 (2): 136–145. doi:10.1016/j.socnet.2007.11.001. 
  13. ↑ Opsahl, T; Agneessens, F; Skvoretz, J (2010). "Node centrality in weighted networks: Generalizing degree and shortest paths". Social Networks 32 (3): 245–251. doi:10.1016/j.socnet.2010.03.006. https://toreopsahl.com/tnet/weighted-networks/node-centrality/. Retrieved 17 June 2021. 
  14. ↑ Tore Opsahl; Pietro Panzarasa (2009). "Clustering in Weighted Networks". Social Networks 31 (2): 155–163. doi:10.1016/j.socnet.2009.02.002. http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/. Retrieved 2009-09-17. 
  15. ↑ Dong J, Horvath S (2007) "Understanding Network Concepts in Modules". BMC Systems Biology 2007, June 1:24 open access
  16. ↑ Dong, Jun; Horvath, Steve (2008). Miyano, Satoru. ed. "Geometric interpretation of gene coexpression network analysis". PLOS Computational Biology 4 (8): e1000117. doi:10.1371/journal.pcbi.1000117. PMID 18704157. Bibcode: 2008PLSCB...4E0117H.  open access
  17. ↑ Gursoy, Furkan; Badur, Bertan (2021-09-18). "Extracting the signed backbone of intrinsically dense weighted networks". Journal of Complex Networks 9 (5). doi:10.1093/comnet/cnab019. ISSN 2051-1310. https://doi.org/10.1093/comnet/cnab019. 
  18. ↑ "tnet » Software". Tore Opsahl. 12 June 2011. https://toreopsahl.com/tnet/software/. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Weighted_network&oldid=3361495"