Synchronization reveals topological scales in complex networks

Multifunctional reservoir computing

Whereas the power of reservoir computing (RC) in inferring chaotic systems has been well established in the literature, the studies are mostly restricted to monofunctional machines where the training and testing data are acquired from the same attractor. Here, using the strategies of attractor labeling and trajectory separation, we propose a scheme of RC capable of learning multiple attractors generated by entirely different dynamics, namely multifunctional RC. Specifically, we demonstrate that by incorporating a label channel into the standard reservoir computer, a single machine is able to learn from data the dynamics of multiple chaotic attractors, while each attractor can be accurately retrieved by inputting just a scalar in the prediction phase. The dependence of the machine performance on the labeling and separation parameters is investigated, and it is found that the machine performance is optimized when the parameters take intermediate values. The working mechanism of multifunctional RC is analyzed by the method of functional networks in neuroscience, and it is revealed that each attractor is represented by a stable, unique functional network in the reservoir, and the optimal performance arises as a balance between the stability, complexity, and distinguishability of the functional networks.

Coarse-graining network flow through statistical physics and machine learning

Information dynamics plays a crucial role in complex systems, from cells to societies. Recent advances in statistical physics have made it possible to capture key network properties, such as flow diversity and signal speed, using entropy and free energy. However, large system sizes pose computational challenges. We use graph neural networks to identify suitable groups of components for coarse-graining a network and achieve a low computational complexity, suitable for practical application. Our approach preserves information flow even under significant compression, as shown through theoretical analysis and experiments on synthetic and empirical networks. We find that the model merges nodes with similar structural properties, suggesting they perform redundant roles in information transmission. This method enables low-complexity compression for extremely large networks, offering a multiscale perspective that preserves information flow in biological, social, and technological networks better than existing methods mostly focused on network structure.

Networks with Many Structural Scales: A Renormalization Group Perspective

Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a constant entropy-loss rate across scales in a renormalization-group coarse-graining setting. This framework enables us to differentiate between scale-free and scale-invariant networks, revealing distinct characteristics within each class. Furthermore, we offer a comprehensive inventory of genuinely scale-invariant networks, both natural and artificially constructed, demonstrating, e.g., that the human connectome exhibits notable features of scale invariance. Our findings open new avenues for exploring the scale-invariant structural properties crucial in biological and sociotechnological systems.

Spectral principle for frequency synchronization in repulsive laser networks and beyond

Network synchronization of lasers is critical for achieving high-power outputs and enabling effective optical computing. However, the role of network topology in frequency synchronization of optical oscillators and lasers remains not well understood. Here, we report our significant progress toward solving this critical problem for networks of heterogeneous laser model oscillators with repulsive coupling. We discover a general approximate principle for predicting the onset of frequency synchronization from the spectral knowledge of a complex matrix representing a combination of the signless Laplacian induced by repulsive coupling and a matrix associated with intrinsic frequency detuning. We show that the gap between the two smallest eigenvalues of the complex matrix generally controls the coupling threshold for frequency synchronization. In stark contrast with attractive networks, we demonstrate that local rings and all-to-all networks prevent frequency synchronization, whereas full bipartite networks have optimal synchronization properties. Beyond laser models, we show that, with a few exceptions, the spectral principle can be applied to repulsive Kuramoto networks. Our results provide guidelines for optimal designs of scalable optical oscillator networks capable of achieving reliable frequency synchronization.

Synchronization of E. coli Bacteria Moving in Coupled Microwells

Synchronization plays a crucial role in the dynamics of living organisms. Uncovering the mechanism behind it requires an understanding of individual biological oscillators and the coupling forces between them. Here, a single-cell assay is developed that studies rhythmic behavior in the motility of E. coli cells that can be mutually synchronized. Circular microcavities are used to isolate E. coli cells that swim along the cavity wall, resulting in self-sustained oscillations. Connecting these cavities by microchannels yields synchronization patterns with phase slips. It is demonstrated that the coordinated movement observed in coupled E. coli oscillators follows mathematical rules of synchronization which is used to quantify the coupling strength. These findings advance the understanding of motility in confinement, and open up new opportunities for engineering networks of coupled oscillators in microbial active matter.

Spectral energy transfer on complex networks: a filtering approach

The spectral analysis of dynamical systems is a staple technique for analyzing a vast range of systems. But beyond its analytical utility, it is also the primary lens through which many physical phenomena are defined and interpreted. The turbulent energy cascade in fluid mechanics, a dynamical consequence of the three-dimensional Navier-Stokes equations in which energy "cascades" from large injection scales to smaller dissipation scales, is a well-known example that is precisely defined only in reciprocal space. Related techniques in the context of networked dynamical systems have been employed with great success in deriving reduced order models. But what such techniques gain in analytical tractability, they often lose in interpretability and locality, as the lower degree of freedom system frequently contains information from all nodes of the network. Here, we demonstrate that a network of nonlinear oscillators exhibits spectral energy transfer facilitated by an effective force akin to the Reynolds stress in turbulence, an example of an emergent higher order interaction. Then, introducing a filter-based decomposition motivated by large eddy simulation, we show that such higher order interactions can be localized to individual nodes and study the effects of local topology on such interactions.

Emergence of metastability in frustrated oscillatory networks: the key role of hierarchical modularity

