Rényi entropy-complexity causality space: a novel neurocomputational tool for detecting scale-free features in EEG/iEEG data.

Scale-free brain activity, linked with learning, the integration of different time scales, and the formation of mental models, is correlated with a metastable cognitive basis. The spectral slope, a key aspect of scale-free dynamics, was proposed as a potential indicator to distinguish between different sleep stages. Studies suggest that brain networks maintain a consistent scale-free structure across wakefulness, anesthesia, and recovery. Although differences in anesthetic sensitivity between the sexes are recognized, these variations are not evident in clinical electroencephalographic recordings of the cortex. Recently, changes in the slope of the power law exponent of neural activity were found to correlate with changes in Rényi entropy, an extended concept of Shannon's information entropy. These findings establish quantifiers as a promising tool for the study of scale-free dynamics in the brain. Our study presents a novel visual representation called the Rényi entropy-complexity causality space, which encapsulates complexity, permutation entropy, and the Rényi parameter q. The main goal of this study is to define this space for classical dynamical systems within theoretical bounds. In addition, the study aims to investigate how well different time series mimicking scale-free activity can be discriminated. Finally, this tool is used to detect dynamic features in intracranial electroencephalography (iEEG) signals. To achieve these goals, the study implementse the Bandt and Pompe method for ordinal patterns. In this process, each signal is associated with a probability distribution, and the causal measures of Rényi entropy and complexity are computed based on the parameter q. This method is a valuable tool for analyzing simulated time series. It effectively distinguishes elements of correlated noise and provides a straightforward means of examining differences in behaviors, characteristics, and classifications. For the iEEG experimental data, the REM state showed a greater number of significant sex-based differences, while the supramarginal gyrus region showed the most variation across different modes and analyzes. Exploring scale-free brain activity with this framework could provide valuable insights into cognition and neurological disorders. The results may have implications for understanding differences in brain function between the sexes and their possible relevance to neurological disorders.

A network model of social contacts with small-world and scale-free features, tunable connectivity, and geographic restrictions.

Small-world networks and scale-free networks are well-known theoretical models within the realm of complex graphs. These models exhibit "low" average shortest-path length; however, key distinctions are observed in their degree distributions and average clustering coefficients: in small-world networks, the degree distribution is bell-shaped and the clustering is "high"; in scale-free networks, the degree distribution follows a power law and the clustering is "low". Here, a model for generating scale-free graphs with "high" clustering is numerically explored, since these features are concurrently identified in networks representing social interactions. In this model, the values of average degree and exponent of the power-law degree distribution are both adjustable, and spatial limitations in the creation of links are taken into account. Several topological metrics are calculated and compared for computer-generated graphs. Unexpectedly, the numerical experiments show that, by varying the model parameters, a transition from a power-law to a bell-shaped degree distribution can occur. Also, in these graphs, the degree distribution is most accurately characterized by a pure power-law for values of the exponent typically found in real-world networks.

Scale-free dynamics of COVID-19 in a Brazilian city.

A common basis to address the dynamics of directly transmitted infectious diseases, such as COVID-19, are compartmental (or SIR) models. SIR models typically assume homogenous population mixing, a simplification that is convenient but unrealistic. Here we validate an existing model of a scale-free fractal infection process using high-resolution data on COVID-19 spread in São Caetano, Brazil. We find that transmission can be described by a network in which each infectious individual has a small number of susceptible contacts, of the order of 2-5. This model parameter correlated tightly with physical distancing measured by mobile phone data, such that in periods of greater distancing the model recovered a lower average number of contacts, and vice versa. We show that the SIR model is a special case of our scale-free fractal process model in which the parameter that reflects population structure is set at unity, indicating homogeneous mixing. Our more general framework better explained the dynamics of COVID-19 in São Caetano, used fewer parameters than a standard SIR model and accounted for geographically localized clusters of disease. Our model requires further validation in other locations and with other directly transmitted infectious agents.

Identification of Relevant Protein Interactions with Partial Knowledge: A Complex Network and Deep Learning Approach.

Protein-protein interactions (PPIs) are the basis for understanding most cellular events in biological systems. Several experimental methods, e.g., biochemical, molecular, and genetic methods, have been used to identify protein-protein associations. However, some of them, such as mass spectrometry, are time-consuming and expensive. Machine learning (ML) techniques have been widely used to characterize PPIs, increasing the number of proteins analyzed simultaneously and optimizing time and resources for identifying and predicting protein-protein functional linkages. Previous ML approaches have focused on well-known networks or specific targets but not on identifying relevant proteins with partial or null knowledge of the interaction networks. The proposed approach aims to generate a relevant protein sequence based on bidirectional Long-Short Term Memory (LSTM) with partial knowledge of interactions. The general framework comprises conducting a scale-free and fractal complex network analysis. The outcome of these analyses is then used to fine-tune the fractal method for the vital protein extraction of PPI networks. The results show that several PPI networks are self-similar or fractal, but that both features cannot coexist. The generated protein sequences (by the bidirectional LSTM) also contain an average of 39.5% of proteins in the original sequence. The average length of the generated sequences was 17% of the original one. Finally, 95% of the generated sequences were true.

Conflict Dynamics in Scale-Free Networks with Degree Correlations and Hierarchical Structure.

