Synchronization reveals topological scales in complex networks

Analysis of remote synchronization in complex networks

A novel regime of synchronization, called remote synchronization, where the peripheral nodes form a phase synchronized cluster not including the hub, was recently observed in star motifs [Bergner et al., Phys. Rev. E 85, 026208 (2012)]. We show the existence of a more general dynamical state of remote synchronization in arbitrary networks of coupled oscillators. This state is characterized by the synchronization of pairs of nodes that are not directly connected via a physical link or any sequence of synchronized nodes. This phenomenon is almost negligible in networks of phase oscillators as its underlying mechanism is the modulation of the amplitude of those intermediary nodes between the remotely synchronized units. Our findings thus show the ubiquity and robustness of these states and bridge the gap from their recent observation in simple toy graphs to complex networks.

Community structure and multi-modal oscillations in complex networks

In many types of network, the relationship between structure and function is of great significance. We are particularly interested in community structures, which arise in a wide variety of domains. We apply a simple oscillator model to networks with community structures and show that waves of regular oscillation are caused by synchronised clusters of nodes. Moreover, we show that such global oscillations may arise as a direct result of network topology. We also observe that additional modes of oscillation (as detected through frequency analysis) occur in networks with additional levels of topological hierarchy and that such modes may be directly related to network structure. We apply the method in two specific domains (metabolic networks and metropolitan transport) demonstrating the robustness of our results when applied to real world systems. We conclude that (where the distribution of oscillator frequencies and the interactions between them are known to be unimodal) our observations may be applicable to the detection of underlying community structure in networks, shedding further light on the general relationship between structure and function in complex systems.

Criterion for the emergence of explosive synchronization transitions in networks of phase oscillators

The emergence of explosive synchronization transitions in networks of phase oscillators recently has become one of the most interesting topics. It is widely believed that the large frequency mismatch of a pair of oscillators (also known as disassortativity in frequency) is a direct cause of an explosive synchronization. It is found that, besides the disassortativity in frequency, the disassortativity in node degree also shows up in connection with the first-order synchronization transition. In this paper, we simulate the Kuramoto model on top of a family of networks with different degree-degree and frequency-frequency correlation patterns. Results show that only when the degrees and natural frequencies of the network's nodes are both disassortative can an explosive synchronization occur.

Explosive synchronization transitions in complex neural networks

It has been recently reported that explosive synchronization transitions can take place in networks of phase oscillators [Gómez-Gardeñes et al. Phys. Rev. Lett. 106, 128701 (2011)] and chaotic oscillators [Leyva et al. Phys. Rev. Lett. 108, 168702 (2012)]. Here, we investigate the effect of a microscopic correlation between the dynamics and the interacting topology of coupled FitzHugh-Nagumo oscillators on phase synchronization transition in Barabási-Albert (BA) scale-free networks and Erdös-Rényi (ER) random networks. We show that, if natural frequencies of the oscillations are positively correlated with node degrees and the width of the frequency distribution is larger than a threshold value, a strong hysteresis loop arises in the synchronization diagram of BA networks, indicating the evidence of an explosive transition towards synchronization of relaxation oscillators system. In contrast to the results in BA networks, in more homogeneous ER networks, the synchronization transition is always of continuous type regardless of the width of the frequency distribution. Moreover, we consider the effect of degree-mixing patterns on the nature of the synchronization transition, and find that the degree assortativity is unfavorable for the occurrence of such an explosive transition.

Explosive synchronization in a general complex network

Explosive synchronization (ES) has recently attracted much attention, where its two necessary conditions are found to be a scale-free network topology and a positive correlation between the natural frequencies of the oscillators and their degrees. Here we present a framework for ES to be observed in a general complex network, where a positive correlation between coupling strengths of the oscillators and the absolute of their natural frequencies is assumed and the previous studies are included as specific cases. In the framework, the previous two necessary conditions are replaced by another one, thus fundamentally deepening the understanding of the microscopic mechanism toward synchronization. A rigorous analytical treatment by a mean field is provided to explain the mechanism of ES in this alternate framework.

