Synchronization reveals topological scales in complex networks

Functional complexity emerging from anatomical constraints in the brain: the significance of network modularity and rich-clubs

The large-scale structural ingredients of the brain and neural connectomes have been identified in recent years. These are, similar to the features found in many other real networks: the arrangement of brain regions into modules and the presence of highly connected regions (hubs) forming rich-clubs. Here, we examine how modules and hubs shape the collective dynamics on networks and we find that both ingredients lead to the emergence of complex dynamics. Comparing the connectomes of C. elegans, cats, macaques and humans to surrogate networks in which either modules or hubs are destroyed, we find that functional complexity always decreases in the perturbed networks. A comparison between simulated and empirically obtained resting-state functional connectivity indicates that the human brain, at rest, lies in a dynamical state that reflects the largest complexity its anatomical connectome can host. Last, we generalise the topology of neural connectomes into a new hierarchical network model that successfully combines modular organisation with rich-club forming hubs. This is achieved by centralising the cross-modular connections through a preferential attachment rule. Our network model hosts more complex dynamics than other hierarchical models widely used as benchmarks.

Algebraic Topology of Multi-Brain Connectivity Networks Reveals Dissimilarity in Functional Patterns during Spoken Communications

Human behaviour in various circumstances mirrors the corresponding brain connectivity patterns, which are suitably represented by functional brain networks. While the objective analysis of these networks by graph theory tools deepened our understanding of brain functions, the multi-brain structures and connections underlying human social behaviour remain largely unexplored. In this study, we analyse the aggregate graph that maps coordination of EEG signals previously recorded during spoken communications in two groups of six listeners and two speakers. Applying an innovative approach based on the algebraic topology of graphs, we analyse higher-order topological complexes consisting of mutually interwoven cliques of a high order to which the identified functional connections organise. Our results reveal that the topological quantifiers provide new suitable measures for differences in the brain activity patterns and inter-brain synchronisation between speakers and listeners. Moreover, the higher topological complexity correlates with the listener's concentration to the story, confirmed by self-rating, and closeness to the speaker's brain activity pattern, which is measured by network-to-network distance. The connectivity structures of the frontal and parietal lobe consistently constitute distinct clusters, which extend across the listener's group. Formally, the topology quantifiers of the multi-brain communities exceed the sum of those of the participating individuals and also reflect the listener's rated attributes of the speaker and the narrated subject. In the broader context, the presented study exposes the relevance of higher topological structures (besides standard graph measures) for characterising functional brain networks under different stimuli.

Spectral properties of the hierarchical product of graphs

The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum of the adjacency matrix of the hierarchical product of two graphs. Introducing a coupling parameter describing the relative contribution of each of the two smaller graphs, we perform an asymptotic analysis for the full spectrum of eigenvalues of the adjacency matrix of the hierarchical product. Specifically, we derive the exact limit points for each eigenvalue in the limits of small and large coupling, as well as the leading-order relaxation to these values in terms of the eigenvalues and eigenvectors of the two smaller graphs. Given its central roll in the structural and dynamical properties of networks, we study in detail the Perron-Frobenius, or largest, eigenvalue. Finally, as an example application we use our theory to predict the epidemic threshold of the susceptible-infected-susceptible model on a hierarchical product of two graphs.

Patterns of patterns of synchronization: Noise induced attractor switching in rings of coupled nonlinear oscillators

Following the long-lived qualitative-dynamics tradition of explaining behavior in complex systems via the architecture of their attractors and basins, we investigate the patterns of switching between distinct trajectories in a network of synchronized oscillators. Our system, consisting of nonlinear amplitude-phase oscillators arranged in a ring topology with reactive nearest-neighbor coupling, is simple and connects directly to experimental realizations. We seek to understand how the multiple stable synchronized states connect to each other in state space by applying Gaussian white noise to each of the oscillators' phases. To do this, we first analytically identify a set of locally stable limit cycles at any given coupling strength. For each of these attracting states, we analyze the effect of weak noise via the covariance matrix of deviations around those attractors. We then explore the noise-induced attractor switching behavior via numerical investigations. For a ring of three oscillators, we find that an attractor-switching event is always accompanied by the crossing of two adjacent oscillators' phases. For larger numbers of oscillators, we find that the distribution of times required to stochastically leave a given state falls off exponentially, and we build an attractor switching network out of the destination states as a coarse-grained description of the high-dimensional attractor-basin architecture.

Optimal synchronization of directed complex networks

