Synchronization reveals topological scales in complex networks

Three-state opinion dynamics in modular networks

In this work we study the opinion evolution in a community-based population with intergroup interactions. We address two issues. First, we consider that such intergroup interactions can be negative with some probability p. We develop a coupled mean-field approximation that still preserves the community structure and it is able to capture the richness of the results arising from our Monte Carlo simulations: continuous and discontinuous order-disorder transitions as well as nonmonotonic ordering for an intermediate community strength. In the second part, we consider only positive interactions but with the presence of inflexible agents holding a minority opinion. We also consider an indecision noise: a probability q that allows the spontaneous change of opinions to the neutral state. Our results show that the modular structure leads to a nonmonotonic global ordering as q increases. This inclination toward neutrality plays a dual role: A moderated propensity to neutrality helps the initial minority to become a majority, but this noise-driven opinion switching becomes less pronounced if the agents are too susceptible to become neutral.

Scale-variant topological information for characterizing the structure of complex networks

The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing a general framework using a method based on topological data analysis. By considering the diffusion process at a single specified timescale in a network, we map the network nodes to a finite set of points that contains the topological information of the network at a single scale. Subsequently, we study the shape of these point sets over variable timescales that provide scale-variant topological information, to understand the varying topological scales and the complex interactions in the network. We conduct experiments on synthetic and real-world data to demonstrate the effectiveness of the proposed framework in identifying network models, classifying real-world networks, and detecting transition points in time-evolving networks. Overall, our study presents a unified analysis that can be applied to more complex network structures, as in the case of multilayer and multiplex networks.

Reconstructing dynamical networks via feature ranking

Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the structure of networks from time-resolved observations of their node-dynamics. The methods based on physical insights often rely on strong assumptions about the properties and dynamics of the scrutinized network. Here, we use the insights from machine learning to design a new method of network reconstruction that essentially makes no such assumptions. Specifically, we interpret the available trajectories (data) as "features" and use two independent feature ranking approaches-Random Forest and RReliefF-to rank the importance of each node for predicting the value of each other node, which yields the reconstructed adjacency matrix. We show that our method is fairly robust to coupling strength, system size, trajectory length, and noise. We also find that the reconstruction quality strongly depends on the dynamical regime.

Abnormal synchronization of functional and structural networks in schizophrenia

Synchronization is believed to play an important role in information processing of the brain. Mounting evidence supports the hypothesis that schizophrenia is related to impaired neural synchrony. However, most previous studies characterize brain synchronization from the perspective of temporal coordination of distributed neural activity, rather than network properties. Our aim was to investigate the network synchronization alterations in schizophrenia using publically available data. Resting-state functional magnetic resonance imaging (fMRI) and diffusion tensor imaging (DTI) were performed in 96 schizophrenia patients and 120 healthy controls. The whole-brain functional and structural networks were constructed and analyzed using graph theoretical approaches. Inter-group differences in network synchronization were investigated. Both the binary and weighted functional networks of schizophrenia patients exhibited decreased synchronizability (increased eigenratio) than those of healthy controls. With respect to the structural binary networks, schizophrenia patients showed a trend towards excessive synchronizability (decreased eigenratio). In addition, the excessive synchronizability of the structural binary networks was associated with more severe negative symptoms in schizophrenia patients. Our findings provide novel biological evidence that schizophrenia involves a disruption of neural synchrony from the perspective of network properties.

Competitive networks using chaotic circuits with hierarchical structure

Coupled oscillatory systems are good models that are able to describe a variety of higher dimensional nonlinear phenomena. Coupled chaotic circuits produce many kinds of interesting synchronization phenomena. In recent years, research studies on complex networks related to the synchronization of coupled oscillators have attracted much attention. In the real world, there are a variety of different network structures. We focus on the competitive interaction network that includes conflict between two networks. Here, we propose a new paradigm for this competitive interaction network using coupled chaotic circuits.

Network analysis of whole-brain fMRI dynamics: A new framework based on dynamic communicability

Neuroimaging techniques such as MRI have been widely used to explore the associations between brain areas. Structural connectivity (SC) captures the anatomical pathways across the brain and functional connectivity (FC) measures the correlation between the activity of brain regions. These connectivity measures have been much studied using network theory in order to uncover the distributed organization of brain structures, in particular FC for task-specific brain communication. However, the application of network theory to study FC matrices is often "static" despite the dynamic nature of time series obtained from fMRI. The present study aims to overcome this limitation by introducing a network-oriented analysis applied to whole-brain effective connectivity (EC) useful to interpret the brain dynamics. Technically, we tune a multivariate Ornstein-Uhlenbeck (MOU) process to reproduce the statistics of the whole-brain resting-state fMRI signals, which provides estimates for MOU-EC as well as input properties (similar to local excitabilities). The network analysis is then based on the Green function (or network impulse response) that describes the interactions between nodes across time for the estimated dynamics. This model-based approach provides time-dependent graph-like descriptor, named communicability, that characterize the roles that either nodes or connections play in the propagation of activity within the network. They can be used at both global and local levels, and also enables the comparison of estimates from real data with surrogates (e.g. random network or ring lattice). In contrast to classical graph approaches to study SC or FC, our framework stresses the importance of taking the temporal aspect of fMRI signals into account. Our results show a merging of functional communities over time, moving from segregated to global integration of the network activity. Our formalism sets a solid ground for the analysis and interpretation of fMRI data, including task-evoked activity.