Oscillatory complex networks in the metastable regime have been used to study the emergence of integrated and segregated activity in the brain, which are hypothesised to be fundamental for cognition. Yet, the parameters and the underlying mechanisms necessary to achieve the metastable regime are hard to identify, often relying on maximising the correlation with empirical functional connectivity dynamics. Here, we propose and show that the brain's hierarchically modular mesoscale structure alone can give rise to robust metastable dynamics and (metastable) chimera states in the presence of phase frustration. We construct unweighted 3-layer hierarchical networks of identical Kuramoto-Sakaguchi oscillators, parameterized by the average degree of the network and a structural parameter determining the ratio of connections between and within blocks in the upper two layers. Together, these parameters affect the characteristic timescales of the system. Away from the critical synchronization point, we detect the emergence of metastable states in the lowest hierarchical layer coexisting with chimera and metastable states in the upper layers. Using the Laplacian renormalization group flow approach, we uncover two distinct pathways towards achieving the metastable regimes detected in these distinct layers. In the upper layers, we show how the symmetry-breaking states depend on the slow eigenmodes of the system. In the lowest layer instead, metastable dynamics can be achieved as the separation of timescales between layers reaches a critical threshold. Our results show an explicit relationship between metastability, chimera states, and the eigenmodes of the system, bridging the gap between harmonic based studies of empirical data and oscillatory models.

Unraveling the mesoscale organization induced by network-driven processes

Complex systems are characterized by emergent patterns created by the nontrivial interplay between dynamical processes and the networks of interactions on which these processes unfold. Topological or dynamical descriptors alone are not enough to fully embrace this interplay in all its complexity, and many times one has to resort to dynamics-specific approaches that limit a comprehension of general principles. To address this challenge, we employ a metric-that we name Jacobian distance-which captures the spatiotemporal spreading of perturbations, enabling us to uncover the latent geometry inherent in network-driven processes. We compute the Jacobian distance for a broad set of nonlinear dynamical models on synthetic and real-world networks of high interest for applications from biological to ecological and social contexts. We show, analytically and computationally, that the process-driven latent geometry of a complex network is sensitive to both the specific features of the dynamics and the topological properties of the network. This translates into potential mismatches between the functional and the topological mesoscale organization, which we explain by means of the spectrum of the Jacobian matrix. Finally, we demonstrate that the Jacobian distance offers a clear advantage with respect to traditional methods when studying human brain networks. In particular, we show that it outperforms classical network communication models in explaining functional communities from structural data, therefore highlighting its potential in linking structure and function in the brain.

An integrative dynamical perspective for graph theory and the analysis of complex networks

Built upon the shoulders of graph theory, the field of complex networks has become a central tool for studying real systems across various fields of research. Represented as graphs, different systems can be studied using the same analysis methods, which allows for their comparison. Here, we challenge the widespread idea that graph theory is a universal analysis tool, uniformly applicable to any kind of network data. Instead, we show that many classical graph metrics-including degree, clustering coefficient, and geodesic distance-arise from a common hidden propagation model: the discrete cascade. From this perspective, graph metrics are no longer regarded as combinatorial measures of the graph but as spatiotemporal properties of the network dynamics unfolded at different temporal scales. Once graph theory is seen as a model-based (and not a purely data-driven) analysis tool, we can freely or intentionally replace the discrete cascade by other canonical propagation models and define new network metrics. This opens the opportunity to design-explicitly and transparently-dedicated analyses for different types of real networks by choosing a propagation model that matches their individual constraints. In this way, we take stand that network topology cannot always be abstracted independently from network dynamics but shall be jointly studied, which is key for the interpretability of the analyses. The model-based perspective here proposed serves to integrate into a common context both the classical graph analysis and the more recent network metrics defined in the literature which were, directly or indirectly, inspired by propagation phenomena on networks.

Framework to generate hypergraphs with community structure

In recent years hypergraphs have emerged as a powerful tool to study systems with multibody interactions which cannot be trivially reduced to pairs. While highly structured methods to generate synthetic data have proved fundamental for the standardized evaluation of algorithms and the statistical study of real-world networked data, these are scarcely available in the context of hypergraphs. Here we propose a flexible and efficient framework for the generation of hypergraphs with many nodes and large hyperedges, which allows specifying general community structures and tune different local statistics. We illustrate how to use our model to sample synthetic data with desired features (assortative or disassortative communities, mixed or hard community assignments, etc.), analyze community detection algorithms, and generate hypergraphs structurally similar to real-world data. Overcoming previous limitations on the generation of synthetic hypergraphs, our work constitutes a substantial advancement in the statistical modeling of higher-order systems.

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

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

Exact solutions for signal propagation along an excitable transmission line

A simple transmission line composed of pulse-coupled units is presented. The model captures the basic properties of excitable media with, in particular, the robust transmission of information via traveling wave solutions. For rectified linear units with a cut-off threshold, the model is exactly solvable and analytical results on propagation are presented. The ability to convey a nontrivial message is studied in detail.

Exploring nonlinear dynamics and network structures in Kuramoto systems using machine learning approaches

Recent advances in machine learning (ML) have facilitated its application to a wide range of systems, from complex to quantum. Reservoir computing algorithms have proven particularly effective for studying nonlinear dynamical systems that exhibit collective behaviors, such as synchronizations and chaotic phenomena, some of which still remain unclear. Here, we apply ML approaches to the Kuramoto model to address several intriguing problems, including identifying the transition point and criticality of a hybrid synchronization transition, predicting future chaotic behaviors, and understanding network structures from chaotic patterns. Our proposed method also has further implications, such as inferring the structure of neural networks from electroencephalogram signals. This study, finally, highlights the potential of ML approaches for advancing our understanding of complex systems.

Sensitive dynamics of brain cognitive networks and its resource constraints

