Ensemble approach to the analysis of weighted networks

Stochastic model for football's collective dynamics

In this paper, we study collective interaction dynamics emerging in the game of football (soccer). To do so, we surveyed a database containing body-sensor traces measured during three professional football matches, where we observed statistical patterns that we used to propose a stochastic model for the players' motion in the field. The model, which is based on linear interactions, captures to a good approximation the spatiotemporal dynamics of a football team. Our theoretical framework, therefore, can be an effective analytical tool to uncover the underlying cooperative mechanisms behind the complexity of football plays. Moreover, we showed that it can provide handy theoretical support for coaches to evaluate teams' and players' performances in both training sessions and competitive scenarios.

Spatial and Temporal Entropies in the Spanish Football League: A Network Science Perspective

We quantified the spatial and temporal entropy related to football teams and their players by means of a pass-based interaction. First, we calculated the spatial entropy associated to the positions of all passes made by a football team during a match, obtaining a spatial entropy ranking of Spanish teams during the 2017/2018 season. Second, we investigated how the player’s average location in the field is related to the amount of entropy of his passes. Next, we constructed the temporal passing networks of each team and computed the deviation of their network parameters along the match. For each network parameter, we obtained the permutation entropy and the statistical complexity of its temporal fluctuations. Finally, we investigated how the permutation entropy (and statistical complexity) of the network parameters was related to the total number of passes made by a football team. Our results show that (i) spatial entropy changes according to the position of players in the field, and (ii) the organization of passing networks change during a match and its evolution can be captured measuring the permutation entropy and statistical complexity of the network parameters, allowing to identify what parameters evolve more randomly.

Defining a historic football team: Using Network Science to analyze Guardiola's F.C. Barcelona

The application of Network Science to social systems has introduced new methodologies to analyze classical problems such as the emergence of epidemics, the arousal of cooperation between individuals or the propagation of information along social networks. More recently, the organization of football teams and their performance have been unveiled using metrics coming from Network Science, where a team is considered as a complex network whose nodes (i.e., players) interact with the aim of overcoming the opponent network. Here, we combine the use of different network metrics to extract the particular signature of the F.C. Barcelona coached by Guardiola, which has been considered one of the best teams along football history. We have first compared the network organization of Guardiola's team with their opponents along one season of the Spanish national league, identifying those metrics with statistically significant differences and relating them with the Guardiola's game. Next, we have focused on the temporal nature of football passing networks and calculated the evolution of all network properties along a match, instead of considering their average. In this way, we are able to identify those network metrics that enhance the probability of scoring/receiving a goal, showing that not all teams behave in the same way and how the organization Guardiola's F.C. Barcelona is different from the rest, including its clustering coefficient, shortest-path length, largest eigenvalue of the adjacency matrix, algebraic connectivity and centrality distribution.

Functional brain networks reveal the existence of cognitive reserve and the interplay between network topology and dynamics

We investigated how the organization of functional brain networks was related to cognitive reserve (CR) during a memory task in healthy aging. We obtained the magnetoencephalographic functional networks of 20 elders with a high or low CR level to analyse the differences at network features. We reported a negative correlation between synchronization of the whole network and CR, and observed differences both at the node and at the network level in: the average shortest path and the network outreach. Individuals with high CR required functional networks with lower links to successfully carry out the memory task. These results may indicate that those individuals with low CR level exhibited a dual pattern of compensation and network impairment, since their functioning was more energetically costly to perform the task as the high CR group. Additionally, we evaluated how the dynamical properties of the different brain regions were correlated to the network parameters obtaining that entropy was positively correlated with the strength and clustering coefficient, while complexity behaved conversely. Consequently, highly connected nodes of the functional networks showed a more stochastic and less complex signal. We consider that network approach may be a relevant tool to better understand brain functioning in aging.

Quantifying Complexity in Quantum Phase Transitions via Mutual Information Complex Networks

We quantify the emergent complexity of quantum states near quantum critical points on regular 1D lattices, via complex network measures based on quantum mutual information as the adjacency matrix, in direct analogy to quantifying the complexity of electroencephalogram or functional magnetic resonance imaging measurements of the brain. Using matrix product state methods, we show that network density, clustering, disparity, and Pearson's correlation obtain the critical point for both quantum Ising and Bose-Hubbard models to a high degree of accuracy in finite-size scaling for three classes of quantum phase transitions, Z_{2}, mean field superfluid to Mott insulator, and a Berzinskii-Kosterlitz-Thouless crossover.