We study optimal synchronization of networks of coupled phase oscillators. We extend previous theory for optimizing the synchronization properties of undirected networks to the important case of directed networks. We derive a generalized synchrony alignment function that encodes the interplay between the network structure and the oscillators' natural frequencies and serves as an objective measure for the network's degree of synchronization. Using the generalized synchrony alignment function, we show that a network's synchronization properties can be systematically optimized. This framework also allows us to study the properties of synchrony-optimized networks, and in particular, investigate the role of directed network properties such as nodal in- and out-degrees. For instance, we find that in optimally rewired networks, the heterogeneity of the in-degree distribution roughly matches the heterogeneity of the natural frequency distribution, but no such relationship emerges for out-degrees. We also observe that a network's synchronization properties are promoted by a strong correlation between the nodal in-degrees and the natural frequencies of oscillators, whereas the relationship between the nodal out-degrees and the natural frequencies has comparatively little effect. This result is supported by our theory, which indicates that synchronization is promoted by a strong alignment of the natural frequencies with the left singular vectors corresponding to the largest singular values of the Laplacian matrix.

Erosion of synchronization: Coupling heterogeneity and network structure

We study the dynamics of network-coupled phase oscillators in the presence of coupling frustration. It was recently demonstrated that in heterogeneous network topologies, the presence of coupling frustration causes perfect phase synchronization to become unattainable even in the limit of infinite coupling strength. Here, we consider the important case of heterogeneous coupling functions and extend previous results by deriving analytical predictions for the total erosion of synchronization. Our analytical results are given in terms of basic quantities related to the network structure and coupling frustration. In addition to fully heterogeneous coupling, where each individual interaction is allowed to be distinct, we also consider partially heterogeneous coupling and homogeneous coupling in which the coupling functions are either unique to each oscillator or identical for all network interactions, respectively. We demonstrate the validity of our theory with numerical simulations of multiple network models, and highlight the interesting effects that various coupling choices and network models have on the total erosion of synchronization. Finally, we consider some special network structures with well-known spectral properties, which allows us to derive further analytical results.

Synchronization unveils the organization of ecological networks with positive and negative interactions

Network science has helped to understand the organization principles of the interactions among the constituents of large complex systems. However, recently, the high resolution of the data sets collected has allowed to capture the different types of interactions coexisting within the same system. A particularly important example is that of systems with positive and negative interactions, a usual feature appearing in social, neural, and ecological systems. The interplay of links of opposite sign presents natural difficulties for generalizing typical concepts and tools applied to unsigned networks and, moreover, poses some questions intrinsic to the signed nature of the network, such as how are negative interactions balanced by positive ones so to allow the coexistence and survival of competitors/foes within the same system? Here, we show that synchronization phenomenon is an ideal benchmark for uncovering such balance and, as a byproduct, to assess which nodes play a critical role in the overall organization of the system. We illustrate our findings with the analysis of synthetic and real ecological networks in which facilitation and competitive interactions coexist.

Erosion of synchronization: Coupling heterogeneity and network structure

We study the dynamics of network-coupled phase oscillators in the presence of coupling frustration. It was recently demonstrated that in heterogeneous network topologies, the presence of coupling frustration causes perfect phase synchronization to become unattainable even in the limit of infinite coupling strength. Here, we consider the important case of heterogeneous coupling functions and extend previous results by deriving analytical predictions for the total erosion of synchronization. Our analytical results are given in terms of basic quantities related to the network structure and coupling frustration. In addition to fully heterogeneous coupling, where each individual interaction is allowed to be distinct, we also consider partially heterogeneous coupling and homogeneous coupling in which the coupling functions are either unique to each oscillator or identical for all network interactions, respectively. We demonstrate the validity of our theory with numerical simulations of multiple network models, and highlight the interesting effects that various coupling choices and network models have on the total erosion of synchronization. Finally, we consider some special network structures with well-known spectral properties, which allows us to derive further analytical results.

Amplitude dynamics favors synchronization in complex networks

In this paper we study phase synchronization in random complex networks of coupled periodic oscillators. In particular, we show that, when amplitude dynamics is not negligible, phase synchronization may be enhanced. To illustrate this, we compare the behavior of heterogeneous units with both amplitude and phase dynamics and pure (Kuramoto) phase oscillators. We find that in small network motifs the behavior crucially depends on the topology and on the node frequency distribution. Surprisingly, the microscopic structures for which the amplitude dynamics improves synchronization are those that are statistically more abundant in random complex networks. Thus, amplitude dynamics leads to a general lowering of the synchronization threshold in arbitrary random topologies. Finally, we show that this synchronization enhancement is generic of oscillators close to Hopf bifurcations. To this aim we consider coupled FitzHugh-Nagumo units modeling neuron dynamics.

Collective frequency variation in network synchronization and reverse PageRank

A wide range of natural and engineered phenomena rely on large networks of interacting units to reach a dynamical consensus state where the system collectively operates. Here we study the dynamics of self-organizing systems and show that for generic directed networks the collective frequency of the ensemble is not the same as the mean of the individuals' natural frequencies. Specifically, we show that the collective frequency equals a weighted average of the natural frequencies, where the weights are given by an outflow centrality measure that is equivalent to a reverse PageRank centrality. Our findings uncover an intricate dependence of the collective frequency on both the structural directedness and dynamical heterogeneity of the network, and also reveal an unexplored connection between synchronization and PageRank, which opens the possibility of applying PageRank optimization to synchronization. Finally, we demonstrate the presence of collective frequency variation in real-world networks by considering the UK and Scandinavian power grids.

