Small-World Propensity and Weighted Brain Networks

Abstract

Quantitative descriptions of network structure can provide fundamental insights into the function of interconnected complex systems. Small-world structure, diagnosed by high local clustering yet short average path length between any two nodes, promotes information flow in coupled systems, a key function that can differ across conditions or between groups. However, current techniques to quantify small-worldness are density dependent and neglect important features such as the strength of network connections, limiting their application in real-world systems. Here, we address both limitations with a novel metric called the Small-World Propensity (SWP). In its binary instantiation, the SWP provides an unbiased assessment of small-world structure in networks of varying densities. We extend this concept to the case of weighted brain networks by developing (i) a standardized procedure for generating weighted small-world networks, (ii) a weighted extension of the SWP, and (iii) a method for mapping observed brain network data onto the theoretical model. In applying these techniques to compare real-world brain networks, we uncover the surprising fact that the canonical biological small-world network, the C. elegans neuronal network, has strikingly low SWP. These metrics, models, and maps form a coherent toolbox for the assessment and comparison of architectural properties in brain networks.

Graph analysis of structural brain networks in Alzheimer’s disease: beyond small world properties

“…A network with small world property has large clustering coefficient and small characteristic path length, and hence the ratio, sigma, will be large. • Small world propensity (SWP) is a recently developed metric of small world property of a network (Muldoon et al 2016). The rationale for the new parameter was the heavy dependence of both characteristic path length and clustering coefficient on the sparsity level of the network.…”

Characteristics of Information Dissemination of Agricultural Safety Emergencies Based on Complex Network

“…Two well-known and much studied classes of complex networks are scale-free networks and small-world networks [6][7][8][9][10]. Both are characterized by specific structural features: power-law degree distributions for the former and short path lengths and high clustering for the latter.…”

“…Both are characterized by specific structural features: power-law degree distributions for the former and short path lengths and high clustering for the latter. However, as the study of complex networks has continued to grow in importance and popularity, many other aspects of network structure have attracted attention as well [5][6][7][8][9][10].…”

Vulnerability Analysis of Interdependent Scale-Free Networks with Complex Coupling

“…These networks are called scale-free networks. Currently, researchers propose many optimized methods for the scale-free networks model by using sparse matrix vector multiplication to construct scale-free networks [16], using the internal weighted average method to calculate the configuration parameters of scalefree networks [17], and using boosting regression algorithm and Bayesian algorithm to construct prior information and establish the scale-free networks based on prior information [18]. Random scale-free networks are modeled with chain fault [19].…”