相关论文: Network synchronizability analysis: the theory of …

In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the same structural parameters, such as average distance, degree distribution and node betweenness centrality, but…

Network synchronization is an emerging phenomenon in complex networks. The spectrum of Laplacian matrix will be immensely helpful for getting the network dynamics information. Especially, network synchronizability is characterized by the…

By considering the eigenratio of the Laplacian of the connection graph as synchronizability measure, we propose a procedure for weighting dynamical networks to enhance theirsynchronizability. The method is based on node and edge betweenness…

A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…

We consider synchronization of weighted networks, possibly with asymmetrical connections. We show that the synchronizability of the networks cannot be directly inferred from their statistical properties. Small local changes in the network…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

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. For non identical elements, the lack of…

We present an extended analysis, based on the dynamics towards synchronization of a system of coupled oscillators, of the hierarchy of communities in complex networks. In the synchronization process, different structures corresponding to…

In this paper, we investigate the factors that affect the synchronization of coupled oscillators on networks. By using the edge-intercrossing method, we keep the degree distribution unchanged to see other statistical properties' effects on…

Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…

This paper gives a fresh look at network synchronization. Here we no longer analyze it from the view of mathematics, such as graph theory, while we probe into one from control theory. First, we analyze the synchronization region using the…

In this brief report, we propose a network model named crossed double cycles, which are completely symmetrical and can be considered as the extensions of nearest-neighboring lattices. The synchronizability, measured by eigenratio $R$, can…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

The random matrix theory is used to bridge the network structures and the dynamical processes defined on them. We propose a possible dynamical mechanism for the enhancement effect of network structures on synchronization processes, based…

The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…

In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability.…

In this Letter we identify the general rules that determine the synchronization properties of interconnected networks. We study analytically, numerically and experimentally how the degree of the nodes through which two networks are…

We study the synchronization properties of a generic networked dynamical system, and show that, under a suitable approximation, the transition to synchronization can be predicted with the only help of eigenvalues and eigenvectors of the…

Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or recommendation systems. Despite the introduction of numerous…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…