Phase oscillators in modular networks: The effect of nonlocal coupling

We study the dynamics of nonlocally coupled phase oscillators in a modular network. The interactions include a phase lag, α. Depending on the various parameters the system exhibits a number of different dynamical states. In addition to global synchrony there can also be modular synchrony when each module can synchronize separately to a different frequency. There can also be multicluster frequency chimeras, namely coherent domains consisting of modules that are separately synchronized to different frequencies, coexisting with modules within which the dynamics is desynchronized. We apply the Ott-Antonsen ansatz in order to reduce the effective dimensionality and thereby carry out a detailed analysis of the different dynamical states.

Characterizing and Comparing Phylogenies from their Laplacian Spectrum

Phylogenetic trees are central to many areas of biology, ranging from population genetics and epidemiology to microbiology, ecology, and macroevolution. The ability to summarize properties of trees, compare different trees, and identify distinct modes of division within trees is essential to all these research areas. But despite wide-ranging applications, there currently exists no common, comprehensive framework for such analyses. Here we present a graph-theoretical approach that provides such a framework. We show how to construct the spectral density profile of a phylogenetic tree from its Laplacian graph. Using ultrametric simulated trees as well as non-ultrametric empirical trees, we demonstrate that the spectral density successfully identifies various properties of the trees and clusters them into meaningful groups. Finally, we illustrate how the eigengap can identify modes of division within a given tree. As phylogenetic data continue to accumulate and to be integrated into various areas of the life sciences, we expect that this spectral graph-theoretical framework to phylogenetics will have powerful and long-lasting applications.

Effective centrality and explosive synchronization in complex networks

Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. We here propose an effective network whose topological properties reflect the interplay between the topology and dynamics of the original network. On that basis, we are able to introduce the effective centrality, a measure that quantifies the role and importance of each network's node in the synchronization process. In particular, in the context of explosive synchronization, we use such a measure to assess the propensity of a graph to sustain an irreversible transition to synchronization. We furthermore discuss a strategy to induce the explosive behavior in a generic network, by acting only upon a fraction of its nodes.

Low-rank network decomposition reveals structural characteristics of small-world networks

Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.

Modularity and the spread of perturbations in complex dynamical systems

We propose a method to decompose dynamical systems based on the idea that modules constrain the spread of perturbations. We find partitions of system variables that maximize "perturbation modularity," defined as the autocovariance of coarse-grained perturbed trajectories. The measure effectively separates the fast intramodular from the slow intermodular dynamics of perturbation spreading (in this respect, it is a generalization of the "Markov stability" method of network community detection). Our approach captures variation of modular organization across different system states, time scales, and in response to different kinds of perturbations: aspects of modularity which are all relevant to real-world dynamical systems. It offers a principled alternative to detecting communities in networks of statistical dependencies between system variables (e.g., "relevance networks" or "functional networks"). Using coupled logistic maps, we demonstrate that the method uncovers hierarchical modular organization planted in a system's coupling matrix. Additionally, in homogeneously coupled map lattices, it identifies the presence of self-organized modularity that depends on the initial state, dynamical parameters, and type of perturbations. Our approach offers a powerful tool for exploring the modular organization of complex dynamical systems.

Synchronization and plateau splitting of coupled oscillators with long-range power-law interactions

We investigate synchronization and plateau splitting of coupled oscillators on a one-dimensional lattice with long-range interactions that decay over distance as a power law. We show that in the thermodynamic limit the dynamics of systems of coupled oscillators with power-law exponent α≤1 is identical to that of the all-to-all coupling case. For α>1, oscillatory behavior of the phase coherence appears as a result of single plateau splitting into multiple plateaus. A coarse-graining method is used to investigate the onset of plateau splitting. We analyze a simple oscillatory state formed by two plateaus in detail and propose a systematic approach to predict the onset of plateau splitting. The prediction of breaking points of plateau splitting is in quantitatively good agreement with numerical simulations.

Variety of regimes of starlike networks of Hénon maps

In this paper we categorize dynamical regimes demonstrated by starlike networks with chaotic nodes. This analysis is done in view of further studying of chaotic scale-free networks, since a starlike structure is the main motif of them. We analyze starlike networks of Hénon maps. They are found to demonstrate a huge diversity of regimes. Varying the coupling strength we reveal chaos, quasiperiodicity, and periodicity. The nodes can be both fully and phase synchronized. The hub node can be either synchronized with the subordinate nodes or oscillate separately from fully synchronized subordinates. There is a range of wild multistability where the zoo of regimes is the most various. One can hardly predict here even a qualitative nature of the expected solution, since each perturbation of the coupling strength or initial conditions results in a new character of dynamics.

