Complex Networks and Symmetry I: A Review

Does the brain behave like a (complex) network? I. Dynamics

Graph theory is now becoming a standard tool in system-level neuroscience. However, endowing observed brain anatomy and dynamics with a complex network structure does not entail that the brain actually works as a network. Asking whether the brain behaves as a network means asking whether network properties count. From the viewpoint of neurophysiology and, possibly, of brain physics, the most substantial issues a network structure may be instrumental in addressing relate to the influence of network properties on brain dynamics and to whether these properties ultimately explain some aspects of brain function. Here, we address the dynamical implications of complex network, examining which aspects and scales of brain activity may be understood to genuinely behave as a network. To do so, we first define the meaning of networkness, and analyse some of its implications. We then examine ways in which brain anatomy and dynamics can be endowed with a network structure and discuss possible ways in which network structure may be shown to represent a genuine organisational principle of brain activity, rather than just a convenient description of its anatomy and dynamics.

A Strategy Utilizing Protein-Protein Interaction Hubs for the Treatment of Cancer Diseases

We describe a strategy for the development of a rational approach of neoplastic disease therapy based on the demonstration that scale-free networks are susceptible to specific attacks directed against its connective hubs. This strategy involves the (i) selection of up-regulated hubs of connectivity in the tumors interactome, (ii) drug repurposing of these hubs, (iii) RNA silencing of non-druggable hubs, (iv) in vitro hub validation, (v) tumor-on-a-chip, (vi) in vivo validation, and (vii) clinical trial. Hubs are protein targets that are assessed as targets for rational therapy of cancer in the context of personalized oncology. We confirmed the existence of a negative correlation between malignant cell aggressivity and the target number needed for specific drugs or RNA interference (RNAi) to maximize the benefit to the patient's overall survival. Interestingly, we found that some additional proteins not generally targeted by drug treatments might justify the addition of inhibitors designed against them in order to improve therapeutic outcomes. However, many proteins are not druggable, or the available pharmacopeia for these targets is limited, which justifies a therapy based on encapsulated RNAi.

Gibbs Energy and Gene Expression Combined as a New Technique for Selecting Drug Targets for Inhibiting Specific Protein-Protein Interactions

One of the most important aspects of successful cancer therapy is the identification of a target protein for inhibition interaction. Conventionally, this consists of screening a panel of genes to assess which is mutated and then developing a small molecule to inhibit the interaction of two proteins or to simply inhibit a specific protein from all interactions. In previous work, we have proposed computational methods that analyze protein-protein networks using both topological approaches and thermodynamic quantification provided by Gibbs free energy. In order to make these approaches both easier to implement and free of arbitrary topological filtration criteria, in the present paper, we propose a modification of the topological-thermodynamic analysis, which focuses on the selection of the most thermodynamically stable proteins and their subnetwork interaction partners with the highest expression levels. We illustrate the implementation of the new approach with two specific cases, glioblastoma (glioma brain tumors) and chronic lymphatic leukoma (CLL), based on the publicly available patient-derived datasets. We also discuss how this can be used in clinical practice in connection with the availability of approved and investigational drugs.

A Complex Network-Based Airspace Association Network Model and Its Characteristic Analysis

As airspace congestion becomes more and more serious, it not only affects the efficiency and quality of aviation activities, but also poses a greater safety hazard. For in-depth exploration of the airspace network, a new airspace association network that differs from the traditional aviation approach of organizing the airspace into a network of sectors based on aircraft traffic flow is proposed. By judging the relationship between the size and location of the airspace and other properties, the establishment of an association network provides new ideas for airspace conflict detection and other aerial tasks. The three key factors of airspace use conflict were extracted and quantified, then the Analytic Hierarchy Process (AHP) was used to assign weights to basic symmetric operators corresponding to three factors to calculate the final airspace correction degree, which reveals the magnitude of correlation degree between the airspace caused by the combined action of the above three factors. Finally, an airspace association network model was established according to the association degree, using basic symmetric operators to explore the general symmetry and network characteristics in real-world airspace association networks, and the feature indices, such as degree, strength, average correlation, clustering coefficient, and structure information entropy of the network, are proposed. The results show that the nodes with higher node degree and node association strength are often key nodes in the network, and the areas with higher average association degree and clustering coefficient are often more prone to airspace conflicts. At the same time, it was also verified that the safety distance between airspace has the greatest impact on the characteristics of the airspace association network.

Dimension-reduction of dynamics on real-world networks with symmetry