It is well known that brain functions are closely related to the synchronization of brain networks, but the underlying mechanisms are still not completely understood. To study this problem, we here focus on the synchronization of cognitive networks, in contrast to that of a global brain network, as individual brain functions are in fact performed by different cognitive networks but not the global network. In detail, we consider four different levels of brain networks and two approaches, i.e., either with or without resource constraints. For the case of without resource constraints, we find that global brain networks have fundamentally different behaviors from that of the cognitive networks; i.e., the former has a continuous synchronization transition, while the latter shows a novel transition of oscillatory synchronization. This feature of oscillation comes from the sparse links among the communities of cognitive networks, resulting in coupling sensitive dynamics of brain cognitive networks. While for the case of resource constraints, we find that at the global level, the synchronization transition becomes explosive, in contrast to the continuous synchronization for the case of without resource constraints. At the level of cognitive networks, the transition also becomes explosive and the coupling sensitivity is significantly reduced, thus guaranteeing the robustness and fast switch of brain functions. Moreover, a brief theoretical analysis is provided.

Laplacian Spectra of Persistent Structures in Taiwan, Singapore, and US Stock Markets

An important challenge in the study of complex systems is to identify appropriate effective variables at different times. In this paper, we explain why structures that are persistent with respect to changes in length and time scales are proper effective variables, and illustrate how persistent structures can be identified from the spectra and Fiedler vector of the graph Laplacian at different stages of the topological data analysis (TDA) filtration process for twelve toy models. We then investigated four market crashes, three of which were related to the COVID-19 pandemic. In all four crashes, a persistent gap opens up in the Laplacian spectra when we go from a normal phase to a crash phase. In the crash phase, the persistent structure associated with the gap remains distinguishable up to a characteristic length scale ϵ* where the first non-zero Laplacian eigenvalue changes most rapidly. Before ϵ*, the distribution of components in the Fiedler vector is predominantly bi-modal, and this distribution becomes uni-modal after ϵ*. Our findings hint at the possibility of understanding market crashs in terms of both continuous and discontinuous changes. Beyond the graph Laplacian, we can also employ Hodge Laplacians of higher order for future research.

Eigenvector localization in hypergraphs: Pairwise versus higher-order links

Localization behaviors of Laplacian eigenvectors of complex networks furnish an explanation to various dynamical phenomena of the corresponding complex systems. We numerically examine roles of higher-order and pairwise links in driving eigenvector localization of hypergraphs Laplacians. We find that pairwise interactions can engender localization of eigenvectors corresponding to small eigenvalues for some cases, whereas higher-order interactions, even being much much less than the pairwise links, keep steering localization of the eigenvectors corresponding to larger eigenvalues for all the cases considered here. These results will be advantageous to comprehend dynamical phenomena, such as diffusion, and random walks on a range of real-world complex systems having higher-order interactions in better manner.

How to grow an oscillators' network with enhanced synchronization

We study a way to set the natural frequency of a newly added oscillator in a growing network to enhance synchronization. Population growth is one of the typical features of many oscillator systems for which synchronization is required to perform their functions properly. Despite this significance, little has been known about synchronization in growing systems. We suggest effective growing schemes to enhance synchronization as the network grows under a predetermined rule. Specifically, we find that a method based on a link-wise order parameter outperforms that based on the conventional global order parameter. With simple solvable examples, we verify that the results coincide with intuitive expectations. The numerical results demonstrate that the approximate optimal values from the suggested method show a larger synchronization enhancement in comparison with other naïve strategies. The results also show that our proposed approach outperforms others over a wide range of coupling strengths.

Impulsive strategies in nonlinear dynamical systems: A brief overview

The studies of impulsive dynamical systems have been thoroughly explored, and extensive publications have been made available. This study is mainly in the framework of continuous-time systems and aims to give an exhaustive review of several main kinds of impulsive strategies with different structures. Particularly, (i) two kinds of impulse-delay structures are discussed respectively according to the different parts where the time delay exists, and some potential effects of time delay in stability analysis are emphasized. (ii) The event-based impulsive control strategies are systematically introduced in the light of several novel event-triggered mechanisms determining the impulsive time sequences. (iii) The hybrid effects of impulses are emphatically stressed for nonlinear dynamical systems, and the constraint relationships between different impulses are revealed. (iv) The recent applications of impulses in the synchronization problem of dynamical networks are investigated. Based on the above several points, we make a detailed introduction for impulsive dynamical systems, and some significant stability results have been presented. Finally, several challenges are suggested for future works.

Three-State Opinion Model on Complex Topologies

We investigate opinion diffusion on complex networks and the interplay between the existence of neutral opinion states and non-trivial network structures. For this purpose, we apply a three-state opinion model based on magnetic-like interactions to modular complex networks, both synthetic and real networks extracted from Twitter. The model allows for tuning the contribution of neutral agents using a neutrality parameter. We also consider social agitation, encoded as a temperature, that accounts for random opinion changes that are beyond the agent neighborhood opinion state. Using this model, we study which topological features influence the formation of consensus, bipartidism, or fragmentation of opinions in three parties, and how the neutrality parameter and the temperature interplay with the network structure.

Topological Properties, Spectra Analysis, and Consensus Problems for a Class of Network Models Based on m-Fission Operation

The network model, especially the network model constructed by network operation, is an important tool to study complex networks. Many topological and dynamic properties of complex networks can be studied in this way. In this article, the m -fission operation is constructed based on the phenomenon of node splitting in the network, which is quite common in complex networks. Many network models, including dual Sierpinski gaskets, are built based on this operation, but it has never been systematically studied. Then, the topological and dynamic properties of the m -fission operation and the corresponding iterative fission network model are studied, and the influence of the operation on the network structure is revealed. Among them, the topological properties of the network include diameter, degree distribution, clustering coefficient, average distance, and modularity. By studying these properties, it can be concluded that the iterative fission network is a fractal homogeneous network with high clustering and high community characteristics. Since the dynamic properties are closely related to the spectrum of the Laplacian matrix corresponding to the network, the iterative relation of the spectrum in operation is studied, and the complete solution of the spectrum of the iterative fission network is obtained. Based on the above results, we calculate the analytical expressions of the characteristic quantities related to the dynamic properties on the network, including the Kirchhoff index and the average of hitting times. Finally, due to the close connection between the network model and the system, we further analyzed the consensus problems on the system corresponding to the network, including convergence rate, delay robustness, first-order noise coherence, and second-order noise coherence.