Modular Brain Networks

The development of new technologies for mapping structural and functional brain connectivity has led to the creation of comprehensive network maps of neuronal circuits and systems. The architecture of these brain networks can be examined and analyzed with a large variety of graph theory tools. Methods for detecting modules, or network communities, are of particular interest because they uncover major building blocks or subnetworks that are particularly densely connected, often corresponding to specialized functional components. A large number of methods for community detection have become available and are now widely applied in network neuroscience. This article first surveys a number of these methods, with an emphasis on their advantages and shortcomings; then it summarizes major findings on the existence of modules in both structural and functional brain networks and briefly considers their potential functional roles in brain evolution, wiring minimization, and the emergence of functional specialization and complex dynamics.

Kuramoto model simulation of neural hubs and dynamic synchrony in the human cerebral connectome

Background

The topological structure of the wiring of the mammalian brain cortex plays an important role in shaping the functional dynamics of large-scale neural activity. Due to their central embedding in the network, high degree hub regions and their connections (often referred to as the ‘rich club’) have been hypothesized to facilitate intermodular neural communication and global integration of information by means of synchronization. Here, we examined the theoretical role of anatomical hubs and their wiring in brain dynamics. The Kuramoto model was used to simulate interaction of cortical brain areas by means of coupled phase oscillators—with anatomical connections between regions derived from diffusion weighted imaging and module assignment of brain regions based on empirically determined resting-state data.

Results

Our findings show that synchrony among hub nodes was higher than any module’s intramodular synchrony (p < 10⁻⁴, for cortical coupling strengths, λ, in the range 0.02 < λ < 0.05), suggesting that hub nodes lead the functional modules in the process of synchronization. Furthermore, suppressing structural connectivity among hub nodes resulted in an elevated modular state (p < 4.1 × l0⁻³, 0.015 < λ < 0.04), indicating that hub-to-hub connections are critical in intermodular synchronization. Finally, perturbing the oscillatory behavior of hub nodes prevented functional modules from synchronizing, implying that synchronization of functional modules is dependent on the hub nodes’ behavior.

Conclusion

Our results converge on anatomical hubs having a leading role in intermodular synchronization and integration in the human brain.

Electronic supplementary material

The online version of this article (doi:10.1186/s12868-015-0193-z) contains supplementary material, which is available to authorized users.

Synchronization versus neighborhood similarity in complex networks of nonidentical oscillators

Does the assignment order of a fixed collection of slightly distinct subsystems into given communication channels influence the overall ensemble behavior? We discuss this question in the context of complex networks of nonidentical interacting oscillators. Three types of connection configurations are considered: Similar, Dissimilar, and Neutral patterns. These different groups correspond, respectively, to oscillators alike, distinct, and indifferent relative to their neighbors. To construct such scenarios we define a vertex-weighted graph measure, the total dissonance, which comprises the sum of the dissonances between all neighbor oscillators in the network. Our numerical simulations show that the more homogeneous a network, the higher tend to be both the coupling strength required for phase locking and the associated final phase configuration spread over the circle. On the other hand, the initial spread of partial synchronization occurs faster for Similar patterns in comparison to Dissimilar ones, while neutral patterns are an intermediate situation between both extremes.

Dynamics of globally coupled oscillators: Progress and perspectives

In this paper, we discuss recent progress in research of ensembles of mean field coupled oscillators. Without an ambition to present a comprehensive review, we outline most interesting from our viewpoint results and surprises, as well as interrelations between different approaches.

Delayed feedback control of synchronization in weakly coupled oscillator networks

We study control of synchronization in weakly coupled oscillator networks by using a phase-reduction approach. Starting from a general class of limit-cycle oscillators we derive a phase model, which shows that delayed feedback control changes effective coupling strengths and effective frequencies. We derive the analytical condition for critical control gain, where the phase dynamics of the oscillator becomes extremely sensitive to any perturbations. As a result the network can attain phase synchronization even if the natural interoscillatory couplings are small. In addition, we demonstrate that delayed feedback control can disrupt the coherent phase dynamic in synchronized networks. The validity of our results is illustrated on networks of diffusively coupled Stuart-Landau and FitzHugh-Nagumo models.

Consistency between functional and structural networks of coupled nonlinear oscillators

In data-based reconstruction of complex networks, dynamical information can be measured and exploited to generate a functional network, but is it a true representation of the actual (structural) network? That is, when do the functional and structural networks match and is a perfect matching possible? To address these questions, we use coupled nonlinear oscillator networks and investigate the transition in the synchronization dynamics to identify the conditions under which the functional and structural networks are best matched. We find that, as the coupling strength is increased in the weak-coupling regime, the consistency between the two networks first increases and then decreases, reaching maximum in an optimal coupling regime. Moreover, by changing the network structure, we find that both the optimal regime and the maximum consistency will be affected. In particular, the consistency for heterogeneous networks is generally weaker than that for homogeneous networks. Based on the stability of the functional network, we propose further an efficient method to identify the optimal coupling regime in realistic situations where the detailed information about the network structure, such as the network size and the number of edges, is not available. Two real-world examples are given: corticocortical network of cat brain and the Nepal power grid. Our results provide new insights not only into the fundamental interplay between network structure and dynamics but also into the development of methodologies to reconstruct complex networks from data.