Detecting triplet locking by triplet synchronization indices

We discuss the effect of triplet synchrony in oscillatory networks. In this state the phases and the frequencies of three coupled oscillators fulfill the conditions of a triplet locking, whereas every pair of systems remains asynchronous. We suggest an easy to compute measure, a triplet synchronization index, which can be used to detect such states from experimental data.

Remote synchronization reveals network symmetries and functional modules

We study a Kuramoto model in which the oscillators are associated with the nodes of a complex network and the interactions include a phase frustration, thus preventing full synchronization. The system organizes into a regime of remote synchronization where pairs of nodes with the same network symmetry are fully synchronized, despite their distance on the graph. We provide analytical arguments to explain this result, and we show how the frustration parameter affects the distribution of phases. An application to brain networks suggests that anatomical symmetry plays a role in neural synchronization by determining correlated functional modules across distant locations.

Robust detection of dynamic community structure in networks

We describe techniques for the robust detection of community structure in some classes of time-dependent networks. Specifically, we consider the use of statistical null models for facilitating the principled identification of structural modules in semi-decomposable systems. Null models play an important role both in the optimization of quality functions such as modularity and in the subsequent assessment of the statistical validity of identified community structure. We examine the sensitivity of such methods to model parameters and show how comparisons to null models can help identify system scales. By considering a large number of optimizations, we quantify the variance of network diagnostics over optimizations ("optimization variance") and over randomizations of network structure ("randomization variance"). Because the modularity quality function typically has a large number of nearly degenerate local optima for networks constructed using real data, we develop a method to construct representative partitions that uses a null model to correct for statistical noise in sets of partitions. To illustrate our results, we employ ensembles of time-dependent networks extracted from both nonlinear oscillators and empirical neuroscience data.

Diffusion dynamics on multiplex networks

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-laplacian matrix, which consists of a dimensional lifting of the laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Effects of community structure on the dynamics of random threshold networks

Random threshold networks (RTNs) have been widely used as models of neural or genetic regulatory networks. Network topology plays a central role in the dynamics of these networks. Recently it has been shown that many social and biological networks are scale-free and also exhibit community structure, in which autonomous modules are wired together to perform relatively independent functions. In this study we use both synchronous and asynchronous models of RTNs to systematically investigate how community structure affects the dynamics of RTNs with scale-free topology. Extensive simulation experiments show that RTNs with high modularity have more attractors than those RTNs with low modularity, and RTNs with smaller communities tend to have more attractors. Damage resulting from perturbation of initial conditions spreads less effectively in RTNs with higher modularity and RTNs with smaller communities. In addition, RTNs with high modularity can coordinate their internal dynamics better than RTNs with low modularity under the synchronous update scheme, and it is the other way around under the asynchronous update. This study shows that community structure has a strong effect on the dynamics of RTNs.

Hierarchical modular structure identification with its applications in gene coexpression networks

Network module (community) structure has been a hot research topic in recent years. Many methods have been proposed for module detection and identification. Hierarchical structure of modules is shown to exist in many networks such as biological networks and social networks. Compared to the partitional module identification methods, less research is done on the inference of hierarchical modular structure. In this paper, we propose a method for constructing the hierarchical modular structure based on the stochastic block model. Statistical tests are applied to test the hierarchical relations between different modules. We give both artificial networks and real data examples to illustrate the performance of our approach. Application of the proposed method to yeast gene coexpression network shows that it does have a hierarchical modular structure with the modules on different levels corresponding to different gene functions.

Stability-to-instability transition in the structure of large-scale networks