Ranking influential nodes in complex networks with community structure

Quantifying a node’s importance is decisive for developing efficient strategies to curb or accelerate any spreading phenomena. Centrality measures are well-known methods used to quantify the influence of nodes by extracting information from the network’s structure. The pitfall of these measures is to pinpoint nodes located in the vicinity of each other, saturating their shared zone of influence. In this paper, we propose a ranking strategy exploiting the ubiquity of the community structure in real-world networks. The proposed community-aware ranking strategy naturally selects a set of distant spreaders with the most significant influence in the networks. One can use it with any centrality measure. We investigate its effectiveness using real-world and synthetic networks with controlled parameters in a Susceptible-Infected-Recovered (SIR) diffusion model scenario. Experimental results indicate the superiority of the proposed ranking strategy over all its counterparts agnostic about the community structure. Additionally, results show that it performs better in networks with a strong community structure and a high number of communities of heterogeneous sizes.

Functional control of oscillator networks

Oscillatory activity is ubiquitous in natural and engineered network systems. The interaction scheme underlying interdependent oscillatory components governs the emergence of network-wide patterns of synchrony that regulate and enable complex functions. Yet, understanding, and ultimately harnessing, the structure-function relationship in oscillator networks remains an outstanding challenge of modern science. Here, we address this challenge by presenting a principled method to prescribe exact and robust functional configurations from local network interactions through optimal tuning of the oscillators’ parameters. To quantify the behavioral synchrony between coupled oscillators, we introduce the notion of functional pattern, which encodes the pairwise relationships between the oscillators’ phases. Our procedure is computationally efficient and provably correct, accounts for constrained interaction types, and allows to concurrently assign multiple desired functional patterns. Further, we derive algebraic and graph-theoretic conditions to guarantee the feasibility and stability of target functional patterns. These conditions provide an interpretable mapping between the structural constraints and their functional implications in oscillator networks. As a proof of concept, we apply the proposed method to replicate empirically recorded functional relationships from cortical oscillations in a human brain, and to redistribute the active power flow in different models of electrical grids.

In network systems governed by oscillatory activity, such as brain networks or power grids, configurations of synchrony may define network functions. The authors introduce a control approach for the formation of desired synchrony patterns through optimal interventions on the network parameters.

Maximizing synchronizability of networks with community structure based on node similarity

In reality, numerous networks have a community structure characterized by dense intra-community connections and sparse inter-community connections. In this article, strategies are proposed to enhance synchronizability of such networks by rewiring a certain number of inter-community links, where the research scope is complete synchronization on undirected and diffusively coupled dynamic networks. First, we explore the effect of adding links between unconnected nodes with different similarity levels on network synchronizability and find that preferentially adding links between nodes with lower similarity can improve network synchronizability more than that with higher similarity, where node similarity is measured by our improved Asymmetric Katz (AKatz) and Asymmetric Leicht-Holme-Newman (ALHNII) methods from the perspective of link prediction. Additional simulations demonstrate that the node similarity-based link-addition strategy is more effective in enhancing network synchronizability than the node centrality-based methods. Furthermore, we apply the node similarity-based link-addition or deletion strategy as the valid criteria to the rewiring process of inter-community links and then propose a Node Similarity-Based Rewiring Optimization (NSBRO) algorithm, where the optimization process is realized by a modified simulated annealing technique. Simulations show that our proposed method performs better in optimizing synchronization of such networks compared with other centrality-based heuristic methods. Finally, simulations on the Rössler system indicate that the network structure optimized by the NSBRO algorithm also leads to better synchronizability of coupled oscillators.

Optimizing synchrony with a minimal coupling strength of coupled phase oscillators on complex networks based on desynchronous clustering

Finding the globally optimal network is an unsolved problem in synchrony optimization. In this paper, an efficient edge-adding optimization method based on global information is proposed. The edge-adding scheme is obtained through the eigenvector corresponding to the maximum eigenvalue of the system's Jacobian matrix. With different frequency distributions, we find that the optimized networks have similar features, concluded as three conditions: (i) The deviations of nodes' frequencies from the mean value are linear with the nodes' degrees, (ii) the oscillators form a bipartite network divided according to the frequencies of the oscillators, and (iii) oscillators are only connected to those with sufficiently large frequency differences. An optimal network can be constructed directly based on these three conditions for a given distribution of natural frequencies. We show that the critical coupling strengths of these constructed networks approach the theoretical lower bound. The constructed networks are or at least close to the globally optimal ones for synchrony.

Functional Implications of Dale's Law in Balanced Neuronal Network Dynamics and Decision Making