A novel characterization of amalgamated networks in natural systems

Densely-connected networks are prominent among natural systems, exhibiting structural characteristics often optimized for biological function. To reveal such features in highly-connected networks, we introduce a new network characterization determined by a decomposition of network-connectivity into low-rank and sparse components. Based on these components, we discover a new class of networks we define as amalgamated networks, which exhibit large functional groups and dense connectivity. Analyzing recent experimental findings on cerebral cortex, food-web, and gene regulatory networks, we establish the unique importance of amalgamated networks in fostering biologically advantageous properties, including rapid communication among nodes, structural stability under attacks, and separation of network activity into distinct functional modules. We further observe that our network characterization is scalable with network size and connectivity, thereby identifying robust features significant to diverse physical systems, which are typically undetectable by conventional characterizations of connectivity. We expect that studying the amalgamation properties of biological networks may offer new insights into understanding their structure-function relationships.

Frequency assortativity can induce chaos in oscillator networks

We investigate the effect of preferentially connecting oscillators with similar frequency to each other in networks of coupled phase oscillators (i.e., frequency assortativity). Using the network Kuramoto model as an example, we find that frequency assortativity can induce chaos in the macroscopic dynamics. By applying a mean-field approximation in combination with the dimension reduction method of Ott and Antonsen, we show that the dynamics can be described by a low dimensional system of equations. We use the reduced system to characterize the macroscopic chaos using Lyapunov exponents, bifurcation diagrams, and time-delay embeddings. Finally, we show that the emergence of chaos stems from the formation of multiple groups of synchronized oscillators, i.e., meta-oscillators.

Network catastrophe: self-organized patterns reveal both the instability and the structure of complex networks

Critical events in society or biological systems can be understood as large-scale self-emergent phenomena due to deteriorating stability. We often observe peculiar patterns preceding these events, posing a question of-how to interpret the self-organized patterns to know more about the imminent crisis. We start with a very general description - of interacting population giving rise to large-scale emergent behaviors that constitute critical events. Then we pose a key question: is there a quantifiable relation between the network of interactions and the emergent patterns? Our investigation leads to a fundamental understanding to: 1. Detect the system's transition based on the principal mode of the pattern dynamics; 2. Identify its evolving structure based on the observed patterns. The main finding of this study is that while the pattern is distorted by the network of interactions, its principal mode is invariant to the distortion even when the network constantly evolves. Our analysis on real-world markets show common self-organized behavior near the critical transitions, such as housing market collapse and stock market crashes, thus detection of critical events before they are in full effect is possible.

Erosion of synchronization in networks of coupled oscillators

We report erosion of synchronization in networks of coupled phase oscillators, a phenomenon where perfect phase synchronization is unattainable in steady state, even in the limit of infinite coupling. An analysis reveals that the total erosion is separable into the product of terms characterizing coupling frustration and structural heterogeneity, both of which amplify erosion. The latter, however, can differ significantly from degree heterogeneity. Finally, we show that erosion is marked by the reorganization of oscillators according to their node degrees rather than their natural frequencies.

Social significance of community structure: statistical view

Community structure analysis is a powerful tool for social networks that can simplify their topological and functional analysis considerably. However, since community detection methods have random factors and real social networks obtained from complex systems always contain error edges, evaluating the significance of a partitioned community structure is an urgent and important question. In this paper, integrating the specific characteristics of real society, we present a framework to analyze the significance of a social community. The dynamics of social interactions are modeled by identifying social leaders and corresponding hierarchical structures. Instead of a direct comparison with the average outcome of a random model, we compute the similarity of a given node with the leader by the number of common neighbors. To determine the membership vector, an efficient community detection algorithm is proposed based on the position of the nodes and their corresponding leaders. Then, using a log-likelihood score, the tightness of the community can be derived. Based on the distribution of community tightness, we establish a connection between p-value theory and network analysis, and then we obtain a significance measure of statistical form . Finally, the framework is applied to both benchmark networks and real social networks. Experimental results show that our work can be used in many fields, such as determining the optimal number of communities, analyzing the social significance of a given community, comparing the performance among various algorithms, etc.

Think locally, act locally: detection of small, medium-sized, and large communities in large networks