We examine phase transitions between the "easy," "hard," and "unsolvable" phases when attempting to identify structure in large complex networks ("community detection") in the presence of disorder induced by network "noise" (spurious links that obscure structure), heat bath temperature T, and system size N. The partition of a graph into q optimally disjoint subgraphs or "communities" inherently requires Potts-type variables. In earlier work [Philos. Mag. 92, 406 (2012)], when examining power law and other networks (and general associated Potts models), we illustrated that transitions in the computational complexity of the community detection problem typically correspond to spin-glass-type transitions (and transitions to chaotic dynamics in mechanical analogs) at both high and low temperatures and/or noise. The computationally "hard" phase exhibits spin-glass type behavior including memory effects. The region over which the hard phase extends in the noise and temperature phase diagram decreases as N increases while holding the average number of nodes per community fixed. This suggests that in the thermodynamic limit a direct sharp transition may occur between the easy and unsolvable phases. When present, transitions at low temperature or low noise correspond to entropy driven (or "order by disorder") annealing effects, wherein stability may initially increase as temperature or noise is increased before becoming unsolvable at sufficiently high temperature or noise. Additional transitions between contending viable solutions (such as those at different natural scales) are also possible. Identifying community structure via a dynamical approach where "chaotic-type" transitions were found earlier. The correspondence between the spin-glass-type complexity transitions and transitions into chaos in dynamical analogs might extend to other hard computational problems. In this work, we examine large networks (with a power law distribution in cluster size) that have a large number of communities (q≫1). We infer that large systems at a constant ratio of q to the number of nodes N asymptotically tend towards insolvability in the limit of large N for any positive T. The asymptotic behavior of temperatures below which structure identification might be possible, T_{×}=O[1/lnq], decreases slowly, so for practical system sizes, there remains an accessible, and generally easy, global solvable phase at low temperature. We further employ multivariate Tutte polynomials to show that increasing q emulates increasing T for a general Potts model, leading to a similar stability region at low T. Given the relation between Tutte and Jones polynomials, our results further suggest a link between the above complexity transitions and transitions associated with random knots.

Determination of the critical coupling of explosive synchronization transitions in scale-free networks by mean-field approximations

An explosive synchronization can be observed in scale-free networks when Kuramoto oscillators have natural frequencies equal to their number of connections. The present paper reports on mean-field approximations to determine the critical coupling of such explosive synchronization. It has been verified that the equation obtained for the critical coupling has an inverse dependence on the network average degree. This expression differs from those whose frequency distributions are unimodal and even. In this case, the critical coupling depends on the ratio between the first and second statistical moments of the degree distribution. Numerical simulations were also conducted to verify our analytical results.

A network function-based definition of communities in complex networks

We consider an alternate definition of community structure that is functionally motivated. We define network community structure based on the function the network system is intended to perform. In particular, as a specific example of this approach, we consider communities whose function is enhanced by the ability to synchronize and/or by resilience to node failures. Previous work has shown that, in many cases, the largest eigenvalue of the network's adjacency matrix controls the onset of both synchronization and percolation processes. Thus, for networks whose functional performance is dependent on these processes, we propose a method that divides a given network into communities based on maximizing a function of the largest eigenvalues of the adjacency matrices of the resulting communities. We also explore the differences between the partitions obtained by our method and the modularity approach (which is based solely on consideration of network structure). We do this for several different classes of networks. We find that, in many cases, modularity-based partitions do almost as well as our function-based method in finding functional communities, even though modularity does not specifically incorporate consideration of function.

Estimating network topology by the mean first-passage time

In this work, we employed the concept of the first-passage time in stochastic processes to estimate node degrees and the degree distribution of a network. A statistical exploration of the coupling reveals the relation between the node degree and the coupling term. In practical terms, an effective way to reveal the statistical property is to investigate the differences between coupled oscillators in a network and uncoupled ones with the same initial states. We discovered a monotonically decreasing relation between the node degree and the mean first-passage time (MFPT) for the evolution of the coupled node deviating from the uncoupled one. Moreover, this relation can be understood as the competition of different relaxational time scales. The MFPT method is independent of both the dynamics of the nodes and the topological properties of the network. This might be advantageous in our efforts to build a bridge between the topological property and the dynamics of a network.

Network structure, topology, and dynamics in generalized models of synchronization