A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain

BACKGROUND

Networks or graphs play an important role in the biological sciences. Protein interaction networks and metabolic networks support the understanding of basic cellular mechanisms. In the human brain, networks of functional or structural connectivity model the information-flow between cortex regions. In this context, measures of network properties are needed. We propose a new measure, Ndim, estimating the complexity of arbitrary networks. This measure is based on a fractal dimension, which is similar to recently introduced box-covering dimensions. However, box-covering dimensions are only applicable to fractal networks. The construction of these network-dimensions relies on concepts proposed to measure fractality or complexity of irregular sets in [Formula: see text].

RESULTS

The network measure Ndim grows with the proliferation of increasing network connectivity and is essentially determined by the cardinality of a maximum k-clique, where k is the characteristic path length of the network. Numerical applications to lattice-graphs and to fractal and non-fractal graph models, together with formal proofs show, that Ndim estimates a dimension of complexity for arbitrary graphs. Box-covering dimensions for fractal graphs rely on a linear log-log plot of minimum numbers of covering subgraph boxes versus the box sizes. We demonstrate the affinity between Ndim and the fractal box-covering dimensions but also that Ndim extends the concept of a fractal dimension to networks with non-linear log-log plots. Comparisons of Ndim with topological measures of complexity (cost and efficiency) show that Ndim has larger informative power. Three different methods to apply Ndim to weighted networks are finally presented and exemplified by comparisons of functional brain connectivity of healthy and depressed subjects.

CONCLUSION

We introduce a new measure of complexity for networks. We show that Ndim has the properties of a dimension and overcomes several limitations of presently used topological and fractal complexity-measures. It allows the comparison of the complexity of networks of different type, e.g., between fractal graphs characterized by hub repulsion and small world graphs with strong hub attraction. The large informative power and a convenient computational CPU-time for moderately sized networks may make Ndim a valuable tool for the analysis of biological networks.

Statistical mechanics of multiedge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Modular reorganization of brain resting state networks and its independent validation in Alzheimer's disease patients

Previous studies have demonstrated disruption in structural and functional connectivity occurring in the Alzheimer's Disease (AD). However, it is not known how these disruptions alter brain network reorganization. With the modular analysis method of graph theory, and datasets acquired by the resting-state functional connectivity MRI (R-fMRI) method, we investigated and compared the brain organization patterns between the AD group and the cognitively normal control (CN) group. Our main finding is that the largest homotopic module (defined as the insula module) in the CN group was broken down to the pieces in the AD group. Specifically, it was discovered that the eight pairs of the bilateral regions (the opercular part of inferior frontal gyrus, area triangularis, insula, putamen, globus pallidus, transverse temporal gyri, superior temporal gyrus, and superior temporal pole) of the insula module had lost symmetric functional connection properties, and the corresponding gray matter concentration (GMC) was significant lower in AD group. We further quantified the functional connectivity changes with an index (index A) and structural changes with the GMC index in the insula module to demonstrate their great potential as AD biomarkers. We further validated these results with six additional independent datasets (271 subjects in six groups). Our results demonstrated specific underlying structural and functional reorganization from young to old, and for diseased subjects. Further, it is suggested that by combining the structural GMC analysis and functional modular analysis in the insula module, a new biomarker can be developed at the single-subject level.

Reorganization of functional networks in mild cognitive impairment

Whether the balance between integration and segregation of information in the brain is damaged in Mild Cognitive Impairment (MCI) subjects is still a matter of debate. Here we characterize the functional network architecture of MCI subjects by means of complex networks analysis. Magnetoencephalograms (MEG) time series obtained during a memory task were evaluated by synchronization likelihood (SL), to quantify the statistical dependence between MEG signals and to obtain the functional networks. Graphs from MCI subjects show an enhancement of the strength of connections, together with an increase in the outreach parameter, suggesting that memory processing in MCI subjects is associated with higher energy expenditure and a tendency toward random structure, which breaks the balance between integration and segregation. All features are reproduced by an evolutionary network model that simulates the degenerative process of a healthy functional network to that associated with MCI. Due to the high rate of conversion from MCI to Alzheimer Disease (AD), these results show that the analysis of functional networks could be an appropriate tool for the early detection of both MCI and AD.

