Search

Symmetries, due to their fundamental importance to dynamical processes on networks, have attracted a great deal of current research. Finding all symmetric nodes in large complex networks typically relies on automorphism groups from algebraic-group theory, which are solvable in quasipolynomial time. We articulate a conceptually appealing and computationally extremely efficient approach to finding and characterizing all symmetric nodes by introducing a structural position vector (SPV) for each node in networks. We establish the mathematical result that symmetric nodes must have the same SPV value and demonstrate, using six representative complex networks from the real world, that all symmetric nodes in these networks can be found in linear time. Furthermore, the SPVs not only characterize the similarity of nodes but also quantify the nodal influences in propagation dynamics. A caveat is that the proved mathematical result relating the SPV values to nodal symmetries is not sufficient; i.e., nodes having the same SPV values may not be symmetric, which arises in regular networks or networks with a dominant regular component. We point out with an analysis that this caveat is, in fact, shared by the known existing approaches to finding symmetric nodes in the literature. We further argue, with the aid of a mathematical analysis, that our SPV method is generally effective for finding the symmetric nodes in real-world networks that typically do not have a dominant regular component. Our SPV-based framework, therefore, provides a physically intuitive and computationally efficient way to uncover, understand, and exploit symmetric structures in complex networks arising from real-world applications.

We uncover a phenomenon in coupled nonlinear networks with a symmetry: as a bifurcation parameter changes through a critical value, synchronization among a subset of nodes can deteriorate abruptly, and, simultaneously, perfect synchronization emerges suddenly among a different subset of nodes that are not directly connected. This is a synchronization metamorphosis leading to an explosive transition to remote synchronization. The finding demonstrates that an explosive onset of synchrony and remote synchronization, two phenomena that have been studied separately, can arise in the same system due to symmetry, providing another proof that the interplay between nonlinear dynamics and symmetry can lead to a surprising phenomenon in physical systems.

Coarse graining technology is one of the important methods to study large-scale complex networks currently. Here, we propose a generalized-degree-based coarse graining (GDCG) approach to extract respectively the undirected or directed coarse-grained networks by merging the nodes with same or similar generalized degree. The new approach provides an adjustable generalized degree by parameter p for preserving some significant properties of the initial networks during the coarse-graining processes. Compared with the existing coarse-graining methods, the GDCG method is only based on the generalized degree, which is not only simple and operable, but also keeps some statistical properties and the synchronizability of the original networks. Moreover, the size of the coarse-grained networks can be chosen freely in the proposed method. Finally, extensive numerical simulations demonstrate the effectiveness of our approach.