Network structure is a product of both its topology and interactions between its nodes. We explore this claim using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, nodes synchronize in stages, revealing the network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process similar to diffusion. However, social and biological processes are often nonconservative. We propose a model of synchronization in a network of oscillators coupled via nonconservative processes. We study the dynamics of synchronization of a synthetic and real-world networks and show that the traditional and nonconservative models of synchronization reveal different structures within the same network.

Potts model based on a Markov process computation solves the community structure problem effectively

The Potts model is a powerful tool to uncover community structure in complex networks. Here, we propose a framework to reveal the optimal number of communities and stability of network structure by quantitatively analyzing the dynamics of the Potts model. Specifically we model the community structure detection Potts procedure by a Markov process, which has a clear mathematical explanation. Then we show that the local uniform behavior of spin values across multiple timescales in the representation of the Markov variables could naturally reveal the network's hierarchical community structure. In addition, critical topological information regarding multivariate spin configuration could also be inferred from the spectral signatures of the Markov process. Finally an algorithm is developed to determine fuzzy communities based on the optimal number of communities and the stability across multiple timescales. The effectiveness and efficiency of our algorithm are theoretically analyzed as well as experimentally validated.

Community identification in networks with unbalanced structure

Community (module) structure is a common and important property of many types of networks, such as social networks and biological networks. Several classes of algorithms have been proposed for community structure detection and identification, including clustering techniques, modularity optimization, and other methods. Among these methods, the modularity optimization method has attracted a great deal of attention and much related research has been published. However, the existing modularity optimization method does not perform well in the presence of unbalanced community structures. In this paper, we introduce a metric to characterize the community structure better than other metrics in this situation, and we propose a method to infer the number of communities, which may solve the resolution limit problem. We then develop an algorithm for community structure identification based on eigendecompositions, and we give both simulated and real data examples to illustrate the better performance of our approach.

Building complex networks with Platonic solids

We propose a unified model to build planar graphs with diverse topological characteristics which are of relevance in real applications. Here convex regular polyhedra (Platonic solids) are used as the building blocks for the construction of a variety of complex planar networks. These networks are obtained by merging polyhedra face by face on a tree-structure leading to planar graphs. We investigate two different constructions: (1) a fully deterministic construction where a self-similar fractal structure is built by using a single kind of polyhedron which is iteratively attached to every face and (2) a stochastic construction where at each step a polyhedron is attached to a randomly chosen face. These networks are scale-free, small-world, clustered, and sparse, sharing several characteristics of real-world complex networks. We derive analytical expressions for the degree distribution, the clustering coefficient, and the mean degree of nearest neighbors showing that these networks have power-law degree distributions with tunable exponents associated with the building polyhedron, and they possess a hierarchical organization that is determined by planarity.

Cooperation-induced topological complexity: a promising road to fault tolerance and hebbian learning

According to an increasing number of researchers intelligence emerges from criticality as a consequence of locality breakdown and long-range correlation, well known properties of phase transition processes. We study a model of interacting units, as an idealization of real cooperative systems such as the brain or a flock of birds, for the purpose of discussing the emergence of long-range correlation from the coupling of any unit with its nearest neighbors. We focus on the critical condition that has been recently shown to maximize information transport and we study the topological structure of the network of dynamically linked nodes. Although the topology of this network depends on the arbitrary choice of correlation threshold, namely the correlation intensity selected to establish a link between two nodes; the numerical calculations of this paper afford some important indications on the dynamically induced topology. The first important property is the emergence of a perception length as large as the flock size, thanks to some nodes with a large number of links, thus playing the leadership role. All the units are equivalent and leadership moves in time from one to another set of nodes, thereby insuring fault tolerance. Then we focus on the correlation threshold generating a scale-free topology with power index ν ≈ 1 and we find that if this topological structure is selected to establish consensus through the linked nodes, the control parameter necessary to generate criticality is close to the critical value corresponding to the all-to-all coupling condition. We find that criticality in this case generates also a third state, corresponding to a total lack of consensus. However, we make a numerical analysis of the dynamically induced network, and we find that it consists of two almost independent structures, each of which is equivalent to a network in the all-to-all coupling condition. This observation confirms that cooperation makes the system evolve toward favoring consensus topological structures. We argue that these results are compatible with both Hebbian learning and fault tolerance.

