Reconstructing missing complex networks against adversarial interventions

Target controllability: a feed-forward greedy algorithm in complex networks, meeting Kalman's rank condition

MOTIVATION

The concept of controllability within complex networks is pivotal in determining the minimal set of driver vertices required for the exertion of external signals, thereby enabling control over the entire network's vertices. Target controllability further refines this concept by focusing on a subset of vertices within the network as the specific targets for control, both of which are known to be NP-hard problems. Crucially, the effectiveness of the driver set in achieving control of the network is contingent upon satisfying a specific rank condition, as introduced by Kalman. On the other hand, structural controllability provides a complementary approach to understanding network control, emphasizing the identification of driver vertices based on the network's structural properties. However, in structural controllability approaches, the Kalman condition may not always be satisfied.

RESULTS

In this study, we address the challenge of target controllability by proposing a feed-forward greedy algorithm designed to efficiently handle large networks while meeting the Kalman controllability rank condition. We further enhance our method's efficacy by integrating it with Barabasi et al.'s structural controllability approach. This integration allows for a more comprehensive control strategy, leveraging both the dynamical requirements specified by Kalman's rank condition and the structural properties of the network. Empirical evaluation across various network topologies demonstrates the superior performance of our algorithms compared to existing methods, consistently requiring fewer driver vertices for effective control. Additionally, our method's application to protein-protein interaction networks associated with breast cancer reveals potential drug repurposing candidates, underscoring its biomedical relevance. This study highlights the importance of addressing both structural and dynamical aspects of network controllability for advancing control strategies in complex systems.

AVAILABILITY AND IMPLEMENTATION

The source code is available for free at:Https://github.com/fatemeKhezry/targetControllability.

A unified approach of detecting phase transition in time-varying complex networks

Deciphering the non-trivial interactions and mechanisms driving the evolution of time-varying complex networks (TVCNs) plays a crucial role in designing optimal control strategies for such networks or enhancing their causal predictive capabilities. In this paper, we advance the science of TVCNs by providing a mathematical framework through which we can gauge how local changes within a complex weighted network affect its global properties. More precisely, we focus on unraveling unknown geometric properties of a network and determine its implications on detecting phase transitions within the dynamics of a TVCN. In this vein, we aim at elaborating a novel and unified approach that can be used to depict the relationship between local interactions in a complex network and its global kinetics. We propose a geometric-inspired framework to characterize the network's state and detect a phase transition between different states, to infer the TVCN's dynamics. A phase of a TVCN is determined by its Forman-Ricci curvature property. Numerical experiments show the usefulness of the proposed curvature formalism to detect the transition between phases within artificially generated networks. Furthermore, we demonstrate the effectiveness of the proposed framework in identifying the phase transition phenomena governing the training and learning processes of artificial neural networks. Moreover, we exploit this approach to investigate the phase transition phenomena in cellular re-programming by interpreting the dynamics of Hi-C matrices as TVCNs and observing singularity trends in the curvature network entropy. Finally, we demonstrate that this curvature formalism can detect a political change. Specifically, our framework can be applied to the US Senate data to detect a political change in the United States of America after the 1994 election, as discussed by political scientists.

Uncertainty in vulnerability of networks under attack

This study builds conceptual explanations and empirical examinations of the vulnerability response of networks under attack. Two quantities of "vulnerability" and "uncertainty in vulnerability" are defined by scrutinizing the performance loss trajectory of networks experiencing attacks. Both vulnerability and uncertainty in vulnerability quantities are a function of the network topology and size. This is tested on 16 distinct topologies appearing in infrastructure, social, and biological networks with 8 to 26 nodes under two percolation scenarios exemplifying benign and malicious attacks. The findings imply (i) crossing path, tree, and diverging tail are the most vulnerable topologies, (ii) complete and matching pairs are the least vulnerable topologies, (iii) complete grid and complete topologies show the most uncertainty for vulnerability, and (iv) hub-and-spoke and double u exhibit the least uncertainty in vulnerability. The findings also imply that both vulnerability and uncertainty in vulnerability increase with an increase in the size of the network. It is argued that in networks with no undirected cycle and one undirected cycle, the uncertainty in vulnerability is maximal earlier in the percolation process. With an increase in the number of cycles, the uncertainty in vulnerability is accumulated at the end of the percolation process. This emphasizes the role of tailoring preparedness, response, and recovery phases for networks with different topologies when they might experience disruption.

Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency

Many real-world networks characterized by power-law degree distributions are extremely vulnerable against malicious attacks. Therefore, it is important to obtain effective methods for strengthening the robustness of the existing networks. Previous studies have been discussed some link addition methods for improving the robustness. In particular, two effective strategies for selecting nodes to add links have been proposed: the minimum degree and longest distance strategies. However, it is unclear whether the effects of these strategies on the robustness are independent or not. In this paper, we investigate the contributions of these strategies to improving the robustness by adding links in distinguishing the effects of degrees and distances as much as possible. Through numerical simulation, we find that the robustness is effectively improved by adding links on the minimum degree strategy for both synthetic trees and real networks. As an exception, only when the number of added links is small, the longest distance strategy is the best. Conversely, the robustness is only slightly improved by adding links on the shortest distance strategy in many cases, even combined with the minimum degree strategy. Therefore, enhancing global loops is essential for improving the robustness rather than local loops.

Sexual dimorphism in the relationship between brain complexity, volume and general intelligence (g): a cross-cohort study

Changes in brain morphology have been reported during development, ageing and in relation to different pathologies. Brain morphology described by the shape complexity of gyri and sulci can be captured and quantified using fractal dimension (FD). This measure of brain structural complexity, as well as brain volume, are associated with intelligence, but less is known about the sexual dimorphism of these relationships. In this paper, sex differences in the relationship between brain structural complexity and general intelligence (g) in two diverse geographic and cultural populations (UK and Indian) are investigated. 3D T1-weighted magnetic resonance imaging (MRI) data and a battery of cognitive tests were acquired from participants belonging to three different cohorts: Mysore Parthenon Cohort (MPC); Aberdeen Children of the 1950s (ACONF) and UK Biobank. We computed MRI derived structural brain complexity and g estimated from a battery of cognitive tests for each group. Brain complexity and volume were both positively corelated with intelligence, with the correlations being significant in women but not always in men. This relationship is seen across populations of differing ages and geographical locations and improves understanding of neurobiological sex-differences.

Inferring functional communities from partially observed biological networks exploiting geometric topology and side information

Cellular biological networks represent the molecular interactions that shape function of living cells. Uncovering the organization of a biological network requires efficient and accurate algorithms to determine the components, termed communities, underlying specific processes. Detecting functional communities is challenging because reconstructed biological networks are always incomplete due to technical bias and biological complexity, and the evaluation of putative communities is further complicated by a lack of known ground truth. To address these challenges, we developed a geometric-based detection framework based on Ollivier-Ricci curvature to exploit information about network topology to perform community detection from partially observed biological networks. We further improved this approach by integrating knowledge of gene function, termed side information, into the Ollivier-Ricci curvature algorithm to aid in community detection. This approach identified essential conserved and varied biological communities from partially observed Arabidopsis protein interaction datasets better than the previously used methods. We show that Ollivier-Ricci curvature with side information identified an expanded auxin community to include an important protein stability complex, the Cop9 signalosome, consistent with previous reported links to auxin response and root development. The results show that community detection based on Ollivier-Ricci curvature with side information can uncover novel components and novel communities in biological networks, providing novel insight into the organization and function of complex networks.

The Fractal Tapestry of Life: III Multifractals Entail the Fractional Calculus

This is the third essay advocating the use the (non-integer) fractional calculus (FC) to capture the dynamics of complex networks in the twilight of the Newtonian era. Herein, the focus is on drawing a distinction between networks described by monfractal time series extensively discussed in the prequels and how they differ in function from multifractal time series, using physiological phenomena as exemplars. In prequel II, the network effect was introduced to explain how the collective dynamics of a complex network can transform a many-body non-linear dynamical system modeled using the integer calculus (IC) into a single-body fractional stochastic rate equation. Note that these essays are about biomedical phenomena that have historically been improperly modeled using the IC and how fractional calculus (FC) models better explain experimental results. This essay presents the biomedical entailment of the FC, but it is not a mathematical discussion in the sense that we are not concerned with the formal infrastucture, which is cited, but we are concerned with what that infrastructure entails. For example, the health of a physiologic network is characterized by the width of the multifractal spectrum associated with its time series, and which becomes narrower with the onset of certain pathologies. Physiologic time series that have explicitly related pathology to a narrowing of multifractal time series include but are not limited to heart rate variability (HRV), stride rate variability (SRV) and breath rate variability (BRV). The efficiency of the transfer of information due to the interaction between two such complex networks is determined by their relative spectral width, with information being transferred from the network with the broader to that with the narrower width. A fractional-order differential equation, whose order is random, is shown to generate a multifractal time series, thereby providing a FC model of the information exchange between complex networks. This equivalence between random fractional derivatives and multifractality has not received the recognition in the bioapplications literature we believe it warrants.