We derive explicit formulae to quantify the Markov chain state-space compression, or lumping, that can be achieved in a broad range of dynamical processes on real-world networks, including models of epidemics and voting behaviour, by exploiting redundancies due to symmetries. These formulae are applied in a large-scale study of such symmetry-induced lumping in real-world networks, from which we identify specific networks for which lumping enables exact analysis that could not have been done on the full state-space. For most networks, lumping gives a state-space compression ratio of up to 10 7 , but the largest compression ratio identified is nearly 10 12 . Many of the highest compression ratios occur in animal social networks. We also present examples of types of symmetry found in real-world networks that have not been previously reported.

A Novel Information Theoretical Criterion for Climate Network Construction

This paper presents a novel methodology for Climate Network (CN) construction based on the Kullback-Leibler divergence (KLD) among Membership Probability (MP) distributions, obtained from the Second Order Data-Coupled Clustering (SODCC) algorithm. The proposed method is able to obtain CNs with emergent behaviour adapted to the variables being analyzed, and with a low number of spurious or missing links. We evaluate the proposed method in a problem of CN construction to assess differences in wind speed prediction at different wind farms in Spain. The considered problem presents strong local and mesoscale relationships, but low synoptic scale relationships, which have a direct influence in the CN obtained. We carry out a comparison of the proposed approach with a classical correlation-based CN construction method. We show that the proposed approach based on the SODCC algorithm and the KLD constructs CNs with an emergent behaviour according to underlying wind speed prediction data physics, unlike the correlation-based method that produces spurious and missing links. Furthermore, it is shown that the climate network construction method facilitates the evaluation of symmetry properties in the resulting complex networks.

A Structured Table of Graphs with Symmetries and Other Special Properties

We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly discovered, may find wide applications, for example, in design of network topologies.

Next Generation Networks: Featuring the Potential Role of Emerging Applications in Translational Oncology

Nowadays, networks are pervasively used as examples of models suitable to mathematically represent and visualize the complexity of systems associated with many diseases, including cancer. In the cancer context, the concept of network entropy has guided many studies focused on comparing equilibrium to disequilibrium (i.e., perturbed) conditions. Since these conditions reflect both structural and dynamic properties of network interaction maps, the derived topological characterizations offer precious support to conduct cancer inference. Recent innovative directions have emerged in network medicine addressing especially experimental omics approaches integrated with a variety of other data, from molecular to clinical and also electronic records, bioimaging etc. This work considers a few theoretically relevant concepts likely to impact the future of applications in personalized/precision/translational oncology. The focus goes to specific properties of networks that are still not commonly utilized or studied in the oncological domain, and they are: controllability, synchronization and symmetry. The examples here provided take inspiration from the consideration of metastatic processes, especially their progression through stages and their hallmark characteristics. Casting these processes into computational frameworks and identifying network states with specific modular configurations may be extremely useful to interpret or even understand dysregulation patterns underlying cancer, and associated events (onset, progression) and disease phenotypes.

Analysis of Open Source Operating System Evolution: A Perspective from Package Dependency Network Motif

Complexity of open source operating systems constantly increase on account of their widespread application. It is increasingly difficult to understand the collaboration between components in the system. Extant research of open source operating system evolution is mainly achieved by Lehman’s law, which is conducted by analyzing characteristics such as line of the source code. Networks, which are utilized to demonstrate relationships among entities, is an adequate model for exploring cooperation of units that form a software system. Software network has become a research hotspot in the field of software engineering, leading to a new viewpoint for us to estimate evolution of open source operating systems. Motif, a connected subgraph that occurs frequently in a network, is extensively used in other scientific research such as bioscience to detect evolutionary rules. Thus, this paper constructs software package dependency network of open source software operating systems and investigates their evolutionary discipline from the perspective of the motif. Results of our experiments, which took Ubuntu Kylin as a study example, indicate a stable evolution of motif change as well as discovering structural defect in that system.

Package Network Model: A Way to Capture Holistic Structural Features of Open-Source Operating Systems