Stochastic competitive learning in complex networks

Competitive learning is an important machine learning approach which is widely employed in artificial neural networks. In this paper, we present a rigorous definition of a new type of competitive learning scheme realized on large-scale networks. The model consists of several particles walking within the network and competing with each other to occupy as many nodes as possible, while attempting to reject intruder particles. The particle's walking rule is composed of a stochastic combination of random and preferential movements. The model has been applied to solve community detection and data clustering problems. Computer simulations reveal that the proposed technique presents high precision of community and cluster detections, as well as low computational complexity. Moreover, we have developed an efficient method for estimating the most likely number of clusters by using an evaluator index that monitors the information generated by the competition process itself. We hope this paper will provide an alternative way to the study of competitive learning..

Extracting topological features from dynamical measures in networks of Kuramoto oscillators

The Kuramoto model for an ensemble of coupled oscillators provides a paradigmatic example of nonequilibrium transitions between an incoherent and a synchronized state. Here we analyze populations of almost identical oscillators in arbitrary interaction networks. Our aim is to extract topological features of the connectivity pattern from purely dynamical measures based on the fact that in a heterogeneous network the global dynamics is not only affected by the distribution of the natural frequencies but also by the location of the different values. In order to perform a quantitative study we focused on a very simple frequency distribution considering that all the frequencies are equal but one, that of the pacemaker node. We then analyze the dynamical behavior of the system at the transition point and slightly above it as well as very far from the critical point, when it is in a highly incoherent state. The gathered topological information ranges from local features, such as the single-node connectivity, to the hierarchical structure of functional clusters and even to the entire adjacency matrix.

Modularity in protein complex and drug interactions reveals new polypharmacological properties

Recent studies have highlighted the importance of interconnectivity in a large range of molecular and human disease-related systems. Network medicine has emerged as a new paradigm to deal with complex diseases. Connections between protein complexes and key diseases have been suggested for decades. However, it was not until recently that protein complexes were identified and classified in sufficient amounts to carry out a large-scale analysis of the human protein complex system. We here present the first systematic and comprehensive set of relationships between protein complexes and associated drugs and analyzed their topological features. The network structure is characterized by a high modularity, both in the bipartite graph and in its projections, indicating that its topology is highly distinct from a random network and that it contains a rich and heterogeneous internal modular structure. To unravel the relationships between modules of protein complexes, drugs and diseases, we investigated in depth the origins of this modular structure in examples of particular diseases. This analysis unveils new associations between diseases and protein complexes and highlights the potential role of polypharmacological drugs, which target multiple cellular functions to combat complex diseases driven by gain-of-function mutations.

Overlapping community detection via network dynamics

The modular structure of a network is closely related to the dynamics toward clustering. In this paper, a method for community detection is proposed via the clustering dynamics of a network. The initial phases of the nodes in the network are given randomly, and then they evolve according to a set of dedicatedly designed differential equations. The phases of the nodes are naturally separated into several clusters after a period of evolution, and each cluster corresponds to a community in the network. For the networks with overlapping communities, the phases of the overlapping nodes will evolve to the interspace of the two communities. The proposed method is illustrated with applications to both synthetically generated and real-world complex networks.

Hierarchical synchrony of phase oscillators in modular networks

We study synchronization of sinusoidally coupled phase oscillators on networks with modular structure and a large number of oscillators in each community. Of particular interest is the hierarchy of local and global synchrony, i.e., synchrony within and between communities, respectively. Using the recent ansatz of Ott and Antonsen [Chaos 18, 037113 (2008)], we find that the degree of local synchrony can be determined from a set of coupled low-dimensional equations. If the number of communities in the network is large, a low-dimensional description of global synchrony can be also found. Using these results, we study bifurcations between different types of synchrony. We find that, depending on the relative strength of local and global coupling, the transition to synchrony in the network can be mediated by local or global effects.