The notion that a neuron transmits the same set of neurotransmitters at all of its post-synaptic connections, typically known as Dale's law, is well supported throughout the majority of the brain and is assumed in almost all theoretical studies investigating the mechanisms for computation in neuronal networks. Dale's law has numerous functional implications in fundamental sensory processing and decision-making tasks, and it plays a key role in the current understanding of the structure-function relationship in the brain. However, since exceptions to Dale's law have been discovered for certain neurons and because other biological systems with complex network structure incorporate individual units that send both positive and negative feedback signals, we investigate the functional implications of network model dynamics that violate Dale's law by allowing each neuron to send out both excitatory and inhibitory signals to its neighbors. We show how balanced network dynamics, in which large excitatory and inhibitory inputs are dynamically adjusted such that input fluctuations produce irregular firing events, are theoretically preserved for a single population of neurons violating Dale's law. We further leverage this single-population network model in the context of two competing pools of neurons to demonstrate that effective decision-making dynamics are also produced, agreeing with experimental observations from honeybee dynamics in selecting a food source and artificial neural networks trained in optimal selection. Through direct comparison with the classical two-population balanced neuronal network, we argue that the one-population network demonstrates more robust balanced activity for systems with less computational units, such as honeybee colonies, whereas the two-population network exhibits a more rapid response to temporal variations in network inputs, as required by the brain. We expect this study will shed light on the role of neurons violating Dale's law found in experiment as well as shared design principles across biological systems that perform complex computations.

The transition to synchronization on branching hierarchical lattices

We study the transition to synchronization on hierarchical lattices using the evolution of Chaté-Manneville maps placed on a triangular lattice. Connections are generated between the levels of the triangular lattice, assuming that each site is connected to its neighbors on the level below with probability half. The maps are diffusively coupled, and the map parameters increase hierarchically, depending on the map parameters at the sites they are coupled to in the previous level. The system shows a transition to synchronization, which is second order in nature, with associated critical exponents. However, the V-lattice, which is a special realization of this lattice, shows a transition to synchronization that is discontinuous with accompanying hysteretic behavior. This transition can thus be said to belong to the class of explosive synchronization with the explosive nature depending on the nature of the substrate. We carry out finite-size-finite-time scaling for the continuous transition and analyze the scaling of the jump size for the discontinuous case. We discuss the implications of our results and draw parallels with avalanche statistics on branching hierarchical lattices.

Detection of functional communities in networks of randomly coupled oscillators using the dynamic-mode decomposition

Dynamic-mode decomposition (DMD) is a versatile framework for model-free analysis of time series that are generated by dynamical systems. We develop a DMD-based algorithm to investigate the formation of functional communities in networks of coupled, heterogeneous Kuramoto oscillators. In these functional communities, the oscillators in a network have similar dynamics. We consider two common random-graph models (Watts-Strogatz networks and Barabási-Albert networks) with different amounts of heterogeneities among the oscillators. In our computations, we find that membership in a functional community reflects the extent to which there is establishment and sustainment of locking between oscillators. We construct forest graphs that illustrate the complex ways in which the heterogeneous oscillators associate and disassociate with each other.

Modular origins of high-amplitude cofluctuations in fine-scale functional connectivity dynamics

The topology of structural brain networks shapes brain dynamics, including the correlation structure of brain activity (functional connectivity) as estimated from functional neuroimaging data. Empirical studies have shown that functional connectivity fluctuates over time, exhibiting patterns that vary in the spatial arrangement of correlations among segregated functional systems. Recently, an exact decomposition of functional connectivity into frame-wise contributions has revealed fine-scale dynamics that are punctuated by brief and intermittent episodes (events) of high-amplitude cofluctuations involving large sets of brain regions. Their origin is currently unclear. Here, we demonstrate that similar episodes readily appear in silico using computational simulations of whole-brain dynamics. As in empirical data, simulated events contribute disproportionately to long-time functional connectivity, involve recurrence of patterned cofluctuations, and can be clustered into distinct families. Importantly, comparison of event-related patterns of cofluctuations to underlying patterns of structural connectivity reveals that modular organization present in the coupling matrix shapes patterns of event-related cofluctuations. Our work suggests that brief, intermittent events in functional dynamics are partly shaped by modular organization of structural connectivity.

Modularity in Biological Networks

Network modeling, from the ecological to the molecular scale has become an essential tool for studying the structure, dynamics and complex behavior of living systems. Graph representations of the relationships between biological components open up a wide variety of methods for discovering the mechanistic and functional properties of biological systems. Many biological networks are organized into a modular structure, so methods to discover such modules are essential if we are to understand the biological system as a whole. However, most of the methods used in biology to this end, have a limited applicability, as they are very specific to the system they were developed for. Conversely, from the statistical physics and network science perspective, graph modularity has been theoretically studied and several methods of a very general nature have been developed. It is our perspective that in particular for the modularity detection problem, biology and theoretical physics/network science are less connected than they should. The central goal of this review is to provide the necessary background and present the most applicable and pertinent methods for community detection in a way that motivates their further usage in biological research.

Two classes of functional connectivity in dynamical processes in networks

The relationship between network structure and dynamics is one of the most extensively investigated problems in the theory of complex systems of recent years. Understanding this relationship is of relevance to a range of disciplines-from neuroscience to geomorphology. A major strategy of investigating this relationship is the quantitative comparison of a representation of network architecture (structural connectivity, SC) with a (network) representation of the dynamics (functional connectivity, FC). Here, we show that one can distinguish two classes of functional connectivity-one based on simultaneous activity (co-activity) of nodes, the other based on sequential activity of nodes. We delineate these two classes in different categories of dynamical processes-excitations, regular and chaotic oscillators-and provide examples for SC/FC correlations of both classes in each of these models. We expand the theoretical view of the SC/FC relationships, with conceptual instances of the SC and the two classes of FC for various application scenarios in geomorphology, ecology, systems biology, neuroscience and socio-ecological systems. Seeing the organisation of dynamical processes in a network either as governed by co-activity or by sequential activity allows us to bring some order in the myriad of observations relating structure and function of complex networks.

Synchronization of coupled Kuramoto oscillators under resource constraints