It is common in the study of networks to investigate intermediate-sized (or "meso-scale") features to try to gain an understanding of network structure and function. For example, numerous algorithms have been developed to try to identify "communities," which are typically construed as sets of nodes with denser connections internally than with the remainder of a network. In this paper, we adopt a complementary perspective that communities are associated with bottlenecks of locally biased dynamical processes that begin at seed sets of nodes, and we employ several different community-identification procedures (using diffusion-based and geodesic-based dynamics) to investigate community quality as a function of community size. Using several empirical and synthetic networks, we identify several distinct scenarios for "size-resolved community structure" that can arise in real (and realistic) networks: (1) the best small groups of nodes can be better than the best large groups (for a given formulation of the idea of a good community); (2) the best small groups can have a quality that is comparable to the best medium-sized and large groups; and (3) the best small groups of nodes can be worse than the best large groups. As we discuss in detail, which of these three cases holds for a given network can make an enormous difference when investigating and making claims about network community structure, and it is important to take this into account to obtain reliable downstream conclusions. Depending on which scenario holds, one may or may not be able to successfully identify "good" communities in a given network (and good communities might not even exist for a given community quality measure), the manner in which different small communities fit together to form meso-scale network structures can be very different, and processes such as viral propagation and information diffusion can exhibit very different dynamics. In addition, our results suggest that, for many large realistic networks, the output of locally biased methods that focus on communities that are centered around a given seed node (or set of seed nodes) might have better conceptual grounding and greater practical utility than the output of global community-detection methods. They also illustrate structural properties that are important to consider in the development of better benchmark networks to test methods for community detection.

Blind and myopic ants in heterogeneous networks

The diffusion processes on complex networks may be described by different Laplacian matrices due to heterogeneous connectivity. Here we investigate the random walks of blind ants and myopic ants on heterogeneous networks: While a myopic ant hops to a neighbor node every step, a blind ant may stay or hop with probabilities that depend on node connectivity. By analyzing the trajectories of blind ants, we show that the asymptotic behaviors of both random walks are related by rescaling time and probability with node connectivity. Using this result, we show how the small eigenvalues of the Laplacian matrices generating the two random walks are related. As an application, we show how the return-to-origin probability of a myopic ant can be used to compute the scaling behaviors of the Edwards-Wilkinson model, a representative model of load balancing on networks.

Understanding genetic variation - the value of systems biology

Pharmacology is currently transformed by the vast amounts of genome-associated information available for system-level interpretation. Here I review the potential of systems biology to facilitate this interpretation, thus paving the way for the emerging field of systems pharmacology. In particular, I will show how gene regulatory and metabolic networks can serve as a framework for interpreting high throughput data and as an interface to detailed dynamical models. In addition to the established connectivity analyses of effective networks, I suggest here to also analyze higher order architectural properties of effective networks.

A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks

Various types of social relationships, such as friends and foes, can be represented as signed social networks (SNs) that contain both positive and negative links. Although many community detection (CD) algorithms have been proposed, most of them were designed primarily for networks containing only positive links. Thus, it is important to design CD algorithms which can handle large-scale SNs. To this purpose, we first extend the original similarity to the signed similarity based on the social balance theory. Then, based on the signed similarity and the natural contradiction between positive and negative links, two objective functions are designed to model the problem of detecting communities in SNs as a multiobjective problem. Afterward, we propose a multiobjective evolutionary algorithm, called MEAs-SN. In MEAs-SN, to overcome the defects of direct and indirect representations for communities, a direct and indirect combined representation is designed. Attributing to this representation, MEAs-SN can switch between different representations during the evolutionary process. As a result, MEAs-SN can benefit from both representations. Moreover, owing to this representation, MEAs-SN can also detect overlapping communities directly. In the experiments, both benchmark problems and large-scale synthetic networks generated by various parameter settings are used to validate the performance of MEAs-SN. The experimental results show the effectiveness and efficacy of MEAs-SN on networks with 1000, 5000, and 10,000 nodes and also in various noisy situations. A thorough comparison is also made between MEAs-SN and three existing algorithms, and the results show that MEAs-SN outperforms other algorithms.

Repeated-drive adaptive feedback identification of network topologies

The identification of the topological structures of complex networks from dynamical information is a significant inverse problem. How to infer the information of network topology from short-time dynamical data is a challenging topic. The presence of synchronization among nodes makes the identification of network topology difficult. In this paper we present an efficient method called the repeated-drive adaptive feedback scheme to reveal the network connectivity from short-time dynamics. By applying the short asynchronous transient data as a repeated drive, the adjacency matrix can be successfully determined in terms of the modified adaptive feedback scheme. This improved scheme is valid for both synchronous and asynchronous cases of the network and is especially efficient in the presence of global or local synchronization, where the transient drive can be obtained by perturbing the system to get a very short asynchronous transient. The detection speed of our scheme exhibits the optimized effect by adjusting the time-series segment length and the coupling strength among nodes in the network.

Cyclic motifs as the governing topological factor in time-delayed oscillator networks