Finding communities in weighted networks through synchronization

Community detection in weighted networks is an important challenge. In this paper, we introduce a local weight ratio scheme for identifying the community structures of weighted networks within the context of the Kuramoto model by taking into account weights of links. The proposed scheme takes full advantage of the information of the link density among vertices and the closeness of relations between each vertex and its neighbors. By means of this scheme, we explore the connection between community structures and dynamic time scales of synchronization. Moreover, we can also unravel the hierarchical structures of weighted networks with a well-defined connectivity pattern by the synchronization process. The performance of the proposed method is evaluated on both computer-generated benchmark graphs and real-world networks.

Emergence of structural patterns out of synchronization in networks with competitive interactions

Synchronization is a collective phenomenon occurring in systems of interacting units, and is ubiquitous in nature, society and technology. Recent studies have enlightened the important role played by the interaction topology on the emergence of synchronized states. However, most of these studies neglect that real world systems change their interaction patterns in time. Here, we analyze synchronization features in networks in which structural and dynamical features co-evolve. The feedback of the node dynamics on the interaction pattern is ruled by the competition of two mechanisms: homophily (reinforcing those interactions with other correlated units in the graph) and homeostasis (preserving the value of the input strength received by each unit). The competition between these two adaptive principles leads to the emergence of key structural properties observed in real world networks, such as modular and scale-free structures, together with a striking enhancement of local synchronization in systems with no global order.

Coarse graining the dynamics of heterogeneous oscillators in networks with spectral gaps

We present a computer-assisted approach to coarse graining the evolutionary dynamics of a system of nonidentical oscillators coupled through a (fixed) network structure. The existence of a spectral gap for the coupling network graph Laplacian suggests that the graph dynamics may quickly become low dimensional. Our first choice of coarse variables consists of the components of the oscillator states--their (complex) phase angles--along the leading eigenvectors of this Laplacian. We then use the equation-free framework, circumventing the derivation of explicit coarse-grained equations, to perform computational tasks such as coarse projective integration, coarse fixed-point, and coarse limit-cycle computations. In a second step, we explore an approach to incorporating oscillator heterogeneity in the coarse-graining process. The approach is based on the observation of fast-developing correlations between oscillator state and oscillator intrinsic properties and establishes a connection with tools developed in the context of uncertainty quantification.

Detecting hidden spatial and spatio-temporal structures in glasses and complex physical systems by multiresolution network clustering

We elaborate on a general method that we recently introduced for characterizing the "natural" structures in complex physical systems via multi-scale network analysis. The method is based on "community detection" wherein interacting particles are partitioned into an "ideal gas" of optimally decoupled groups of particles. Specifically, we construct a set of network representations ("replicas") of the physical system based on interatomic potentials and apply a multiscale clustering ("multiresolution community detection") analysis using information-based correlations among the replicas. Replicas may i) be different representations of an identical static system, ii) embody dynamics by considering replicas to be time separated snapshots of the system (with a tunable time separation), or iii) encode general correlations when different replicas correspond to different representations of the entire history of the system as it evolves in space-time. Inputs for our method are the inter-particle potentials or experimentally measured two (or higher order) particle correlations. We apply our method to computer simulations of a binary Kob-Andersen Lennard-Jones system in a mixture ratio of A(80)B(20) , a ternary model system with components "A", "B", and "C" in ratios of A(88)B(7)C(5) (as in Al(88)Y(7)Fe(5) , and to atomic coordinates in a Zr(80)Pt(20) system as gleaned by reverse Monte Carlo analysis of experimentally determined structure factors. We identify the dominant structures (disjoint or overlapping) and general length scales by analyzing extrema of the information theory measures. We speculate on possible links between i) physical transitions or crossovers and ii) changes in structures found by this method as well as phase transitions associated with the computational complexity of the community detection problem. We also briefly consider continuum approaches and discuss rigidity and the shear penetration depth in amorphous systems; this latter length scale increases as the system becomes progressively rigid.