A fundamental understanding of synchronized behavior in multiagent systems can be acquired by studying analytically tractable Kuramoto models. However, such models typically diverge from many real systems whose dynamics evolve under nonnegligible resource constraints. Here we construct a system of coupled Kuramoto oscillators that consume or produce resources as a function of their oscillation frequency. At high coupling, we observe strongly synchronized dynamics, whereas at low coupling, we observe independent oscillator dynamics as expected from standard Kuramoto models. For intermediate coupling, which typically induces a partially synchronized state, we empirically observe that (and theoretically explain why) the system can exist in either: (i) a state in which the order parameter oscillates in time, or (ii) a state in which multiple synchronization states are simultaneously stable. Whether (i) or (ii) occurs depends upon whether the oscillators consume or produce resources, respectively. Relevant for systems as varied as coupled neurons and social groups, our paper lays important groundwork for future efforts to develop quantitative predictions of synchronized dynamics for systems embedded in environments marked by sparse resources.

Constructing graphs from genetic encodings

Our understanding of real-world connected systems has benefited from studying their evolution, from random wirings and rewirings to growth-dependent topologies. Long overlooked in this search has been the role of the innate: networks that connect based on identity-dependent compatibility rules. Inspired by the genetic principles that guide brain connectivity, we derive a network encoding process that can utilize wiring rules to reproducibly generate specific topologies. To illustrate the representational power of this approach, we propose stochastic and deterministic processes for generating a wide range of network topologies. Specifically, we detail network heuristics that generate structured graphs, such as feed-forward and hierarchical networks. In addition, we characterize a Random Genetic (RG) family of networks, which, like Erdős-Rényi graphs, display critical phase transitions, however their modular underpinnings lead to markedly different behaviors under targeted attacks. The proposed framework provides a relevant null-model for social and biological systems, where diverse metrics of identity underpin a node's preferred connectivity.

Spike signal transmission between modules and the predictability of spike activity in modular neuronal networks

Modularity is a common feature of the nervous system across species and scales. Although it has been qualitatively investigated in network science, very little is known about how it affects spike signal transmission in neuronal networks at the mesoscopic level. Here, a neuronal network model is built to simulate dynamic interactions among different modules of neuronal networks. This neuronal network model follows the organizational principle of modular structure. The neurons can generate spikes like biological neurons, and changes in the strength of synaptic connections conform to the STDP learning rule. Based on this neuronal network model, we first quantitatively studied whether and to what extent the connectivity within and between modules can affect spike signal transmission, and found that spike signal transmission heavily depends on the connectivity between modules, but has little to do with the connectivity within modules. More importantly, we further found that the spike activity of a module can be predicted according to the spike activities of its adjacent modules through building a resting-state functional connectivity matrix.

Clustering for epidemics on networks: A geometric approach

Infectious diseases typically spread over a contact network with millions of individuals, whose sheer size is a tremendous challenge to analyzing and controlling an epidemic outbreak. For some contact networks, it is possible to group individuals into clusters. A high-level description of the epidemic between a few clusters is considerably simpler than on an individual level. However, to cluster individuals, most studies rely on equitable partitions, a rather restrictive structural property of the contact network. In this work, we focus on Susceptible-Infected-Susceptible (SIS) epidemics, and our contribution is threefold. First, we propose a geometric approach to specify all networks for which an epidemic outbreak simplifies to the interaction of only a few clusters. Second, for the complete graph and any initial viral state vectors, we derive the closed-form solution of the nonlinear differential equations of the N-intertwined mean-field approximation of the SIS process. Third, by relaxing the notion of equitable partitions, we derive low-complexity approximations and bounds for epidemics on arbitrary contact networks. Our results are an important step toward understanding and controlling epidemics on large networks.

Geometric unfolding of synchronization dynamics on networks

We study the synchronized state in a population of network-coupled, heterogeneous oscillators. In particular, we show that the steady-state solution of the linearized dynamics may be written as a geometric series whose subsequent terms represent different spatial scales of the network. Specifically, each additional term incorporates contributions from wider network neighborhoods. We prove that this geometric expansion converges for arbitrary frequency distributions and for both undirected and directed networks provided that the adjacency matrix is primitive. We also show that the error in the truncated series grows geometrically with the second largest eigenvalue of the normalized adjacency matrix, analogously to the rate of convergence to the stationary distribution of a random walk. Last, we derive a local approximation for the synchronized state by truncating the spatial series, at the first neighborhood term, to illustrate the practical advantages of our approach.

Frequency-Resolved Functional Connectivity: Role of Delay and the Strength of Connections

The brain functional network extracted from the BOLD signals reveals the correlated activity of the different brain regions, which is hypothesized to underlie the integration of the information across functionally specialized areas. Functional networks are not static and change over time and in different brain states, enabling the nervous system to engage and disengage different local areas in specific tasks on demand. Due to the low temporal resolution, however, BOLD signals do not allow the exploration of spectral properties of the brain dynamics over different frequency bands which are known to be important in cognitive processes. Recent studies using imaging tools with a high temporal resolution has made it possible to explore the correlation between the regions at multiple frequency bands. These studies introduce the frequency as a new dimension over which the functional networks change, enabling brain networks to transmit multiplex of information at any time. In this computational study, we explore the functional connectivity at different frequency ranges and highlight the role of the distance between the nodes in their correlation. We run the generalized Kuramoto model with delayed interactions on top of the brain's connectome and show that how the transmission delay and the strength of the connections, affect the correlation between the pair of nodes over different frequency bands.

Evaluating the phase dynamics of coupled oscillators via time-variant topological features