Inferring network structure with unobservable nodes from time series data

Network structures play important roles in social, technological, and biological systems. However, the observable nodes and connections in real cases are often incomplete or unavailable due to measurement errors, private protection issues, or other problems. Therefore, inferring the complete network structure is useful for understanding human interactions and complex dynamics. The existing studies have not fully solved the problem of the inferring network structure with partial information about connections or nodes. In this paper, we tackle the problem by utilizing time series data generated by network dynamics. We regard the network inference problem based on dynamical time series data as a problem of minimizing errors for predicting states of observable nodes and proposed a novel data-driven deep learning model called Gumbel-softmax Inference for Network (GIN) to solve the problem under incomplete information. The GIN framework includes three modules: a dynamics learner, a network generator, and an initial state generator to infer the unobservable parts of the network. We implement experiments on artificial and empirical social networks with discrete and continuous dynamics. The experiments show that our method can infer the unknown parts of the structure and the initial states of the observable nodes with up to 90% accuracy. The accuracy declines linearly with the increase of the fractions of unobservable nodes. Our framework may have wide applications where the network structure is hard to obtain and the time series data is rich.

Deciphering the generating rules and functionalities of complex networks

Network theory helps us understand, analyze, model, and design various complex systems. Complex networks encode the complex topology and structural interactions of various systems in nature. To mine the multiscale coupling, heterogeneity, and complexity of natural and technological systems, we need expressive and rigorous mathematical tools that can help us understand the growth, topology, dynamics, multiscale structures, and functionalities of complex networks and their interrelationships. Towards this end, we construct the node-based fractal dimension (NFD) and the node-based multifractal analysis (NMFA) framework to reveal the generating rules and quantify the scale-dependent topology and multifractal features of a dynamic complex network. We propose novel indicators for measuring the degree of complexity, heterogeneity, and asymmetry of network structures, as well as the structure distance between networks. This formalism provides new insights on learning the energy and phase transitions in the networked systems and can help us understand the multiple generating mechanisms governing the network evolution.

Fuzzy Recurrence Exponents of Subcellular-Nanostructure Dynamics in Time-lapse Confocal Imaging

Studying the dynamics of nanostructures in the intracellular space is important because it allows gaining insights into the mechanism of complex biological functions of organelles. Understanding such dynamical processes can contribute to the development of nanomedicine for the diagnosis and treatment of many diseases caused by the interaction of multiple genes and environmental factors. Here a quantitative measure of spatial-temporal dynamics of nanostructures within a cell line in the context of nonlinear dynamics is introduced, where early endosomes, late endosomes, and lysosomes recorded by time-lapse confocal imaging are examined. The mathematical derivation of the proposed technique is based on the concept of recurrence dynamics and sequential rate of change over time. The quantification introduced as fuzzy recurrence exponents can be generalized for characterizing the dynamics of experimental evolutions in other nanostructures of living cells captured under the optical microscope.

Biological networks across scales

Many biological systems across scales of size and complexity exhibit a time-varying complex network structure that emerges and self-organizes as a result of interactions with the environment. Network interactions optimize some intrinsic cost functions that are unknown and involve for example energy efficiency, robustness, resilience, and frailty. A wide range of networks exist in biology, from gene regulatory networks important for organismal development, protein interaction networks that govern physiology and metabolism, and neural networks that store and convey information to networks of microbes that form microbiomes within hosts, animal contact networks that underlie social systems, and networks of populations on the landscape connected by migration. Increasing availability of extensive (big) data is amplifying our ability to quantify biological networks. Similarly, theoretical methods that describe network structure and dynamics are being developed. Beyond static networks representing snapshots of biological systems, collections of longitudinal data series can help either at defining and characterizing network dynamics over time or analyzing the dynamics constrained to networked architectures. Moreover, due to interactions with the environment and other biological systems, a biological network may not be fully observable. Also, subnetworks may emerge and disappear as a result of the need for the biological system to cope with for example invaders or new information flows. The confluence of these developments renders tractable the question of how the structure of biological networks predicts and controls network dynamics. In particular, there may be structural features that result in homeostatic networks with specific higher-order statistics (e.g., multifractal spectrum), which maintain stability over time through robustness and/or resilience to perturbation. Alternative, plastic networks may respond to perturbation by (adaptive to catastrophic) shifts in structure. Here, we explore the opportunity for discovering universal laws connecting the structure of biological networks with their function, positioning them on the spectrum of time-evolving network structure, i.e. dynamics of networks, from highly stable to exquisitely sensitive to perturbation. If such general laws exist, they could transform our ability to predict the response of biological systems to perturbations-an increasingly urgent priority in the face of anthropogenic changes to the environment that affect life across the gamut of organizational scales.