Hierarchical organization of brain functional networks during visual tasks

The functional network of the brain is known to demonstrate modular structure over different hierarchical scales. In this paper, we systematically investigated the hierarchical modular organizations of the brain functional networks that are derived from the extent of phase synchronization among high-resolution EEG time series during a visual task. In particular, we compare the modular structure of the functional network from EEG channels with that of the anatomical parcellation of the brain cortex. Our results show that the modular architectures of brain functional networks correspond well to those from the anatomical structures over different levels of hierarchy. Most importantly, we find that the consistency between the modular structures of the functional network and the anatomical network becomes more pronounced in terms of vision, sensory, vision-temporal, motor cortices during the visual task, which implies that the strong modularity in these areas forms the functional basis for the visual task. The structure-function relationship further reveals that the phase synchronization of EEG time series in the same anatomical group is much stronger than that of EEG time series from different anatomical groups during the task and that the hierarchical organization of functional brain network may be a consequence of functional segmentation of the brain cortex.

Towards online multiresolution community detection in large-scale networks

The investigation of community structure in networks has aroused great interest in multiple disciplines. One of the challenges is to find local communities from a starting vertex in a network without global information about the entire network. Many existing methods tend to be accurate depending on a priori assumptions of network properties and predefined parameters. In this paper, we introduce a new quality function of local community and present a fast local expansion algorithm for uncovering communities in large-scale networks. The proposed algorithm can detect multiresolution community from a source vertex or communities covering the whole network. Experimental results show that the proposed algorithm is efficient and well-behaved in both real-world and synthetic networks.

Network reconstruction from random phase resetting

We propose a novel method of reconstructing the topology and interaction functions for a general oscillator network. An ensemble of initial phases and the corresponding instantaneous frequencies is constructed by repeating random phase resets of the system dynamics. The desired details of network structure are then revealed by appropriately averaging over the ensemble. The method is applicable for a wide class of networks with arbitrary emergent dynamics, including full synchrony.

Interplay between structure and dynamics in adaptive complex networks: emergence and amplification of modularity by adaptive dynamics

Many real networks display modular organization, which can influence dynamical clustering on the networks. Therefore, there have been proposals put forth recently to detect network communities by using dynamical clustering. In this paper, we study how the feedback from dynamical clusters can shape the network connection weights with a weight-adaptation scheme motivated from Hebbian learning in neural systems. We show that such a scheme generically leads to the formation of community structure in globally coupled chaotic oscillators. The number of communities in the adaptive network depends on coupling strength c and adaptation strength r. In a modular network, the adaptation scheme will enhance the intramodule connection weights and weaken the intermodule connection strengths, generating effectively separated dynamical clusters that coincide with the communities of the network. In this sense, the modularity of the network is amplified by the adaptation. Thus, for a network with a strong community structure, the adaptation scheme can evidently reflect its community structure by the resulting amplified weighted network. For a network with a weak community structure, the statistical properties of synchronization clusters from different realizations can be used to amplify the modularity of the communities so that they can be detected reliably by the other traditional algorithms.

Competition between intra-community and inter-community synchronization and relevance in brain cortical networks

In this paper the effects of inter-community links on the synchronization performance of community networks, especially on the competition between individual community and the whole network, are studied in detail. The study is organized from two aspects: the number or portion of inter-community links and the connection strategy of inter-community links between different communities. A critical point is found in the competition of global network and individual communities. Increasing the number of inter-community links will enhance the global synchronizability but degrade the synchronization performance of individual community before this point. After that the individual community will synchronize better and better as part of the whole network because the community structure is not so prominent. The critical point represents a balance region where the individual community is maximally independent while the information transmission remains effective between different communities. Among various connection strategies, connecting nodes belonging to different communities randomly rather than connecting nodes with larger degrees are the most efficient way to enhance global synchronization of the network. However, the dynamical modularity is the reverse case. A preferential connection scheme linking most of the hubs from the communities will allow rather efficient global synchronization while maintaining strong dynamical clustering of the communities. Interestingly, the observations are found to be relevant in a realistic network of cat cortex. The synchronization state is just at the critical point, which shows a reasonable combination of segregated function in individual communities and coordination among them. Our work sheds light on principles underlying the emergence of modular architectures in real network systems and provides guidance for the manipulation of synchronization in community networks.

