Weighted network
{{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.Wasserman, S., Faust, K., 1994. Social Network Analysis: Methods and Applications. Cambridge University Press, New York, NY. 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{{Cite journal
| doi = 10.1073/pnas.0400087101
| author = A. Barrat and M. Barthelemy and R. Pastor-Satorras and A. Vespignani
| title = The architecture of complex weighted networks
| year = 2004
| journal = Proceedings of the National Academy of Sciences
| volume = 101
| issue = 11
| pages = 3747–3752
| pmid = 15007165
| pmc = 374315
| bibcode=2004PNAS..101.3747B
|arxiv = cond-mat/0311416 | doi-access = free
}} On the one hand, Mark Granovetter (1973){{cite journal | last1 = Granovetter | first1 = M | year = 1973 | title = The strength of weak ties | journal = American Journal of Sociology | volume = 78 | issue = 6| pages = 1360–1380 | doi=10.1086/225469| s2cid = 59578641 }} 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,{{cite journal | last1 = Luczkowich | first1 = J.J. | last2 = Borgatti | first2 = S.P. | last3 = Johnson | first3 = J.C. | last4 = Everett | first4 = M.G. | year = 2003 | title = Defining and measuring trophic role similarity in food webs using regular equivalence | journal = Journal of Theoretical Biology | volume = 220 | issue = 3| pages = 303–321 | doi = 10.1006/jtbi.2003.3147 | pmid = 12468282 | bibcode = 2003JThBi.220..303L | citeseerx = 10.1.1.118.3862 }} the number of synapses and gap junctions in neural networks,{{Cite journal
| author = D. J. Watts and Steven Strogatz
| title = Collective dynamics of 'small-world' networks
| url = http://www.tam.cornell.edu/SS_nature_smallworld.pdf
|date=June 1998
| journal = Nature
| volume = 393
| pages = 440–442
| doi = 10.1038/30918
| pmid = 9623998
| issue = 6684
|archive-url = https://web.archive.org/web/20070221125754/http://tam.cornell.edu/SS_nature_smallworld.pdf |archive-date=2007-02-21 | bibcode=1998Natur.393..440W| s2cid = 4429113
}} or the amount of traffic flowing along connections in transportation networks.{{Cite journal
| doi = 10.1103/PhysRevLett.101.168702
| author = Tore Opsahl and Vittoria Colizza and Pietro Panzarasa and Jose J. Ramasco
| title = Prominence and control: The weighted rich-club effect
| url = http://toreopsahl.com/2008/12/12/article-prominence-and-control-the-weighted-rich-club-effect/
| year = 2008
| journal = Physical Review Letters
| volume = 101
| pages = 168702
| pmid = 18999722
| issue = 16
| bibcode = 2008PhRvL.101p8702O
| arxiv = 0804.0417
| s2cid = 29349737
| access-date = 2009-09-17
| archive-date = 2009-11-27
| archive-url = https://web.archive.org/web/20091127111938/http://toreopsahl.com/2008/12/12/article-prominence-and-control-the-weighted-rich-club-effect/
| url-status = live
}}
By recording the strength of ties,{{Cite web| url=http://toreopsahl.com/2009/02/06/operationalisation-of-tie-strength/| title=Operationalisation of tie strength in social networks| date=2009-02-06| access-date=2009-09-17| archive-date=2009-08-24| archive-url=https://web.archive.org/web/20090824215103/http://toreopsahl.com/2009/02/06/operationalisation-of-tie-strength/| url-status=live}} a weighted network can be created (also known as a valued network).
Weighted networks are also widely used in genomic and systems biologic applications.Horvath, S., 2011. Weighted Network Analysis. Applications in Genomics and Systems Biology. Springer Book. {{ISBN|978-1-4419-8818-8}}. 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.{{cite journal | pmid = 16646834 | doi=10.2202/1544-6115.1128 | volume=4 | title=A general framework for weighted gene co-expression network analysis | year=2005 | pages=Article17 | last1 = Zhang | first1 = Bin | last2 = Horvath | first2 = Steve | journal = Statistical Applications in Genetics and Molecular Biology| s2cid=7756201 }} More generally, weighted correlation networks can be defined by soft-thresholding the pairwise correlations among variables (e.g. gene measurements).
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
- Closeness: Redefined by using Dijkstra's distance algorithm{{Cite journal |doi=10.1103/PhysRevE.64.016132 |pmid=11461356 |first=Mark E J |last=Newman |title=Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality |url=http://www-personal.umich.edu/~mejn/papers/016132.pdf |year=2001 |journal=Physical Review E |volume=64 |issue=1 |pages=016132 |bibcode=2001PhRvE..64a6132N |arxiv=cond-mat/0011144 |s2cid=12985167 |author-link=Mark E J Newman |access-date=2009-09-17 |archive-date=2008-10-10 |archive-url=https://web.archive.org/web/20081010160114/http://www-personal.umich.edu/%7emejn/papers/016132.pdf |url-status=live }}
- Betweenness: Redefined by using Dijkstra's distance algorithm{{Cite journal|doi=10.1016/j.socnet.2007.11.001 |first=U |last=Brandes|author-link=Ulrik Brandes |title=On variants of shortest-path betweenness centrality and their generic computation |year=2008 |journal=Social Networks |volume=30 |issue=2 |pages=136–145 |citeseerx=10.1.1.72.9610 }}{{cite journal |url=https://toreopsahl.com/tnet/weighted-networks/node-centrality/ |last1=Opsahl |first1=T |last2=Agneessens |first2=F |last3=Skvoretz |first3=J |date=2010 |title=Node centrality in weighted networks: Generalizing degree and shortest paths |journal=Social Networks |volume=32 |number=3 |pages=245–251 |doi=10.1016/j.socnet.2010.03.006 |access-date=17 June 2021 |archive-date=24 June 2021 |archive-url=https://web.archive.org/web/20210624200406/https://toreopsahl.com/tnet/weighted-networks/node-centrality/ |url-status=live }}
- The clustering coefficient (global): Redefined by using a triplet value{{Cite journal |doi=10.1016/j.socnet.2009.02.002 |author1=Tore Opsahl |author2=Pietro Panzarasa |title=Clustering in Weighted Networks |url=http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/ |year=2009 |journal=Social Networks |volume=31 |issue=2 |pages=155–163 |citeseerx=10.1.1.180.9968 |s2cid=8822670 |access-date=2009-09-17 |archive-date=2019-07-01 |archive-url=https://web.archive.org/web/20190701224513/https://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/ |url-status=live }}
- The clustering coefficient (local): Redefined by using a triplet value or using an algebraic formula
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). For example, Dong and Horvath (2007) Dong J, Horvath S (2007) "Understanding Network Concepts in Modules". BMC Systems Biology 2007, June 1:24 {{open access}} 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) {{cite journal|pmid=18704157 |doi=10.1371/journal.pcbi.1000117 |volume=4 |issue=8 |title=Geometric interpretation of gene coexpression network analysis |pmc=2446438 |year=2008 |pages=e1000117 |editor1-last=Miyano |editor1-first=Satoru |last1=Dong |first1=Jun |last2=Horvath |first2=Steve |journal=PLOS Computational Biology |bibcode=2008PLSCB...4E0117H |doi-access=free }} {{open access}}
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) {{Cite journal |last=Gursoy |first=Furkan |last2=Badur |first2=Bertan |date=2021-09-18 |title=Extracting the signed backbone of intrinsically dense weighted networks |url=https://doi.org/10.1093/comnet/cnab019 |journal=Journal of Complex Networks |volume=9 |issue=5 |doi=10.1093/comnet/cnab019 |issn=2051-1310|arxiv=2012.05216 }} 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.{{cite web |url=https://toreopsahl.com/tnet/software/ |title=tnet » Software |date=12 June 2011 |access-date=17 June 2021 |publisher=Tore Opsahl |archive-date=15 June 2021 |archive-url=https://web.archive.org/web/20210615043849/https://toreopsahl.com/tnet/software/ |url-status=live }}
The WGCNA R package implements functions for constructing and analyzing weighted networks in particular weighted correlation networks.{{cite journal|pmid=19114008 |doi=10.1186/1471-2105-9-559 |volume=9 |title=WGCNA: an R package for weighted correlation network analysis |pmc=2631488 |year=2008 |pages=559 |last1=Langfelder |first1=Peter |last2=Horvath |first2=Steve |journal=BMC Bioinformatics |doi-access=free }} {{open access}}