Open-source software has become a powerful engine for the development of the software industry. Its production mode, which is based on large-scale group collaboration, allows for the rapid and continuous evolution of open-source software on demand. As an important branch of open-source software, open-source operating systems are commonly used in modern service industries such as finance, logistics, education, medical care, e-commerce and tourism, etc. The reliability of these systems is increasingly valued. However, a self-organizing and loosely coupled development approach complicates the structural analysis of open-source operating system software. Traditional methods focus on analysis at the local level. There is a lack of research on the relationship between internal attributes and external overall characteristics. Consequently, conventional methods are difficult to adapt to complex software systems, especially the structural analysis of open-source operating system software. It is therefore of great significance to capture the holistic structure and behavior of the software system. Complex network theory, which is adequate for this task, can make up for the deficiency of traditional software structure evaluation methods that focus only on local structure. In this paper, we propose a package network model, which is a directed graph structure, to describe the dependency of open-source operating system software packages. Based on the Ubuntu Kylin Linux Operating system, we construct a software package dependency network of each distributed version and analyze the structural evolution through the dimensions of scale, density, connectivity, cohesion, and heterogeneity of each network.

Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs

The generalization of Farey graphs and extended Farey graphs all originate from Farey graphs. They are simultaneously scale-free and small-world. A labeling of the vertices for them are proposed here. All of the shortest paths between any two vertices in these two graphs can be determined only on their labels. The number of shortest paths between any two vertices is the product of two Fibonacci numbers; it is increasing almost linearly with the order or size of the graphs. However, the label-based routing algorithm runs in logarithmic time O(logn). Our efficient routing protocol for Farey-type models should help contribute toward the understanding of several physical dynamic processes.

How Symmetric Are Real-World Graphs? A Large-Scale Study

The analysis of symmetry is a main principle in natural sciences, especially physics. For network sciences, for example, in social sciences, computer science and data science, only a few small-scale studies of the symmetry of complex real-world graphs exist. Graph symmetry is a topic rooted in mathematics and is not yet well-received and applied in practice. This article underlines the importance of analyzing symmetry by showing the existence of symmetry in real-world graphs. An analysis of over 1500 graph datasets from the meta-repository networkrepository.com is carried out and a normalized version of the “network redundancy” measure is presented. It quantifies graph symmetry in terms of the number of orbits of the symmetry group from zero (no symmetries) to one (completely symmetric), and improves the recognition of asymmetric graphs. Over 70% of the analyzed graphs contain symmetries (i.e., graph automorphisms), independent of size and modularity. Therefore, we conclude that real-world graphs are likely to contain symmetries. This contribution is the first larger-scale study of symmetry in graphs and it shows the necessity of handling symmetry in data analysis: The existence of symmetries in graphs is the cause of two problems in graph clustering we are aware of, namely, the existence of multiple equivalent solutions with the same value of the clustering criterion and, secondly, the inability of all standard partition-comparison measures of cluster analysis to identify automorphic partitions as equivalent.

Symmetry and symmetry breaking in cancer: a foundational approach to the cancer problem

Symmetry and symmetry breaking concepts from physics and biology are applied to the problem of cancer. Three categories of symmetry breaking in cancer are examined: combinatorial, geometric, and functional. Within these categories, symmetry breaking is examined for relevant cancer features, including epithelial-mesenchymal transition (EMT); tumor heterogeneity; tensegrity; fractal geometric and information structure; functional interaction networks; and network stabilizability and attack tolerance. The new cancer symmetry concepts are relevant to homeostasis loss in cancer and to its origin, spread, treatment and resistance. Symmetry and symmetry breaking could provide a new way of thinking and a pathway to a solution of the cancer problem.

CD-Based Indices for Link Prediction in Complex Network

Lots of similarity-based algorithms have been designed to deal with the problem of link prediction in the past decade. In order to improve prediction accuracy, a novel cosine similarity index CD based on distance between nodes and cosine value between vectors is proposed in this paper. Firstly, node coordinate matrix can be obtained by node distances which are different from distance matrix and row vectors of the matrix are regarded as coordinates of nodes. Then, cosine value between node coordinates is used as their similarity index. A local community density index LD is also proposed. Then, a series of CD-based indices include CD-LD-k, CD*LD-k, CD-k and CDI are presented and applied in ten real networks. Experimental results demonstrate the effectiveness of CD-based indices. The effects of network clustering coefficient and assortative coefficient on prediction accuracy of indices are analyzed. CD-LD-k and CD*LD-k can improve prediction accuracy without considering the assortative coefficient of network is negative or positive. According to analysis of relative precision of each method on each network, CD-LD-k and CD*LD-k indices have excellent average performance and robustness. CD and CD-k indices perform better on positive assortative networks than on negative assortative networks. For negative assortative networks, we improve and refine CD index, referred as CDI index, combining the advantages of CD index and evolutionary mechanism of the network model BA. Experimental results reveal that CDI index can increase prediction accuracy of CD on negative assortative networks.