Flow graphs: interweaving dynamics and structure

The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential because different dynamical processes may be affected very differently by network topology. A full characterization of such systems thus requires a formalization that encompasses both aspects simultaneously, rather than relying only on the topological adjacency matrix. To achieve this, we introduce the concept of flow graphs, namely weighted networks where dynamical flows are embedded into the link weights. Flow graphs provide an integrated representation of the structure and dynamics of the system, which can then be analyzed with standard tools from network theory. Conversely, a structural network feature of our choice can also be used as the basis for the construction of a flow graph that will then encompass a dynamics biased by such a feature. We illustrate the ideas by focusing on the mathematical properties of generic linear processes on complex networks that can be represented as biased random walks and their dual consensus dynamics, and show how our framework improves our understanding of these processes.

Evolutionary method for finding communities in bipartite networks

An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework-detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.

Optimal modularity for nucleation in a network-organized Ising model

We study the nucleation dynamics of the Ising model in a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in real-world networks. By introducing a variant of a recently developed forward flux sampling method, we efficiently calculate the rate and elucidate the pathway for the nucleation process. It is found that as the network modularity worsens the nucleation undergoes a transition from a two-step to one-step process. Interestingly, the nucleation rate shows a nonmonotonic dependence on the modularity, in which a maximal nucleation rate occurs at a moderate level of modularity. A simple mean-field analysis is proposed to qualitatively illustrate the simulation results.

Explosive synchronization transitions in scale-free networks

Explosive collective phenomena have attracted much attention since the discovery of an explosive percolation transition. In this Letter, we demonstrate how an explosive transition shows up in the synchronization of scale-free networks by incorporating a microscopic correlation between the structural and the dynamical properties of the system. The characteristics of the explosive transition are analytically studied in a star graph reproducing the results obtained in synthetic networks. Our findings represent the first abrupt synchronization transition in complex networks and provide a deeper understanding of the microscopic roots of explosive critical phenomena.

Node importance for dynamical process on networks: a multiscale characterization

Defining the importance of nodes in a complex network has been a fundamental problem in analyzing the structural organization of a network, as well as the dynamical processes on it. Traditionally, the measures of node importance usually depend either on the local neighborhood or global properties of a network. Many real-world networks, however, demonstrate finely detailed structure at various organization levels, such as hierarchy and modularity. In this paper, we propose a multiscale node-importance measure that can characterize the importance of the nodes at varying topological scale. This is achieved by introducing a kernel function whose bandwidth dictates the ranges of interaction, and meanwhile, by taking into account the interactions from all the paths a node is involved. We demonstrate that the scale here is closely related to the physical parameters of the dynamical processes on networks, and that our node-importance measure can characterize more precisely the node influence under different physical parameters of the dynamical process. We use epidemic spreading on networks as an example to show that our multiscale node-importance measure is more effective than other measures.

Evolution of microscopic and mesoscopic synchronized patterns in complex networks

Previous studies about synchronization of Kuramoto oscillators in complex networks have shown how local patterns of synchronization emerge differently in homogeneous and heterogeneous topologies. The main difference between the paths to synchronization in both topologies is rooted in the growth of the largest connected component of synchronized nodes when increasing the coupling between the oscillators. Nevertheless, a recent study focusing on this same phenomenon has claimed the contrary, stating that the statistical distribution of synchronized clusters for both types of networks is similar. Here we provide extensive numerical evidences that confirm the original claims, namely, that the microscopic and mesoscopic dynamics of the synchronized patterns indeed follow different routes.