Label propagation method based on bi-objective optimization for ambiguous community detection in large networks

Community detection is of great significance because it serves as a basis for network research and has been widely applied in real-world scenarios. It has been proven that label propagation is a successful strategy for community detection in large-scale networks and local clustering coefficient can measure the degree to which the local nodes tend to cluster together. In this paper, we try to optimize two objects about the local clustering coefficient to detect community structure. To avoid the trend that merges too many nodes into a large community, we add some constraints on the objectives. Through the experiments and comparison, we select a suitable strength for one constraint. Last, we merge two objectives with linear weighting into a hybrid objective and use the hybrid objective to guide the label update in our proposed label propagation algorithm. We perform amounts of experiments on both artificial and real-world networks. Experimental results demonstrate the superiority of our algorithm in both modularity and speed, especially when the community structure is ambiguous.

Multi-scale detection of hierarchical community architecture in structural and functional brain networks

Community detection algorithms have been widely used to study the organization of complex networks like the brain. These techniques provide a partition of brain regions (or nodes) into clusters (or communities), where nodes within a community are densely interconnected with one another. In their simplest application, community detection algorithms are agnostic to the presence of community hierarchies: clusters embedded within clusters of other clusters. To address this limitation, we exercise a multi-scale extension of a common community detection technique, and we apply the tool to synthetic graphs and to graphs derived from human neuroimaging data, including structural and functional imaging data. Our multi-scale community detection algorithm links a graph to copies of itself across neighboring topological scales, thereby becoming sensitive to conserved community organization across levels of the hierarchy. We demonstrate that this method is sensitive to topological inhomogeneities of the graph's hierarchy by providing a local measure of community stability and inter-scale reliability across topological scales. We compare the brain's structural and functional network architectures, and we demonstrate that structural graphs display a more prominent hierarchical community organization than functional graphs. Finally, we build an explicitly multimodal multiplex graph that combines both structural and functional connectivity in a single model, and we identify the topological scales where resting state functional connectivity and underlying structural connectivity show similar versus unique hierarchical community architecture. Together, our results demonstrate the advantages of the multi-scale community detection algorithm in studying hierarchical community structure in brain graphs, and they illustrate its utility in modeling multimodal neuroimaging data.

Topological reinforcement as a principle of modularity emergence in brain networks

Modularity is a ubiquitous topological feature of structural brain networks at various scales. Although a variety of potential mechanisms have been proposed, the fundamental principles by which modularity emerges in neural networks remain elusive. We tackle this question with a plasticity model of neural networks derived from a purely topological perspective. Our topological reinforcement model acts enhancing the topological overlap between nodes, that is, iteratively allowing connections between non-neighbor nodes with high neighborhood similarity. This rule reliably evolves synthetic random networks toward a modular architecture. Such final modular structure reflects initial "proto-modules," thus allowing to predict the modules of the evolved graph. Subsequently, we show that this topological selection principle might be biologically implemented as a Hebbian rule. Concretely, we explore a simple model of excitable dynamics, where the plasticity rule acts based on the functional connectivity (co-activations) between nodes. Results produced by the activity-based model are consistent with the ones from the purely topological rule in terms of the final network configuration and modules composition. Our findings suggest that the selective reinforcement of topological overlap may be a fundamental mechanism contributing to modularity emergence in brain networks.

Explosive synchronization in frequency displaced multiplex networks

Motivated by the recent multiplex framework of complex networks, in this work, we investigate if explosive synchronization can be induced in the multiplex network of two layers. Using nonidentical Kuramoto oscillators, we show that a sufficient frequency mismatch between two layers of a multiplex network can lead to explosive inter- and intralayer synchronization due to mutual frustration in the completion of the synchronization processes of the layers, generating a hybrid transition without imposing any specific structure-dynamics correlation.

Controlling and enhancing synchronization through adaptive phase lags