Deciphering the laws of social network-transcendent COVID-19 misinformation dynamics and implications for combating misinformation phenomena

The global rise of COVID-19 health risk has triggered the related misinformation infodemic. We present the first analysis of COVID-19 misinformation networks and determine few of its implications. Firstly, we analyze the spread trends of COVID-19 misinformation and discover that the COVID-19 misinformation statistics are well fitted by a log-normal distribution. Secondly, we form misinformation networks by taking individual misinformation as a node and similarity between misinformation nodes as links, and we decipher the laws of COVID-19 misinformation network evolution: (1) We discover that misinformation evolves to optimize the network information transfer over time with the sacrifice of robustness. (2) We demonstrate the co-existence of fit get richer and rich get richer phenomena in misinformation networks. (3) We show that a misinformation network evolution with node deletion mechanism captures well the public attention shift on social media. Lastly, we present a network science inspired deep learning framework to accurately predict which Twitter posts are likely to become central nodes (i.e., high centrality) in a misinformation network from only one sentence without the need to know the whole network topology. With the network analysis and the central node prediction, we propose that if we correctly suppress certain central nodes in the misinformation network, the information transfer of network would be severely impacted.

Recovery patterns and physics of the network

In a progressively interconnected world, the loss of system resilience has consequences for human health, the economy, and the environment. Research has exploited the science of networks to explain the resilience of complex systems against random attacks, malicious attacks, and the localized attacks induced by natural disasters or mass attacks. Little is known about the elucidation of system recovery by the network topology. This study adds to the knowledge of network resilience by examining the nexus of recoverability and network topology. We establish a new paradigm for identifying the recovery behavior of networks and introduce the recoverability measure. Results indicate that the recovery response behavior and the recoverability measure are the function of both size and topology of networks. In small sized networks, the return to recovery exhibits homogeneous recovery behavior over topology, while the return shape is dispersed with an increase in the size of network. A network becomes more recoverable as connectivity measures of the network increase, and less recoverable as accessibility measures of network increase. Overall, the results not only offer guidance on designing recoverable networks, but also depict the recovery nature of networks deliberately following a disruption. Our recovery behavior and recoverability measure has been tested on 16 distinct network topologies. The relevant recovery behavior can be generalized based on our definition for any network topology recovering deliberately.

Distinguishing Epileptiform Discharges From Normal Electroencephalograms Using Adaptive Fractal and Network Analysis: A Clinical Perspective

Epilepsy is one of the most common disorders of the brain. Clinically, to corroborate an epileptic seizure-like symptom and to find the seizure localization, electroencephalogram (EEG) data are often visually examined by a clinical doctor to detect the presence of epileptiform discharges. Epileptiform discharges are transient waveforms lasting for several tens to hundreds of milliseconds and are mainly divided into seven types. It is important to develop systematic approaches to accurately distinguish these waveforms from normal control ones. This is a difficult task if one wishes to develop first principle rather than black-box based approaches, since clinically used scalp EEGs usually contain a lot of noise and artifacts. To solve this problem, we analyzed 640 multi-channel EEG segments, each 4s long. Among these segments, 540 are short epileptiform discharges, and 100 are from healthy controls. We have proposed two approaches for distinguishing epileptiform discharges from normal EEGs. The first method is based on Signal Range and EEGs' long range correlation properties characterized by the Hurst parameter H extracted by applying adaptive fractal analysis (AFA), which can also maximally suppress the effects of noise and various kinds of artifacts. Our second method is based on networks constructed from three aspects of the scalp EEG signals, the Signal Range, the energy of the alpha wave component, and EEG's long range correlation properties. The networks are further analyzed using singular value decomposition (SVD). The square of the first singular value from SVD is used to construct features to distinguish epileptiform discharges from normal controls. Using Random Forest Classifier (RF), our approaches can achieve very high accuracy in distinguishing epileptiform discharges from normal control ones, and thus are very promising to be used clinically. The network-based approach is also used to infer the localizations of each type of epileptiform discharges, and it is found that the sub-networks representing the most likely location of each type of epileptiform discharges are different among the seven types of epileptiform discharges.