By characterizing the phase dynamics in coupled oscillators, we gain insights into the fundamental phenomena of complex systems. The collective dynamics in oscillatory systems are often described by order parameters, which are insufficient for identifying more specific behaviors. To improve this situation, we propose a topological approach that constructs the quantitative features describing the phase evolution of oscillators. Here, the phase data are mapped into a high-dimensional space at each time, and the topological features describing the shape of the data are subsequently extracted from the mapped points. These features are extended to time-variant topological features by adding the evolution time as an extra dimension in the topological feature space. The time-variant features provide crucial insights into the evolution of phase dynamics. Combining these features with the kernel method, we characterize the multiclustered synchronized dynamics during the early evolution stages. Finally, we demonstrate that our method can qualitatively explain chimera states. The experimental results confirmed the superiority of our method over those based on order parameters, especially when the available data are limited to the early-stage dynamics.

Dynamics of hierarchical weighted networks of van der Pol oscillators

We investigate the dynamics of regular fractal-like networks of hierarchically coupled van der Pol oscillators. The hierarchy is imposed in terms of the coupling strengths or link weights. We study the low frequency modes, as well as frequency and phase synchronization, in the network by a process of repeated coarse-graining of oscillator units. At any given stage of this process, we sum over the signals from the oscillator units of a clique to obtain a new oscillating unit. The frequencies and the phases for the coarse-grained oscillators are found to progressively synchronize with the number of coarse-graining steps. Furthermore, the characteristic frequency is found to decrease and finally stabilize to a value that can be tuned via the parameters of the system. We compare our numerical results with those of an approximate analytic solution and find good qualitative agreement. Our study on this idealized model shows how oscillations with a precise frequency can be obtained in systems with heterogeneous couplings. It also demonstrates the effect of imposing a hierarchy in terms of link weights instead of one that is solely topological, where the connectivity between oscillators would be the determining factor, as is usually the case.

Synchrony and Complexity in State-Related EEG Networks: An Application of Spectral Graph Theory

The brain may be considered as a synchronized dynamic network with several coherent dynamical units. However, concerns remain whether synchronizability is a stable state in the brain networks. If so, which index can best reveal the synchronizability in brain networks? To answer these questions, we tested the application of the spectral graph theory and the Shannon entropy as alternative approaches in neuroimaging. We specifically tested the alpha rhythm in the resting-state eye closed (rsEC) and the resting-state eye open (rsEO) conditions, a well-studied classical example of synchrony in neuroimaging EEG. Since the synchronizability of alpha rhythm is more stable during the rsEC than the rsEO, we hypothesized that our suggested spectral graph theory indices (as reliable measures to interpret the synchronizability of brain signals) should exhibit higher values in the rsEC than the rsEO condition. We performed two separate analyses of two different datasets (as elementary and confirmatory studies). Based on the results of both studies and in agreement with our hypothesis, the spectral graph indices revealed higher stability of synchronizability in the rsEC condition. The k-mean analysis indicated that the spectral graph indices can distinguish the rsEC and rsEO conditions by considering the synchronizability of brain networks. We also computed correlations among the spectral indices, the Shannon entropy, and the topological indices of brain networks, as well as random networks. Correlation analysis indicated that although the spectral and the topological properties of random networks are completely independent, these features are significantly correlated with each other in brain networks. Furthermore, we found that complexity in the investigated brain networks is inversely related to the stability of synchronizability. In conclusion, we revealed that the spectral graph theory approach can be reliably applied to study the stability of synchronizability of state-related brain networks.

Epidemic spreading and control strategies in spatial modular network

Epidemic spread on networks is one of the most studied dynamics in network science and has important implications in real epidemic scenarios. Nonetheless, the dynamics of real epidemics and how it is affected by the underline structure of the infection channels are still not fully understood. Here we apply the susceptible-infected-recovered model and study analytically and numerically the epidemic spread on a recently developed spatial modular model imitating the structure of cities in a country. The model assumes that inside a city the infection channels connect many different locations, while the infection channels between cities are less and usually directly connect only a few nearest neighbor cities in a two-dimensional plane. We find that the model experience two epidemic transitions. The first lower threshold represents a local epidemic spread within a city but not to the entire country and the second higher threshold represents a global epidemic in the entire country. Based on our analytical solution we proposed several control strategies and how to optimize them. We also show that while control strategies can successfully control the disease, early actions are essentials to prevent the disease global spread.

Link prediction in real-world multiplex networks via layer reconstruction method

Networks are invaluable tools to study real biological, social and technological complex systems in which connected elements form a purposeful phenomenon. A higher resolution image of these systems shows that the connection types do not confine to one but to a variety of types. Multiplex networks encode this complexity with a set of nodes which are connected in different layers via different types of links. A large body of research on link prediction problem is devoted to finding missing links in single-layer (simplex) networks. In recent years, the problem of link prediction in multiplex networks has gained the attention of researchers from different scientific communities. Although most of these studies suggest that prediction performance can be enhanced by using the information contained in different layers of the network, the exact source of this enhancement remains obscure. Here, it is shown that similarity w.r.t. structural features (eigenvectors) is a major source of enhancements for link prediction task in multiplex networks using the proposed layer reconstruction method and experiments on real-world multiplex networks from different disciplines. Moreover, we characterize how low values of similarity w.r.t. structural features result in cases where improving prediction performance is substantially hard.

Coupled dynamics on hypergraphs: Master stability of steady states and synchronization

In the study of dynamical systems on networks or graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that, instead of microscopic details of the individual nodes or vertices, rather make the influence of the network coupling topology visible. The master stability function is an important such tool to achieve this goal. Here, we generalize the master stability approach to hypergraphs. A hypergraph coupling structure is important as it allows us to take into account arbitrary higher-order interactions between nodes. As, for instance, in the theory of coupled map lattices, we study Laplace-type interaction structures in detail. Since the spectral theory of Laplacians on hypergraphs is richer than on graphs, we see the possibility of different dynamical phenomena. More generally, our arguments provide a blueprint for how to generalize dynamical structures and results from graphs to hypergraphs.