We compare two methods for controlling synchronization in the Kuramoto model on an undirected network. The first is by driving selected oscillators at a desired frequency by coupling to an external driver, and the second is by including adaptive lags-or dynamical frustrations-within the Kuramoto interactions, with the lags evolving according to a dynamics as a function of the reference frequency with an associated time constant. Performing numerical simulations with random regular graphs, we find that above a certain connectivity driving via adaptive lags allows for stronger alignment to the external frequency at a lower value of the time constant compared to the corresponding coupling strength for the externally driven model. Numerical results are supported by equilibrium analysis based on a fixed-point ansatz for frequency synchronized clusters where we solve the spectrum of the associated Jacobian matrix. We find that at low connectivity the external driving mechanism is successful down to lower densities of controlled oscillators where the adaptive lag approach is Lyapunov unstable at all densities. As connectivity increases, however, the adaptive lag mechanism shows stability over similar ranges of density to the external driving and proves superior in terms of tighter splays of oscillators. In particular, the threshold for instability for the adaptive lag model shows robustness against variations in the associated time constant down to lower densities of controlled oscillators. A simple intuitive model emerges based on the interaction between splayed clusters close to a critical point.

Comparing forest governance models against invasive biological threats

In order to take account of the negative effects of invasive species and pathogens on networked forest areas, we study the dynamics of stochastic closed-loop input-output systems faced with the risk of external random perturbations. The extension of previous works on robustness is carried out by introducing a negative feedback mechanism, such that the output from an element contained in the system behaves as a negative input toward elements to which it is connected. Through the study of an overall network divided into compartments barely connected to one another, we first consider the pathway pertaining to monofunctional zoning. By looking at a single aggregated structure, we then move our focus to the pathway proper to multifunctionality. Our results show that, at significant time scales, the monofunctional-zoning mode of forest governance, generally applied in Australasia, performs robustly against invasive biological threats at all levels of outbreak probability. The multifunctional mode of forest governance, further practiced in Western Europe, is mainly sturdy when the probability of invasion verges into certainty. Should this not be the case, robustness is ensured would disturbers and perturbations be uncorrelated. Accordingly, the monofunctional pathway can afford adopting control strategies for outbreak avoidance, which is only acceptable in case the expected invasion can be halted. For the sake of maintaining low likelihood of invasion, the multifunctional pathway is compelled to applying preventive strategies.

Detecting sequences of system states in temporal networks

Many time-evolving systems in nature, society and technology leave traces of the interactions within them. These interactions form temporal networks that reflect the states of the systems. In this work, we pursue a coarse-grained description of these systems by proposing a method to assign discrete states to the systems and inferring the sequence of such states from the data. Such states could, for example, correspond to a mental state (as inferred from neuroimaging data) or the operational state of an organization (as inferred by interpersonal communication). Our method combines a graph distance measure and hierarchical clustering. Using several empirical data sets of social temporal networks, we show that our method is capable of inferring the system's states such as distinct activities in a school and a weekday state as opposed to a weekend state. We expect the methods to be equally useful in other settings such as temporally varying protein interactions, ecological interspecific interactions, functional connectivity in the brain and adaptive social networks.

Dynamical complexity as a proxy for the network degree distribution

We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the nodes is found to be a function of their topological roles, with nodes of higher degree displaying lower levels of complexity. We provide several examples of theoretical models of chaotic oscillators, pulse-coupled neurons, and experimental networks of nonlinear electronic circuits evidencing such a hierarchical behavior. Importantly, our results imply that it is possible to infer the degree distribution of a network only from individual dynamical measurements.

Kuramoto dilemma alleviated by optimizing connectivity and rationality

Recently, Antonioni and Cardillo proposed a coevolutionary model based on the intertwining of oscillator synchronization and evolutionary game theory [Phys. Rev. Lett. 118, 238301 (2017)PRLTAO0031-900710.1103/PhysRevLett.118.238301], in which each Kuramoto oscillator can decide whether to interact or not with its neighbors, and all oscillators can receive some benefits from the local synchronization, but those who choose to interact must pay a cost. Oscillators are allowed to update their strategies according to payoff difference, wherein the strategy of an oscillator who has obtained higher payoff is more likely to be followed. Utilizing this coevolutionary model, we find that the global synchronization level reaches the highest level when the average degree of the underlying interaction network is moderate. We also study how synchronization is affected by the individual rationality in choosing strategy.

Critical analysis of (Quasi-)Surprise for community detection in complex networks

Module or community structures widely exist in complex networks, and optimizing statistical measures is one of the most popular approaches for revealing and identifying such structures in real-world applications. In this paper, we focus on critical behaviors of (Quasi-)Surprise, a type of statistical measure of interest for community structure, accompanied by a series of comparisons with other measures. Specially, the effect of various network parameters on the measures is thoroughly investigated. The critical number of dense subgraphs in partition transition is derived, and a kind of phase diagrams is provided to display and compare the phase transitions of the measures. The effect of “potential well” for (Quasi-)Surprise is revealed, which may be difficult to get across by general greedy (agglomerative or divisive) algorithms. Finally, an extension of Quasi-Surprise is introduced for the study of multi-scale structures. Experimental results are of help for understanding the critical behaviors of (Quasi-)Surprise, and may provide useful insight for the design of effective tools for community detection.

Core community structure recovery and phase transition detection in temporally evolving networks