We present a study of the dynamic interactions between actors located on complex networks with scale-free and hierarchical scale-free topologies with assortative mixing, that is, correlations between the degree distributions of the actors. The actor's state evolves according to a model that considers its previous state, the inertia to change, and the influence of its neighborhood. We show that the time evolution of the system depends on the percentage of cooperative or competitive interactions. For scale-free networks, we find that the dispersion between actors is higher when all interactions are either cooperative or competitive, while a balanced presence of interactions leads to a lower separation. Moreover, positive assortative mixing leads to greater divergence between the states, while negative assortative mixing reduces this dispersion. We also find that hierarchical scale-free networks have both similarities and differences when compared with scale-free networks. Hierarchical scale-free networks, like scale-free networks, show the least divergence for an equal mix of cooperative and competitive interactions between actors. On the other hand, hierarchical scale-free networks, unlike scale-free networks, show much greater divergence when dominated by cooperative rather than competitive actors, and while the formation of a rich club (adding links between hubs) with cooperative interactions leads to greater divergence, the divergence is much less when they are fully competitive. Our findings highlight the importance of the topology where the interaction dynamics take place, and the fact that a balanced presence of cooperators and competitors makes the system more cohesive, compared to the case where one strategy dominates.

A complex network model for a society with socioeconomic classes.

People's attitudes and behaviors are partially shaped by the socioeconomic class to which they belong. In this work, a model of scale-free graph is proposed to represent the daily personal contacts in a society with three social classes. In the model, the probability of having a connection between two individuals depends on their social classes and on their physical distance. Numerical simulations are performed by considering sociodemographic data from France, Peru, and Zimbabwe. For the complex networks built for these three countries, average values of node degree, shortest-path length, clustering coefficient, closeness centrality, betweenness centrality, and eigenvector centrality are computed. These numerical results are discussed by taking into account the propagation of information about COVID-19.

SARS-CoV-2 Molecular Network Structure.

Knowledge about the molecular basis of SARS-CoV-2 infection is incipient. However, recent experimental results about the virus interactome have shown that this single-positive stranded RNA virus produces a set of about 28 specific proteins grouped into 16 non-structural proteins (Nsp1 to Nsp16), four structural proteins (E, M, N, and S), and eight accessory proteins (orf3a, orf6, orf7a, orf7b, orf8, orf9b, orf9c, and orf10). In this brief communication, the network model of the interactome of these viral proteins with the host proteins is analyzed. The statistical analysis of this network shows that it has a modular scale-free topology in which the virus proteins orf8, M, and Nsp7 are the three nodes with the most connections (links). This result suggests the possibility that a simultaneous pharmacological attack on these hubs could assure the destruction of the network and the elimination of the virus.

Simple epidemic network model for highly heterogeneous populations.

Network models for disease transmission and dynamics are popular because they are among the simplest agent-based models. Highly heterogeneous populations (in the number of contacts) may be modeled by networks with long-tailed degree distributions for which the variance is much greater than the mean degree. An example is given by scale-free networks where the degree distribution follows a power law. In these type of networks there is not a typical degree. Some nodes may have low representation in the population but are key to drive disease transmission. Coarse graining may be used to simplify these complex networks. In this work we present a simple model consisting in of a network where nodes have only two possible degrees, a low degree close to the mean degree and a high degree about ten times the mean degree. We show that in spite of this extreme simplification, main features of disease dynamics in scale-free networks are well captured by our model.

Dynamics of Dual Scale-Free Polymer Networks.

We focus on macromolecules which are modeled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale-free networks through rings, which are then transformed in a small-world manner up to the complete graphs. In this respect, the parameter γ describing the degree distribution in the primal treelike scale-free networks regulates the size of the dual units. The transition towards the networks of complete graphs is controlled by the probability p of adding a link between non-neighboring nodes of the same initial ring. The relaxation dynamics of the polymer networks is studied in the framework of generalized Gaussian structures by using the full eigenvalue spectrum of the Laplacian matrix. The dynamical quantities on which we focus here are the averaged monomer displacement and the mechanical relaxation moduli. For several intermediate values of the parameters' set ( γ , p ) , we encounter for these dynamical properties regions of constant in-between slope.

Tinnitus: network pathophysiology-network pharmacology.

Tinnitus, the phantom perception of sound, is a prevalent disorder. One in 10 adults has clinically significant subjective tinnitus, and for one in 100, tinnitus severely affects their quality of life. Despite the significant unmet clinical need for a safe and effective drug targeting tinnitus relief, there is currently not a single Food and Drug Administration (FDA)-approved drug on the market. The search for drugs that target tinnitus is hampered by the lack of a deep knowledge of the underlying neural substrates of this pathology. Recent studies are increasingly demonstrating that, as described for other central nervous system (CNS) disorders, tinnitus is a pathology of brain networks. The application of graph theoretical analysis to brain networks has recently provided new information concerning their topology, their robustness and their vulnerability to attacks. Moreover, the philosophy behind drug design and pharmacotherapy in CNS pathologies is changing from that of "magic bullets" that target individual chemoreceptors or "disease-causing genes" into that of "magic shotguns," "promiscuous" or "dirty drugs" that target "disease-causing networks," also known as network pharmacology. In the present work we provide some insight into how this knowledge could be applied to tinnitus pathophysiology and pharmacotherapy.