A Brief Review of Chimera State in Empirical Brain Networks

Understanding the human brain and its functions has always been an interesting and challenging problem. Recently, a significant progress on this problem has been achieved on the aspect of chimera state where a coexistence of synchronized and unsynchronized states can be sustained in identical oscillators. This counterintuitive phenomenon is closely related to the unihemispheric sleep in some marine mammals and birds and has recently gotten a hot attention in neural systems, except the previous studies in non-neural systems such as phase oscillators. This review will briefly summarize the main results of chimera state in neuronal systems and pay special attention to the network of cerebral cortex, aiming to accelerate the study of chimera state in brain networks. Some outlooks are also discussed.

Controlling the Multifractal Generating Measures of Complex Networks

Mathematical modelling of real complex networks aims to characterize their architecture and decipher their underlying principles. Self-repeating patterns and multifractality exist in many real-world complex systems such as brain, genetic, geoscience, and social networks. To better comprehend the multifractal behavior in the real networks, we propose the weighted multifractal graph model to characterize the spatiotemporal complexity and heterogeneity encoded in the interaction weights. We provide analytical tools to verify the multifractal properties of the proposed model. By varying the parameters in the initial unit square, the model can reproduce a diverse range of multifractal spectrums with different degrees of symmetry, locations, support and shapes. We estimate and investigate the weighted multifractal graph model corresponding to two real-world complex systems, namely (i) the chromosome interactions of yeast cells in quiescence and in exponential growth, and (ii) the brain networks of cognitively healthy people and patients exhibiting late mild cognitive impairment leading to Alzheimer disease. The analysis of recovered models show that the proposed random graph model provides a novel way to understand the self-similar structure of complex networks and to discriminate different network structures. Additionally, by mapping real complex networks onto multifractal generating measures, it allows us to develop new network design and control strategies, such as the minimal control of multifractal measures of real systems under different functioning conditions or states.

Taming the Unknown Unknowns in Complex Systems: Challenges and Opportunities for Modeling, Analysis and Control of Complex (Biological) Collectives

Despite significant effort on understanding complex biological systems, we lack a unified theory for modeling, inference, analysis, and efficient control of their dynamics in uncertain environments. These problems are made even more challenging when considering that only limited and noisy information is accessible for modeling, which can prove insufficient for explaining, and predicting the behavior of complex systems. For instance, missing information hampers the capabilities of analytical tools to uncover the true degrees of freedom and infer the model structure and parameters of complex biological systems. Toward this end, in this paper, we discuss several important mathematical challenges that could open new theoretical avenues in studying complex systems: (1) By understanding the universal laws characterizing the asymmetric statistics of magnitude increments and the complex space-time interdependency within one process and across many processes, we can develop a class of compact yet accurate mathematical models capable to potentially providing higher degree of predictability, and more efficient control strategies. (2) In order to better predict the onset of disease and their root cause, as well as potentially discover more efficient quality-of-life (QoL)-control strategies, we need to develop mathematical strategies that not only are capable to discover causal interactions and their corresponding mathematical expressions for space and time operators acting on biological processes, but also mathematical and algorithmic techniques to identify the number of unknown unknowns (UUs) and their interdependency with the observed variables. (3) Lastly, to improve the QoL of control strategies when facing intra- and inter-patient variability, the focus should not only be on specific values and ranges for biological processes, but also on optimizing/controlling knob variables that enforce a specific spatiotemporal multifractal behavior that corresponds to an initial healthy (patient specific) behavior. All in all, the modeling, analysis and control of complex biological collective systems requires a deeper understanding of the multifractal properties of high dimensional heterogeneous and noisy data streams and new algorithmic tools that exploit geometric, statistical physics, and information theoretic concepts to deal with these data challenges.