Community detection in time series networks represents a timely and significant research topic due to its applications in a broad range of scientific fields, including biology, social sciences and engineering. In this work, we introduce methodology to address this problem, based on a decomposition of the network adjacency matrices into low-rank components that capture the community structure and sparse & dense noise perturbation components. It is further assumed that the low-rank structure exhibits sharp changes (phase transitions) at certain epochs that our methodology successfully detects and identifies. The latter is achieved by averaging the low-rank component over time windows, which in turn enables us to precisely select the correct rank and monitor its evolution over time and thus identify the phase transition epochs. The methodology is illustrated on both synthetic networks generated by various network formation models, as well as the Kuramoto model of coupled oscillators and on real data reflecting the US Senate's voting record from 1979-2014. In the latter application, we identify that party polarization exhibited a sharp change and increased after 1993, a finding broadly concordant with the political science literature on the subject.

The Odyssey's mythological network

In this work, we study the mythological network of Odyssey of Homer. We use ordinary statistical quantifiers in order to classify the network as real or fictional. We also introduce an analysis of communities which allows us to see how network properties shall emerge. We found that Odyssey can be classified both as real and fictional network. This statement is supported as far as mythological characters are removed, which results in a network with real properties. The community analysis indicated to us that there is a power-law relationship based on the max degree of each community. These results allow us to conclude that Odyssey might be an amalgam of myth and of historical facts, with communities playing a central role.

Scale invariance in natural and artificial collective systems: a review

Self-organized collective coordinated behaviour is an impressive phenomenon, observed in a variety of natural and artificial systems, in which coherent global structures or dynamics emerge from local interactions between individual parts. If the degree of collective integration of a system does not depend on size, its level of robustness and adaptivity is typically increased and we refer to it as scale-invariant. In this review, we first identify three main types of self-organized scale-invariant systems: scale-invariant spatial structures, scale-invariant topologies and scale-invariant dynamics. We then provide examples of scale invariance from different domains in science, describe their origins and main features and discuss potential challenges and approaches for designing and engineering artificial systems with scale-invariant properties.

Relay synchronization in multiplex networks

Relay (or remote) synchronization between two not directly connected oscillators in a network is an important feature allowing distant coordination. In this work, we report a systematic study of this phenomenon in multiplex networks, where inter-layer synchronization occurs between distant layers mediated by a relay layer that acts as a transmitter. We show that this transmission can be extended to higher order relay configurations, provided symmetry conditions are preserved. By first order perturbative analysis, we identify the dynamical and topological dependencies of relay synchronization in a multiplex. We find that the relay synchronization threshold is considerably reduced in a multiplex configuration, and that such synchronous state is mostly supported by the lower degree nodes of the outer layers, while hubs can be de-multiplexed without affecting overall coherence. Finally, we experimentally validated the analytical and numerical findings by means of a multiplex of three layers of electronic circuits.

Synchronization invariance under network structural transformations

Synchronization processes are ubiquitous despite the many connectivity patterns that complex systems can show. Usually, the emergence of synchrony is a macroscopic observable; however, the microscopic details of the system, as, e.g., the underlying network of interactions, is many times partially or totally unknown. We already know that different interaction structures can give rise to a common functionality, understood as a common macroscopic observable. Building upon this fact, here we propose network transformations that keep the collective behavior of a large system of Kuramoto oscillators invariant. We derive a method based on information theory principles, that allows us to adjust the weights of the structural interactions to map random homogeneous in-degree networks into random heterogeneous networks and vice versa, keeping synchronization values invariant. The results of the proposed transformations reveal an interesting principle; heterogeneous networks can be mapped to homogeneous ones with local information, but the reverse process needs to exploit higher-order information. The formalism provides analytical insight to tackle real complex scenarios when dealing with uncertainty in the measurements of the underlying connectivity structure.

Predicting future learning from baseline network architecture

Human behavior and cognition result from a complex pattern of interactions between brain regions. The flexible reconfiguration of these patterns enables behavioral adaptation, such as the acquisition of a new motor skill. Yet, the degree to which these reconfigurations depend on the brain's baseline sensorimotor integration is far from understood. Here, we asked whether spontaneous fluctuations in sensorimotor networks at baseline were predictive of individual differences in future learning. We analyzed functional MRI data from 19 participants prior to six weeks of training on a new motor skill. We found that visual-motor connectivity was inversely related to learning rate: sensorimotor autonomy at baseline corresponded to faster learning in the future. Using three additional scans, we found that visual-motor connectivity at baseline is a relatively stable individual trait. These results suggest that individual differences in motor skill learning can be predicted from sensorimotor autonomy at baseline prior to task execution.

Framework based on communicability and flow to analyze complex network dynamics

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

Applications of community detection techniques to brain graphs: Algorithmic considerations and implications for neural function