Modular organization of brain resting state networks in chronic back pain patients

Recent work on functional magnetic resonance imaging large-scale brain networks under resting conditions demonstrated its potential to evaluate the integrity of brain function under normal and pathological conditions. A similar approach is used in this work to study a group of chronic back pain patients and healthy controls to determine the impact of long enduring pain over brain dynamics. Correlation networks were constructed from the mutual partial correlations of brain activity's time series selected from ninety regions using a well validated brain parcellation atlas. The study of the resulting networks revealed an organization of up to six communities with similar modularity in both groups, but with important differences in the membership of key communities of frontal and temporal regions. The bulk of these findings were confirmed by a surprisingly naive analysis based on the pairwise correlations of the strongest and weakest correlated healthy regions. Beside confirming the brain effects of long enduring pain, these results provide a framework to study the effect of other chronic conditions over cortical function.

Mean-field diffusive dynamics on weighted networks

Diffusion is a key element of a large set of phenomena occurring on natural and social systems modeled in terms of complex weighted networks. Here, we introduce a general formalism that allows to easily write down mean-field equations for any diffusive dynamics on weighted networks. We also propose the concept of annealed weighted networks, in which such equations become exact. We show the validity of our approach addressing the problem of the random walk process, pointing out a strong departure of the behavior observed in quenched real scale-free networks from the mean-field predictions. Additionally, we show how to employ our formalism for more complex dynamics. Our work sheds light on mean-field theory on weighted networks and on its range of validity, and warns about the reliability of mean-field results for complex dynamics.

A dynamic network approach for the study of human phenotypes

The use of networks to integrate different genetic, proteomic, and metabolic datasets has been proposed as a viable path toward elucidating the origins of specific diseases. Here we introduce a new phenotypic database summarizing correlations obtained from the disease history of more than 30 million patients in a Phenotypic Disease Network (PDN). We present evidence that the structure of the PDN is relevant to the understanding of illness progression by showing that (1) patients develop diseases close in the network to those they already have; (2) the progression of disease along the links of the network is different for patients of different genders and ethnicities; (3) patients diagnosed with diseases which are more highly connected in the PDN tend to die sooner than those affected by less connected diseases; and (4) diseases that tend to be preceded by others in the PDN tend to be more connected than diseases that precede other illnesses, and are associated with higher degrees of mortality. Our findings show that disease progression can be represented and studied using network methods, offering the potential to enhance our understanding of the origin and evolution of human diseases. The dataset introduced here, released concurrently with this publication, represents the largest relational phenotypic resource publicly available to the research community.

To help the understanding of physiological failures, diseases are defined as specific sets of phenotypes affecting one or several physiological systems. Yet, the complexity of biological systems implies that our working definitions of diseases are careful discretizations of a complex phenotypic space. To reconcile the discrete nature of diseases with the complexity of biological organisms, we need to understand how diseases are connected, as connections between these different discrete categories can be informative about the mechanisms causing physiological failures. Here we introduce the Phenotypic Disease Network (PDN) as a map summarizing phenotypic connections between diseases and show that diseases progress preferentially along the links of this map. Furthermore, we show that this progression is different for patients with different genders and racial backgrounds and that patients affected by diseases that are connected to many other diseases in the PDN tend to die sooner than those affected by less connected diseases. Additionally, we have created a queryable online database (http://hudine.neu.edu/) of the 18 different datasets generated from the more than 31 million patients in this study. The disease associations can be explored online or downloaded in bulk.

Clustering signatures classify directed networks

We use a clustering signature, based on a recently introduced generalization of the clustering coefficient to directed networks, to analyze 16 directed real-world networks of five different types: social networks, genetic transcription networks, word adjacency networks, food webs, and electric circuits. We show that these five classes of networks are cleanly separated in the space of clustering signatures due to the statistical properties of their local neighborhoods, demonstrating the usefulness of clustering signatures as a classifier of directed networks.

Clustering in complex directed networks

Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in the graph (independently of the direction of their edges) and CCs that only consider particular types of directed triangles (e.g., cycles). The main concepts are illustrated by employing empirical data on world-trade flows.