Algebraic and topological indices of molecular pathway networks in human cancers

Protein-protein interaction networks associated with diseases have gained prominence as an area of research. We investigate algebraic and topological indices for protein-protein interaction networks of 11 human cancers derived from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database. We find a strong correlation between relative automorphism group sizes and topological network complexities on the one hand and five year survival probabilities on the other hand. Moreover, we identify several protein families (e.g. PIK, ITG, AKT families) that are repeated motifs in many of the cancer pathways. Interestingly, these sources of symmetry are often central rather than peripheral. Our results can aide in identification of promising targets for anti-cancer drugs. Beyond that, we provide a unifying framework to study protein-protein interaction networks of families of related diseases (e.g. neurodegenerative diseases, viral diseases, substance abuse disorders).

Phase-lag synchronization in networks of coupled chemical oscillators

Chemical oscillators with a broad frequency distribution are photochemically coupled in network topologies. Experiments and simulations show that the network synchronization occurs by phase-lag synchronization of clusters of oscillators with zero- or nearly zero-lag synchronization. Symmetry also plays a role in the synchronization, the extent of which is explored as a function of coupling strength, frequency distribution, and the highest frequency oscillator location. The phase-lag synchronization occurs through connected synchronized clusters, with the highest frequency node or nodes setting the frequency of the entire network. The synchronized clusters successively "fire," with a constant phase difference between them. For low heterogeneity and high coupling strength, the synchronized clusters are made up of one or more clusters of nodes with the same permutation symmetries. As heterogeneity is increased or coupling strength decreased, the phase-lag synchronization occurs partially through clusters of nodes sharing the same permutation symmetries. As heterogeneity is further increased or coupling strength decreased, partial synchronization and, finally, independent unsynchronized oscillations are observed. The relationships between these classes of behavior are explored with numerical simulations, which agree well with the experimentally observed behavior.

A computational strategy to select optimized protein targets for drug development toward the control of cancer diseases

In this report, we describe a strategy for the optimized selection of protein targets suitable for drug development against neoplastic diseases taking the particular case of breast cancer as an example. We combined human interactome and transcriptome data from malignant and control cell lines because highly connected proteins that are up-regulated in malignant cell lines are expected to be suitable protein targets for chemotherapy with a lower rate of undesirable side effects. We normalized transcriptome data and applied a statistic treatment to objectively extract the sub-networks of down- and up-regulated genes whose proteins effectively interact. We chose the most connected ones that act as protein hubs, most being in the signaling network. We show that the protein targets effectively identified by the combination of protein connectivity and differential expression are known as suitable targets for the successful chemotherapy of breast cancer. Interestingly, we found additional proteins, not generally targeted by drug treatments, which might justify the extension of existing formulation by addition of inhibitors designed against these proteins with the consequence of improving therapeutic outcomes. The molecular alterations observed in breast cancer cell lines represent either driver events and/or driver pathways that are necessary for breast cancer development or progression. However, it is clear that signaling mechanisms of the luminal A, B and triple negative subtypes are different. Furthermore, the up- and down-regulated networks predicted subtype-specific drug targets and possible compensation circuits between up- and down-regulated genes. We believe these results may have significant clinical implications in the personalized treatment of cancer patients allowing an objective approach to the recycling of the arsenal of available drugs to the specific case of each breast cancer given their distinct qualitative and quantitative molecular traits.

Reciprocity of weighted networks

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

Spatial effects in real networks: measures, null models, and applications

Spatially embedded networks are shaped by a combination of purely topological (space-independent) and space-dependent formation rules. While it is quite easy to artificially generate networks where the relative importance of these two factors can be varied arbitrarily, it is much more difficult to disentangle these two architectural effects in real networks. Here we propose a solution to this problem, by introducing global and local measures of spatial effects that, through a comparison with adequate null models, effectively filter out the spurious contribution of nonspatial constraints. Our filtering allows us to consistently compare different embedded networks or different historical snapshots of the same network. As a challenging application we analyze the World Trade Web, whose topology is known to depend on geographic distances but is also strongly determined by nonspatial constraints (degree sequence or gross domestic product). Remarkably, we are able to detect weak but significant spatial effects both locally and globally in the network, showing that our method succeeds in retrieving spatial information even when nonspatial factors dominate. We finally relate our results to the economic literature on gravity models and trade globalization.