The human brain can be represented as a graph in which neural units such as cells or small volumes of tissue are heterogeneously connected to one another through structural or functional links. Brain graphs are parsimonious representations of neural systems that have begun to offer fundamental insights into healthy human cognition, as well as its alteration in disease. A critical open question in network neuroscience lies in how neural units cluster into densely interconnected groups that can provide the coordinated activity that is characteristic of perception, action, and adaptive behaviors. Tools that have proven particularly useful for addressing this question are community detection approaches, which can identify communities or modules: groups of neural units that are densely interconnected with other units in their own group but sparsely interconnected with units in other groups. In this paper, we describe a common community detection algorithm known as modularity maximization, and we detail its applications to brain graphs constructed from neuroimaging data. We pay particular attention to important algorithmic considerations, especially in recent extensions of these techniques to graphs that evolve in time. After recounting a few fundamental insights that these techniques have provided into brain function, we highlight potential avenues of methodological advancements for future studies seeking to better characterize the patterns of coordinated activity in the brain that accompany human behavior. This tutorial provides a naive reader with an introduction to theoretical considerations pertinent to the generation of brain graphs, an understanding of modularity maximization for community detection, a resource of statistical measures that can be used to characterize community structure, and an appreciation of the usefulness of these approaches in uncovering behaviorally-relevant network dynamics in neuroimaging data.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

Effective Subnetwork Topology for Synchronizing Interconnected Networks of Coupled Phase Oscillators

A system consisting of interconnected networks, or a network of networks (NoN), appears diversely in many real-world systems, including the brain. In this study, we consider NoNs consisting of heterogeneous phase oscillators and investigate how the topology of subnetworks affects the global synchrony of the network. The degree of synchrony and the effect of subnetwork topology are evaluated based on the Kuramoto order parameter and the minimum coupling strength necessary for the order parameter to exceed a threshold value, respectively. In contrast to an isolated network in which random connectivity is favorable for achieving synchrony, NoNs synchronize with weaker interconnections when the degree distribution of subnetworks is heterogeneous, suggesting the major role of the high-degree nodes. We also investigate a case in which subnetworks with different average natural frequencies are coupled to show that direct coupling of subnetworks with the largest variation is effective for synchronizing the whole system. In real-world NoNs like the brain, the balance of synchrony and asynchrony is critical for its function at various spatial resolutions. Our work provides novel insights into the topological basis of coordinated dynamics in such networks.

Competitive influence maximization and enhancement of synchronization in populations of non-identical Kuramoto oscillators

Many networked systems have evolved to optimize performance of function. Much literature has considered optimization of networks by central planning, but investigations of network formation amongst agents connecting to achieve non-aligned goals are comparatively rare. Here we consider the dynamics of synchronization in populations of coupled non-identical oscillators and analyze adaptations in which individual nodes attempt to rewire network topology to optimize node-specific aims. We demonstrate that, even though individual nodes’ goals differ very widely, rewiring rules in which each node attempts to connect to the rest of the network in such a way as to maximize its influence on the system can enhance synchronization of the collective. The observed speed-up of consensus finding in this competitive dynamics might explain enhanced synchronization in real world systems and shed light on mechanisms for improved consensus finding in society.

Influence of topology in the mobility enhancement of pulse-coupled oscillator synchronization

In this work we revisit the nonmonotonic behavior (NMB) of synchronization time with velocity reported for systems of mobile pulse-coupled oscillators (PCOs). We devise a control parameter that allows us to predict in which range of velocities NMB may occur, also uncovering the conditions allowing us to establish the emergence of NMB based on specific features of the connectivity rule. Specifically, our results show that if the connectivity rule is such that the interaction patterns are sparse and, more importantly, include a large fraction of nonreciprocal interactions, then the system will display NMB. We furthermore provide a microscopic explanation relating the presence of such features of the connectivity patterns to the existence of local clusters unable to synchronize, termed frustrated clusters, for which we also give a precise definition in terms of simple graph concepts. We conclude that, if the probability of finding a frustrated cluster in a system of moving PCOs is high enough, NMB occurs in a predictable range of velocities.

Self-similarity in explosive synchronization of complex networks