We identify the relative amount of short cyclic motifs as an important topological factor in networks of time-delayed Kuramoto oscillators. The patterns emerging from the cyclic motifs are most clearly distinguishable in the average frequency and the momentary frequency dispersion as a function of the time delay. In particular, the common distinction between bidirectional and unidirectional couplings is shown to have a decisive effect on the network dynamics. We argue that the behavior peculiar to the sparsely connected unidirectional random network can be described essentially as the lack of distinguishable patterns originating from cyclic motifs of any specific length.

Active semi-supervised community detection based on must-link and cannot-link constraints

Community structure detection is of great importance because it can help in discovering the relationship between the function and the topology structure of a network. Many community detection algorithms have been proposed, but how to incorporate the prior knowledge in the detection process remains a challenging problem. In this paper, we propose a semi-supervised community detection algorithm, which makes full utilization of the must-link and cannot-link constraints to guide the process of community detection and thereby extracts high-quality community structures from networks. To acquire the high-quality must-link and cannot-link constraints, we also propose a semi-supervised component generation algorithm based on active learning, which actively selects nodes with maximum utility for the proposed semi-supervised community detection algorithm step by step, and then generates the must-link and cannot-link constraints by accessing a noiseless oracle. Extensive experiments were carried out, and the experimental results show that the introduction of active learning into the problem of community detection makes a success. Our proposed method can extract high-quality community structures from networks, and significantly outperforms other comparison methods.

Perspective: network-guided pattern formation of neural dynamics

The understanding of neural activity patterns is fundamentally linked to an understanding of how the brain's network architecture shapes dynamical processes. Established approaches rely mostly on deviations of a given network from certain classes of random graphs. Hypotheses about the supposed role of prominent topological features (for instance, the roles of modularity, network motifs or hierarchical network organization) are derived from these deviations. An alternative strategy could be to study deviations of network architectures from regular graphs (rings and lattices) and consider the implications of such deviations for self-organized dynamic patterns on the network. Following this strategy, we draw on the theory of spatio-temporal pattern formation and propose a novel perspective for analysing dynamics on networks, by evaluating how the self-organized dynamics are confined by network architecture to a small set of permissible collective states. In particular, we discuss the role of prominent topological features of brain connectivity, such as hubs, modules and hierarchy, in shaping activity patterns. We illustrate the notion of network-guided pattern formation with numerical simulations and outline how it can facilitate the understanding of neural dynamics.

Functional brain networks: great expectations, hard times and the big leap forward

Many physical and biological systems can be studied using complex network theory, a new statistical physics understanding of graph theory. The recent application of complex network theory to the study of functional brain networks has generated great enthusiasm as it allows addressing hitherto non-standard issues in the field, such as efficiency of brain functioning or vulnerability to damage. However, in spite of its high degree of generality, the theory was originally designed to describe systems profoundly different from the brain. We discuss some important caveats in the wholesale application of existing tools and concepts to a field they were not originally designed to describe. At the same time, we argue that complex network theory has not yet been taken full advantage of, as many of its important aspects are yet to make their appearance in the neuroscience literature. Finally, we propose that, rather than simply borrowing from an existing theory, functional neural networks can inspire a fundamental reformulation of complex network theory, to account for its exquisitely complex functioning mode.

Optimal synchronization of complex networks

We study optimal synchronization in networks of heterogeneous phase oscillators. Our main result is the derivation of a synchrony alignment function that encodes the interplay between network structure and oscillators' frequencies and that can be readily optimized. We highlight its utility in two general problems: constrained frequency allocation and network design. In general, we find that synchronization is promoted by strong alignments between frequencies and the dominant Laplacian eigenvectors, as well as a matching between the heterogeneity of frequencies and network structure.

Community structure revealed by phase locking

Community structure can naturally emerge in paths to synchronization, and scratching it from the paths is a tough issue that accounts for the diverse dynamics of synchronization. In this paper, with assumption that the synchronization on complex networks is made up of local and collective processes, we proposed a scheme to lock the local synchronization (phase locking) at a stable state, meanwhile, suppress the collective synchronization based on Kuramoto model. Through this scheme, the network dynamics only contains the local synchronization, which suggests that the nodes in the same community synchronize together and these synchronization clusters well reveal the community structure of network. Furthermore, by analyzing the paths to synchronization, the relations or overlaps among different communities are also obtained. Thus, the community detection based on the scheme is performed on five real networks and the observed community structures are much more apparent than modularity-based fast algorithm. Our results not only provide a deep insight to understand the synchronization dynamics on complex network but also enlarge the research scope of community detection.

Frustrated hierarchical synchronization and emergent complexity in the human connectome network

