Based on a signaling process of complex networks, a method for identification of community structure is proposed. For a network with $n$ nodes, every node is assumed to be a system which can send, receive, and record signals. Each node is taken as the initial signal source to excite the whole network one time. Then the source node is associated with an $n$-dimensional vector which records the effects of the signaling process. By this process, the topological relationship of nodes on the network could be transferred into a geometrical structure of vectors in $n$-dimensional Euclidean space. Then the best partition of groups is determined by $F$ statistics and the final community structure is given by the $K$-means clustering method. This method can detect community structure both in unweighted and weighted networks. It has been applied to ad hoc networks and some real networks such as the Zachary karate club network and football team network. The results indicate that the algorithm based on the signaling process works well.

The small-world phenomenon is one of the most important properties found in social networks. It includes both short path lengths and efficient navigation between two individuals. It is found by Kleinberg that navigation is efficient only if the probability density distribution of an individual to have a friend at distance $r$ scales as $P(r)\sim r^{-1}$. Although this spatial scaling is found in many empirical studies, the origin of how this scaling emerges is still missing. In this Letter, we propose the origin of this scaling law using the concept of entropy from statistical physics and show that this scaling is the result of optimization of collecting information in social networks.

We propose a method called the residual edge-betweenness gradient (REBG) to enhance the synchronizability of networks by assigning the link direction while keeping the topology and link weights unchanged. Direction assignment has been shown to improve the synchronizability of undirected networks in general, but we find that in some cases incommunicable components emerge and networks fail to synchronize. We show that the REBG method improves the residual degree gradient (RDG) method by effectively avoiding the synchronization failure. Further experiments show that the REBG method enhances the synchronizability in networks with a community structure compared with the RDG method. DOI: http://dx.doi.org/10.1103/PhysRevE.83.045101 ©2011 American Physical Society

As a classical trade model, the gravity model plays an important role in the trade policy-making process. However, the effect of physical distance fails to capture the effects of globalization and even ignores the multilateral resistance of trade. Here, we propose a general model describing the effective distance of trade according to multilateral trade paths information and the structure of the trade flow network. Quantifying effective trade distance aims to identify the hidden resistance information from trade networks data, and then describe trade barriers. The results show that flow distance, hybrid by multi-path constraint, and international trade network contribute to the forecasting of trade flows. Meanwhile, we also analyze the role of flow distance in international trade from two perspectives of network science and econometric model. At the econometric model level, flow distance can collapse to the predicting results of geographic distance in the proper time lagging variable, which can also reflect that flow distance contains geographical factors. At the international trade network level, community structure detection by flow distances and flow space embedding instructed that the formation of international trade networks is the tradeoff of international specialization in the trade value chain and geographical aggregation. The methodology and results can be generalized to the study of all kinds of product trade systems.

Recent years have witnessed a rapid development of network reconstruction approaches, especially for a series of methods based on compressed sensing. Although compressed-sensing based methods require much less data than conventional approaches, the compressed sensing for reconstructing heterogeneous networks has not been fully exploited because of hubs. Hub neighbors require much more data to be inferred than small-degree nodes, inducing a cask effect for the reconstruction of heterogeneous networks. Here, a conflict-based method is proposed to overcome the cast effect to considerably reduce data amounts for achieving accurate reconstruction. Moreover, an element elimination method is presented to use the partially available structural information to reduce data requirements. The integration of both methods can further improve the reconstruction performance than separately using each technique. These methods are validated by exploring two evolutionary games taking place in scale-free networks, where individual information is accessible and an attempt to decode the network structure from measurable data is made. The results demonstrate that for all of the cases, much data are saved compared to that in the absence of these two methods. Due to the prevalence of heterogeneous networks in nature and society and the high cost of data acquisition in large-scale networks, these approaches have wide applications in many fields and are valuable for understanding and controlling the collective dynamics of a variety of heterogeneous networked systems.

K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing mixed-order transitions. However, real-world systems, ranging from transportation and communication networks to complex brain networks, are not random but are spatially embedded. Here, we study k-core percolation on two-dimensional spatially embedded networks and show that, in contrast to regular percolation, the length of connections can control the transition type, leading to four different types of phase transitions associated with interesting phenomena and a rich phase diagram. A key finding is the existence of a metastable phase where microscopic localized damage, independent of system size, can cause a macroscopic phase transition, a result which cannot be achieved in traditional percolation. In this case, local failures spontaneously propagate the damage radially until the system collapses, a phenomenon analogous to the nucleation process.