We report that explosive synchronization of networked oscillators (a process through which the transition to coherence occurs without intermediate stages but is rather characterized by a sudden and abrupt jump from the network's asynchronous to synchronous motion) is related to self-similarity of synchronous clusters of different size. Self-similarity is revealed by destructing the network synchronous state during the backward transition and observed with the decrease of the coupling strength between the nodes of the network. As illustrative examples, networks of Kuramoto oscillators with different topologies of links have been considered. For each one of such topologies, the destruction of the synchronous state goes step by step with self-similar configurations of interacting oscillators. At the critical point, the invariance of the phase distribution in the synchronized cluster with respect to the cluster size is reported.

Relaxation time of the global order parameter on multiplex networks: The role of interlayer coupling in Kuramoto oscillators

This work considers the time scales associated with the global order parameter and the interlayer synchronization of coupled Kuramoto oscillators on multiplexes. For two-layer multiplexes with an initially high degree of synchronization in each layer, the difference between the average phases in each layer is analyzed from two different perspectives: the spectral analysis and the nonlinear Kuramoto model. Both viewpoints confirm that the prior time scales are inversely proportional to the interlayer coupling strength. Thus, increasing the interlayer coupling always shortens the transient regimes of both the global order parameter and the interlayer synchronization. Surprisingly, the analytical results show that the convergence of the global order parameter is faster than the interlayer synchronization, and the latter is generally faster than the global synchronization of the multiplex. The formalism also outlines the effects of frequencies on the difference between the average phases of each layer, and it identifies the conditions for an oscillatory behavior. Computer simulations are in fairly good agreement with the analytical findings, and they reveal that the time scale of the global order parameter is half the size of the time scale of the multiplex, if not smaller.

Diffusion dynamics and synchronizability of hierarchical products of networks

The hierarchical product of networks represents a natural tool for building large networks out of two smaller subnetworks: a primary subnetwork and a secondary subnetwork. Here we study the dynamics of diffusion and synchronization processes on hierarchical products. We apply techniques previously used for approximating the eigenvalues of the adjacency matrix to the Laplacian matrix, allowing us to quantify the effects that the primary and secondary subnetworks have on diffusion and synchronization in terms of a coupling parameter that weighs the secondary subnetwork relative to the primary subnetwork. Diffusion processes are separated into two regimes: for small coupling the diffusion rate is determined by the structure of the secondary network, scaling with the coupling parameter, while for large coupling it is determined by the primary network and saturates. Synchronization, on the other hand, is separated into three regimes, for both small and large coupling hierarchical products have poor synchronization properties, but is optimized at an intermediate value. Moreover, the critical coupling value that optimizes synchronization is shaped by the relative connectivities of the primary and secondary subnetworks, compensating for significant differences between the two subnetworks.

Hub-driven remote synchronization in brain networks

The phenomenon of “remote synchronization” (RS), first observed in a star network of oscillators, involves synchronization of unconnected peripheral nodes through a hub that maintains independent dynamics. In the RS regime the central hub was thought to serve as a passive gate for information transfer between nodes. Here, we investigate the physical origin of this phenomenon. Surprisingly, we find that a hub node can drive remote synchronization of peripheral oscillators even in the presence of a repulsive mean field, thus actively governing network dynamics while remaining asynchronous. We study this novel phenomenon in complex networks endowed with multiple hub-nodes, a ubiquitous feature of many real-world systems, including brain connectivity networks. We show that a change in the natural frequency of a single hub can alone reshape synchronization patterns across the entire network, and switch from direct to remote synchronization, or to hub-driven desynchronization. Hub-driven RS may provide a mechanism to account for the role of structural hubs in the organization of brain functional connectivity networks.

Development of structural correlations and synchronization from adaptive rewiring in networks of Kuramoto oscillators

Synchronization of non-identical oscillators coupled through complex networks is an important example of collective behavior, and it is interesting to ask how the structural organization of network interactions influences this process. Several studies have explored and uncovered optimal topologies for synchronization by making purposeful alterations to a network. On the other hand, the connectivity patterns of many natural systems are often not static, but are rather modulated over time according to their dynamics. However, this co-evolution and the extent to which the dynamics of the individual units can shape the organization of the network itself are less well understood. Here, we study initially randomly connected but locally adaptive networks of Kuramoto oscillators. In particular, the system employs a co-evolutionary rewiring strategy that depends only on the instantaneous, pairwise phase differences of neighboring oscillators, and that conserves the total number of edges, allowing the effects of local reorganization to be isolated. We find that a simple rule-which preserves connections between more out-of-phase oscillators while rewiring connections between more in-phase oscillators-can cause initially disordered networks to organize into more structured topologies that support enhanced synchronization dynamics. We examine how this process unfolds over time, finding a dependence on the intrinsic frequencies of the oscillators, the global coupling, and the network density, in terms of how the adaptive mechanism reorganizes the network and influences the dynamics. Importantly, for large enough coupling and after sufficient adaptation, the resulting networks exhibit interesting characteristics, including degree-frequency and frequency-neighbor frequency correlations. These properties have previously been associated with optimal synchronization or explosive transitions in which the networks were constructed using global information. On the contrary, by considering a time-dependent interplay between structure and dynamics, this work offers a mechanism through which emergent phenomena and organization can arise in complex systems utilizing local rules.

Relationship of Topology, Multiscale Phase Synchronization, and State Transitions in Human Brain Networks

How the brain reconstitutes consciousness and cognition after a major perturbation like general anesthesia is an important question with significant neuroscientific and clinical implications. Recent empirical studies in animals and humans suggest that the recovery of consciousness after anesthesia is not random but ordered. Emergence patterns have been classified as progressive and abrupt transitions from anesthesia to consciousness, with associated differences in duration and electroencephalogram (EEG) properties. We hypothesized that the progressive and abrupt emergence patterns from the unconscious state are associated with, respectively, continuous and discontinuous synchronization transitions in functional brain networks. The discontinuous transition is explainable with the concept of explosive synchronization, which has been studied almost exclusively in network science. We used the Kuramato model, a simple oscillatory network model, to simulate progressive and abrupt transitions in anatomical human brain networks acquired from diffusion tensor imaging (DTI) of 82 brain regions. To facilitate explosive synchronization, distinct frequencies for hub nodes with a large frequency disassortativity (i.e., higher frequency nodes linking with lower frequency nodes, or vice versa) were applied to the brain network. In this simulation study, we demonstrated that both progressive and abrupt transitions follow distinct synchronization processes at the individual node, cluster, and global network levels. The characteristic synchronization patterns of brain regions that are “progressive and earlier” or “abrupt but delayed” account for previously reported behavioral responses of gradual and abrupt emergence from the unconscious state. The characteristic network synchronization processes observed at different scales provide new insights into how regional brain functions are reconstituted during progressive and abrupt emergence from the unconscious state. This theoretical approach also offers a principled explanation of how the brain reconstitutes consciousness and cognitive functions after physiologic (sleep), pharmacologic (anesthesia), and pathologic (coma) perturbations.

Localization of Laplacian eigenvectors on random networks

In large random networks, each eigenvector of the Laplacian matrix tends to localize on a subset of network nodes having similar numbers of edges, namely, the components of each Laplacian eigenvector take relatively large values only on a particular subset of nodes whose degrees are close. Although this localization property has significant consequences for dynamical processes on random networks, a clear theoretical explanation has not yet been established. Here we analyze the origin of localization of Laplacian eigenvectors on random networks by using a perturbation theory. We clarify how heterogeneity in the node degrees leads to the eigenvector localization and that there exists a clear degree-eigenvalue correspondence, that is, the characteristic degrees of the localized nodes essentially determine the eigenvalues. We show that this theory can account for the localization properties of Laplacian eigenvectors on several classes of random networks, and argue that this localization should occur generally in networks with degree heterogeneity.

Diffusion Geometry Unravels the Emergence of Functional Clusters in Collective Phenomena

Collective phenomena emerge from the interaction of natural or artificial units with a complex organization. The interplay between structural patterns and dynamics might induce functional clusters that, in general, are different from topological ones. In biological systems, like the human brain, the overall functionality is often favored by the interplay between connectivity and synchronization dynamics, with functional clusters that do not coincide with anatomical modules in most cases. In social, sociotechnical, and engineering systems, the quest for consensus favors the emergence of clusters. Despite the unquestionable evidence for mesoscale organization of many complex systems and the heterogeneity of their interconnectivity, a way to predict and identify the emergence of functional modules in collective phenomena continues to elude us. Here, we propose an approach based on random walk dynamics to define the diffusion distance between any pair of units in a networked system. Such a metric allows us to exploit the underlying diffusion geometry to provide a unifying framework for the intimate relationship between metastable synchronization, consensus, and random search dynamics in complex networks, pinpointing the functional mesoscale organization of synthetic and biological systems.

How structure sculpts function: Unveiling the contribution of anatomical connectivity to the brain's spontaneous correlation structure

Intrinsic brain activity is characterized by highly organized co-activations between different regions, forming clustered spatial patterns referred to as resting-state networks. The observed co-activation patterns are sustained by the intricate fabric of millions of interconnected neurons constituting the brain's wiring diagram. However, as for other real networks, the relationship between the connectional structure and the emergent collective dynamics still evades complete understanding. Here, we show that it is possible to estimate the expected pair-wise correlations that a network tends to generate thanks to the underlying path structure. We start from the assumption that in order for two nodes to exhibit correlated activity, they must be exposed to similar input patterns from the entire network. We then acknowledge that information rarely spreads only along a unique route but rather travels along all possible paths. In real networks, the strength of local perturbations tends to decay as they propagate away from the sources, leading to a progressive attenuation of the original information content and, thus, of their influence. Accordingly, we define a novel graph measure, topological similarity, which quantifies the propensity of two nodes to dynamically correlate as a function of the resemblance of the overall influences they are expected to receive due to the underlying structure of the network. Applied to the human brain, we find that the similarity of whole-network inputs, estimated from the topology of the anatomical connectome, plays an important role in sculpting the backbone pattern of time-average correlations observed at rest.

Reconstructing the structure of directed and weighted networks of nonlinear oscillators

The formalism of complex networks is extensively employed to describe the dynamics of interacting agents in several applications. The features of the connections among the nodes in a network are not always provided beforehand, hence the problem of appropriately inferring them often arises. Here, we present a method to reconstruct directed and weighted topologies of networks of heterogeneous nonlinear oscillators. We illustrate the theory on a set of representative examples.

Persistent homology of time-dependent functional networks constructed from coupled time series

We use topological data analysis to study "functional networks" that we construct from time-series data from both experimental and synthetic sources. We use persistent homology with a weight rank clique filtration to gain insights into these functional networks, and we use persistence landscapes to interpret our results. Our first example uses time-series output from networks of coupled Kuramoto oscillators. Our second example consists of biological data in the form of functional magnetic resonance imaging data that were acquired from human subjects during a simple motor-learning task in which subjects were monitored for three days during a five-day period. With these examples, we demonstrate that (1) using persistent homology to study functional networks provides fascinating insights into their properties and (2) the position of the features in a filtration can sometimes play a more vital role than persistence in the interpretation of topological features, even though conventionally the latter is used to distinguish between signal and noise. We find that persistent homology can detect differences in synchronization patterns in our data sets over time, giving insight both on changes in community structure in the networks and on increased synchronization between brain regions that form loops in a functional network during motor learning. For the motor-learning data, persistence landscapes also reveal that on average the majority of changes in the network loops take place on the second of the three days of the learning process.

Collective Phenomena Emerging from the Interactions between Dynamical Processes in Multiplex Networks

We introduce a framework to intertwine dynamical processes of different nature, each with its own distinct network topology, using a multilayer network approach. As an example of collective phenomena emerging from the interactions of multiple dynamical processes, we study a model where neural dynamics and nutrient transport are bidirectionally coupled in such a way that the allocation of the transport process at one layer depends on the degree of synchronization at the other layer, and vice versa. We show numerically, and we prove analytically, that the multilayer coupling induces a spontaneous explosive synchronization and a heterogeneous distribution of allocations, otherwise not present in the two systems considered separately. Our framework can find application to other cases where two or more dynamical processes such as synchronization, opinion formation, information diffusion, or disease spreading, are interacting with each other.

Analysis of the communities of an urban mobile phone network

Being able to characterise the patterns of communications between individuals across different time scales is of great importance in understanding people's social interactions. Here, we present a detailed analysis of the community structure of the network of mobile phone calls in the metropolitan area of Milan revealing temporal patterns of communications between people. We show that circadian and weekly patterns can be found in the evolution of communities, presenting evidence that these cycles arise not only at the individual level but also at that of social groups. Our findings suggest that these trends are present across a range of time scales, from hours to days and weeks, and can be used to detect socially relevant events.

Synchronization of oscillators through time-shifted common inputs

Shared upstream dynamical processes are frequently the source of common inputs in various physical and biological systems. However, due to finite signal transmission speeds and differences in the distance to the source, time shifts between otherwise common inputs are unavoidable. Since common inputs can be a source of correlation between the elements of multi-unit dynamical systems, regardless of whether these elements are directly connected with one another or not, it is of importance to understand their impact on synchronization. As a canonical model that is representative for a variety of different dynamical systems, we study limit-cycle oscillators that are driven by stochastic time-shifted common inputs. We show that if the oscillators are coupled, time shifts in stochastic common inputs do not simply shift the distribution of the phase differences, but rather the distribution actually changes as a result. The best synchronization is therefore achieved at a precise intermediate value of the time shift, which is due to a resonance-like effect with the most probable phase difference that is determined by the deterministic dynamics.

The many facets of community detection in complex networks

Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of what constitutes a community has remained evasive, community detection algorithms have often been compared on benchmark graphs with a particular form of assortative community structure and classified based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different goals and reasons for why we want to employ community detection in the first place. Here we provide a focused review of these different motivations that underpin community detection. This problem-driven classification is useful in applied network science, where it is important to select an appropriate algorithm for the given purpose. Moreover, highlighting the different facets of community detection also delineates the many lines of research and points out open directions and avenues for future research.

Competition of simple and complex adoption on interdependent networks

We consider the competition of two mechanisms for adoption processes: a so-called complex threshold dynamics and a simple susceptible-infected-susceptible (SIS) model. Separately, these mechanisms lead, respectively, to first-order and continuous transitions between nonadoption and adoption phases. We consider two interconnected layers. While all nodes on the first layer follow the complex adoption process, all nodes on the second layer follow the simple adoption process. Coupling between the two adoption processes occurs as a result of the inclusion of some additional interconnections between layers. We find that the transition points and also the nature of the transitions are modified in the coupled dynamics. In the complex adoption layer, the critical threshold required for extension of adoption increases with interlayer connectivity whereas in the case of an isolated single network it would decrease with average connectivity. In addition, the transition can become continuous depending on the detailed interlayer and intralayer connectivities. In the SIS layer, any interlayer connectivity leads to the extension of the adopter phase. Besides, a new transition appears as a sudden drop of the fraction of adopters in the SIS layer. The main numerical findings are described by a mean-field type analytical approach appropriately developed for the threshold-SIS coupled system.