The spontaneous emergence of coherent behavior through synchronization plays a key role in neural function, and its anomalies often lie at the basis of pathologies. Here we employ a parsimonious (mesoscopic) approach to study analytically and computationally the synchronization (Kuramoto) dynamics on the actual human-brain connectome network. We elucidate the existence of a so-far-uncovered intermediate phase, placed between the standard synchronous and asynchronous phases, i.e. between order and disorder. This novel phase stems from the hierarchical modular organization of the connectome. Where one would expect a hierarchical synchronization process, we show that the interplay between structural bottlenecks and quenched intrinsic frequency heterogeneities at many different scales, gives rise to frustrated synchronization, metastability, and chimera-like states, resulting in a very rich and complex phenomenology. We uncover the origin of the dynamic freezing behind these features by using spectral graph theory and discuss how the emerging complex synchronization patterns relate to the need for the brain to access –in a robust though flexible way– a large variety of functional attractors and dynamical repertoires without ad hoc fine-tuning to a critical point.

A community detection algorithm based on topology potential and spectral clustering

Community detection is of great value for complex networks in understanding their inherent law and predicting their behavior. Spectral clustering algorithms have been successfully applied in community detection. This kind of methods has two inadequacies: one is that the input matrixes they used cannot provide sufficient structural information for community detection and the other is that they cannot necessarily derive the proper community number from the ladder distribution of eigenvector elements. In order to solve these problems, this paper puts forward a novel community detection algorithm based on topology potential and spectral clustering. The new algorithm constructs the normalized Laplacian matrix with nodes' topology potential, which contains rich structural information of the network. In addition, the new algorithm can automatically get the optimal community number from the local maximum potential nodes. Experiments results showed that the new algorithm gave excellent performance on artificial networks and real world networks and outperforms other community detection methods.

Two-layer modular analysis of gene and protein networks in breast cancer

Background

Genomic, proteomic and high-throughput gene expression data, when integrated, can be used to map the interaction networks between genes and proteins. Different approaches have been used to analyze these networks, especially in cancer, where mutations in biologically related genes that encode mutually interacting proteins are believed to be involved. This system of integrated networks as a whole exhibits emergent biological properties that are not obvious at the individual network level. We analyze the system in terms of modules, namely a set of densely interconnected nodes that can be further divided into submodules that are expected to participate in multiple biological activities in coordinated manner.

Results

In the present work we construct two layers of the breast cancer network: the gene layer, where the correlation network of breast cancer genes is analyzed to identify gene modules, and the protein layer, where each gene module is extended to map out the network of expressed proteins and their interactions in order to identify submodules. Each module and its associated submodules are analyzed to test the robustness of their topological distribution. The constituent biological phenomena are explored through the use of the Gene Ontology. We thus construct a “network of networks”, and demonstrate that both the gene and protein interaction networks are modular in nature. By focusing on the ontological classification, we are able to determine the entire GO profiles that are distributed at different levels of hierarchy. Within each submodule most of the proteins are biologically correlated, and participate in groups of distinct biological activities.

Conclusions

The present approach is an effective method for discovering coherent gene modules and protein submodules. We show that this also provides a means of determining biological pathways (both novel and as well those that have been reported previously) that are related, in the present instance, to breast cancer. Similar strategies are likely to be useful in the analysis of other diseases as well.

Exploring community structure in biological networks with random graphs

Background

Community structure is ubiquitous in biological networks. There has been an increased interest in unraveling the community structure of biological systems as it may provide important insights into a system’s functional components and the impact of local structures on dynamics at a global scale. Choosing an appropriate community detection algorithm to identify the community structure in an empirical network can be difficult, however, as the many algorithms available are based on a variety of cost functions and are difficult to validate. Even when community structure is identified in an empirical system, disentangling the effect of community structure from other network properties such as clustering coefficient and assortativity can be a challenge.

Results

Here, we develop a generative model to produce undirected, simple, connected graphs with a specified degrees and pattern of communities, while maintaining a graph structure that is as random as possible. Additionally, we demonstrate two important applications of our model: (a) to generate networks that can be used to benchmark existing and new algorithms for detecting communities in biological networks; and (b) to generate null models to serve as random controls when investigating the impact of complex network features beyond the byproduct of degree and modularity in empirical biological networks.

Conclusion

Our model allows for the systematic study of the presence of community structure and its impact on network function and dynamics. This process is a crucial step in unraveling the functional consequences of the structural properties of biological systems and uncovering the mechanisms that drive these systems.

Generalised power graph compression reveals dominant relationship patterns in complex networks

We introduce a framework for the discovery of dominant relationship patterns in complex networks, by compressing the networks into power graphs with overlapping power nodes. When paired with enrichment analysis of node classification terms, the most compressible sets of edges provide a highly informative sketch of the dominant relationship patterns that define the network. In addition, this procedure also gives rise to a novel, link-based definition of overlapping node communities in which nodes are defined by their relationships with sets of other nodes, rather than through connections within the community. We show that this completely general approach can be applied to undirected, directed, and bipartite networks, yielding valuable insights into the large-scale structure of real-world networks, including social networks and food webs. Our approach therefore provides a novel way in which network architecture can be studied, defined and classified.

Cross-linked structure of network evolution

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.