Comparison of Different Spike Train Synchrony Measures Regarding Their Robustness to Erroneous Data From Bicuculline-Induced Epileptiform Activity.

As synchronized activity is associated with basic brain functions and pathological states, spike train synchrony has become an important measure to analyze experimental neuronal data. Many measures of spike train synchrony have been proposed, but there is no gold standard allowing for comparison of results from different experiments. This work aims to provide guidance on which synchrony measure is best suited to quantify the effect of epileptiform-inducing substances (e.g., bicuculline, BIC) in in vitro neuronal spike train data. Spike train data from recordings are likely to suffer from erroneous spike detection, such as missed spikes (false negative) or noise (false positive). Therefore, different timescale-dependent (cross-correlation, mutual information, spike time tiling coefficient) and timescale-independent (Spike-contrast, phase synchronization (PS), A-SPIKE-synchronization, A-ISI-distance, ARI-SPIKE-distance) synchrony measures were compared in terms of their robustness to erroneous spike trains. For this purpose, erroneous spike trains were generated by randomly adding (false positive) or deleting (false negative) spikes (in silico manipulated data) from experimental data. In addition, experimental data were analyzed using different spike detection threshold factors in order to confirm the robustness of the synchrony measures. All experimental data were recorded from cortical neuronal networks on microelectrode array chips, which show epileptiform activity induced by the substance BIC. As a result of the in silico manipulated data, Spike-contrast was the only measure that was robust to false-negative as well as false-positive spikes. Analyzing the experimental data set revealed that all measures were able to capture the effect of BIC in a statistically significant way, with Spike-contrast showing the highest statistical significance even at low spike detection thresholds. In summary, we suggest using Spike-contrast to complement established synchrony measures because it is timescale independent and robust to erroneous spike trains.

From unbiased to maximal-entropy random walks on hypergraphs.

Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order relationships, which are naturally represented by hypergraphs. Here we study random walks on hypergraphs. Due to the higher-order nature of these mathematical objects, one can define more than one type of walks. In particular, we study the unbiased and the maximal entropy random walk on hypergraphs with two types of steps, emphasizing their similarities and differences. We characterize these dynamic processes by examining their stationary distributions and associated hitting times. To illustrate our findings, we present a toy example and conduct extensive analyses of artificial and real hypergraphs, providing insights into both their structural and dynamical properties. We hope that our findings motivate further research extending the analysis to different classes of random walks as well as to practical applications.

Evolutionary dynamics of higher-order interactions in social networks.

We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in larger groups. Here, we study the evolutionary dynamics of a public goods game in social systems with higher-order interactions. First, we show that the game on uniform hypergraphs corresponds to the replicator dynamics in the well-mixed limit, providing a formal theoretical foundation to study cooperation in networked groups. Second, we unveil how the presence of hubs and the coexistence of interactions in groups of different sizes affects the evolution of cooperation. Finally, we apply the proposed framework to extract the actual dependence of the synergy factor on the size of a group from real-world collaboration data in science and technology. Our work provides a way to implement informed actions to boost cooperation in social groups.

Layer degradation triggers an abrupt structural transition in multiplex networks.

Network robustness is a central point in network science, both from a theoretical and a practical point of view. In this paper, we show that layer degradation, understood as the continuous or discrete loss of links' weight, triggers a structural transition revealed by an abrupt change in the algebraic connectivity of the graph. Unlike traditional single layer networks, multiplex networks exist in two phases, one in which the system is protected from link failures in some of its layers and one in which all the system senses the failure happening in one single layer. We also give the exact critical value of the weight of the intralayer links at which the transition occurs for continuous layer degradation and its relation with the value of the coupling between layers. This relation allows us to reveal the connection between the transition observed under layer degradation and the one observed under the variation of the coupling between layers.

Scaling properties of multilayer random networks.

Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them. Here, we numerically demonstrate that the normalized localization length ß of the eigenfunctions of multilayer random networks follows a simple scaling law given by ß=x^{*}/(1+x^{*}), with x^{*}=γ(b_{eff}^{2}/L)^{δ}, δ∼1, and b_{eff} being the effective bandwidth of the adjacency matrix of the network, whose size is L. The scaling law for ß, that we validate on real-world networks, might help to better understand criticality in multilayer networks and to predict the eigenfunction localization properties of them.

A process of rumour scotching on finite populations.

Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders try to transmit an information, while stiflers are also active and try to scotch it. We study the influence of transmission/scotching rates and initial conditions on the qualitative behaviour of the process. An analytical treatment based on the theory of convergence of density-dependent Markov chains is developed to analyse how the final proportion of ignorants behaves asymptotically in a finite homogeneously mixing population. We perform Monte Carlo simulations in random graphs and scale-free networks and verify that the results obtained for homogeneously mixing populations can be approximated for random graphs, but are not suitable for scale-free networks. Furthermore, regarding the process on a heterogeneous mixing population, we obtain a set of differential equations that describes the time evolution of the probability that an individual is in each state. Our model can also be applied for studying systems in which informed agents try to stop the rumour propagation, or for describing related susceptible-infected-recovered systems. In addition, our results can be considered to develop optimal information dissemination strategies and approaches to control rumour propagation.

Structure and dynamics of functional networks in child-onset schizophrenia.

OBJECTIVE: Schizophrenia is a neuropsychiatric disorder characterized by cognitive and emotional deficits and associated with various abnormalities in the organization of neural circuits. It is currently unclear how and to which extend the global network organization is changed due to such disorder. In this work, we analyzed cortical networks of healthy subjects and patients with child-onset schizophrenia to address this issue. METHODS: We performed a comparison of cortical networks extracted from functional MRI data of patients with schizophrenia and healthy subjects considering their topological and dynamical properties. RESULTS: Among 54 network measures tested, only four contributed substantially to a discrimination between the classes of healthy and schizophrenic subjects, with a sensitivity of 90% and specificity of 74%. However, such classes of networks did not differ significantly with respect to the level of network resilience and synchronization. CONCLUSIONS: Schizophrenic subjects have cortical regions with higher variance of network centrality, but less modular structure. SIGNIFICANCE: Our findings suggest that it is possible to establish data analysis routines that allow automatic diagnosis of a multifaceted disease like child-onset schizophrenia based on fMRI data of individual subjects and extracted network properties.

Role of centrality for the identification of influential spreaders in complex networks.

The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumorlike dynamics. Recent works have suggested that the identification of influential spreaders is not independent of the dynamics being studied. For instance, the key disease spreaders might not necessarily be so important when it comes to analyzing social contagion or rumor propagation. Additionally, it has been shown that different metrics (degree, coreness, etc.) might identify different influential nodes even for the same dynamical processes with diverse degrees of accuracy. In this paper, we investigate how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes in different synthetic and real-world (both spatial and nonspatial) networks. We also propose a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations. Our results show that for nonspatial networks, the k-core and degree centralities are the most correlated to epidemic spreading, whereas the average neighborhood degree, the closeness centrality, and accessibility are the most related to rumor dynamics. On the contrary, for spatial networks, the accessibility measure outperforms the rest of the centrality metrics in almost all cases regardless of the kind of dynamics considered. Therefore, an important consequence of our analysis is that previous studies performed in synthetic random networks cannot be generalized to the case of spatial networks.