Abstract representations of events arise from mental errors in learning and memory

Humans are adept at uncovering abstract associations in the world around them, yet the underlying mechanisms remain poorly understood. Intuitively, learning the higher-order structure of statistical relationships should involve complex mental processes. Here we propose an alternative perspective: that higher-order associations instead arise from natural errors in learning and memory. Using the free energy principle, which bridges information theory and Bayesian inference, we derive a maximum entropy model of people's internal representations of the transitions between stimuli. Importantly, our model (i) affords a concise analytic form, (ii) qualitatively explains the effects of transition network structure on human expectations, and (iii) quantitatively predicts human reaction times in probabilistic sequential motor tasks. Together, these results suggest that mental errors influence our abstract representations of the world in significant and predictable ways, with direct implications for the study and design of optimally learnable information sources.

Reorderability of node-filtered order complexes

Growing graphs describe a multitude of developing processes from maturing brains to expanding vocabularies to burgeoning public transit systems. Each of these growing processes likely adheres to proliferation rules that establish an effective order of node and connection emergence. When followed, such proliferation rules allow the system to properly develop along a predetermined trajectory. But rules are rarely followed. Here we ask what topological changes in the growing graph trajectories might occur after the specific but basic perturbation of permuting the node emergence order. Specifically, we harness applied topological methods to determine which of six growing graph models exhibit topology that is robust to randomizing node order, termed global reorderability, and robust to temporally local node swaps, termed local reorderability. We find that the six graph models fall upon a spectrum of both local and global reorderability, and furthermore we provide theoretical connections between robustness to node pair ordering and robustness to arbitrary node orderings. Finally, we discuss real-world applications of reorderability analyses and suggest possibilities for designing reorderable networks.

Significance-based multi-scale method for network community detection and its application in disease-gene prediction

Community detection in complex networks is an important issue in network science. Several statistical measures have been proposed and widely applied to detecting the communities in various complex networks. However, due to the lack of flexibility resolution, some of them have to encounter the resolution limit and thus are not compatible with multi-scale structures of complex networks. In this paper, we investigated a statistical measure of interest for community detection, Significance [Sci. Rep. 3 (2013) 2930], and analyzed its critical behaviors based on the theoretical derivation of critical number of communities and the phase diagram in community-partition transition. It was revealed that Significance exhibits far higher resolution than the traditional Modularity when the intra- and inter-link densities of communities are obviously different. Following the critical analysis, we developed a multi-resolution version of Significance for identifying communities in the multi-scale networks. Experimental tests in several typical networks have been performed and confirmed that the generalized Significance can be competent for the multi-scale communities detection. Moreover, it can effectively relax the first- and second-type resolution limits. Finally, we displayed an important potential application of the multi-scale Significance in computational biology: disease-gene identification, showing that extracting information from the perspective of multi-scale module mining is helpful for disease gene prediction.

Characterizing and Comparing Phylogenetic Trait Data from Their Normalized Laplacian Spectrum

The dissection of the mode and tempo of phenotypic evolution is integral to our understanding of global biodiversity. Our ability to infer patterns of phenotypes across phylogenetic clades is essential to how we infer the macroevolutionary processes governing those patterns. Many methods are already available for fitting models of phenotypic evolution to data. However, there is currently no comprehensive nonparametric framework for characterizing and comparing patterns of phenotypic evolution. Here, we build on a recently introduced approach for using the phylogenetic spectral density profile (SDP) to compare and characterize patterns of phylogenetic diversification, in order to provide a framework for nonparametric analysis of phylogenetic trait data. We show how to construct the SDP of trait data on a phylogenetic tree from the normalized graph Laplacian. We demonstrate on simulated data the utility of the SDP to successfully cluster phylogenetic trait data into meaningful groups and to characterize the phenotypic patterning within those groups. We furthermore demonstrate how the SDP is a powerful tool for visualizing phenotypic space across traits and for assessing whether distinct trait evolution models are distinguishable on a given empirical phylogeny. We illustrate the approach in two empirical data sets: a comprehensive data set of traits involved in song, plumage, and resource-use in tanagers, and a high-dimensional data set of endocranial landmarks in New World monkeys. Considering the proliferation of morphometric and molecular data collected across the tree of life, we expect this approach will benefit big data analyses requiring a comprehensive and intuitive framework.

Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization

Complex networks are essentially heterogeneous not only in the basic properties of the constituent nodes, such as their degree, but also in the effects that these have on the global dynamical properties of the network. Networks of coupled identical phase oscillators are good examples for analyzing these effects, since an overall synchronized state can be considered a reference state. A small variation of intrinsic node parameters may cause the system to move away from synchronization, and a new phase-locked stationary state can be achieved. We propose a measure of phase dispersion that quantifies the functional response of the system to a given local perturbation. As a particular implementation, we propose a variation of the standard Kuramoto model in which the nodes of a complex network interact with their neighboring nodes, by including a node-dependent frustration parameter. The final stationary phase-locked state now depends on the particular frustration parameter at each node and also on the network topology. We exploit this scenario by introducing individual frustration parameters and measuring what their effect on the whole network is, measured in terms of the phase dispersion, which depends only on the topology of the network and on the choice of the particular node that is perturbed. This enables us to define a characteristic of the node, its functionability, that can be computed analytically in terms of the network topology. Finally, we provide a thorough comparison with other centrality measures.