In: Scientific Reports, 2014, vol. 4, p. -
Ranking the significance of scientific publications is a long-standing challenge. The network-based analysis is a natural and common approach for evaluating the scientific credit of papers. Although the number of citations has been widely used as a metric to rank papers, recently some iterative processes such as the well-known PageRank algorithm have been applied to the citation networks to...
|
In: Chaos: An Interdisciplinary Journal of Nonlinear Science, 2013, vol. 23, no. 1, p. 013104–013104–7
Many real-world networks display a natural bipartite structure, yet analyzing and visualizing large bipartite networks is one of the open challenges in complex network research. A practical approach to this problem would be to reduce the complexity of the bipartite system while at the same time preserve its functionality. However, we find that existing coarse graining methods for monopartite...
|
In: Europhysics Letters - EPL, 2011, vol. 96, no. 55, p. 58007
Most real systems are growing. In order to model the evolution of real systems, many growing network models have been proposed to reproduce some specific topology properties. As the structure strongly influences the network function, designing the function-aimed growing strategy is also a significant task with many potential applications. In this letter, we focus on synchronization in the growing...
|
In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2011, vol. 83, no. 4, p. 045101
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...
|
In: Physica A: Statistical Mechanics and its Applications, 2011, vol. 390, no. 21-22, p. 3962-3969
Recently, spatial networks have attracted much attention. The spatial network is constructed from a regular lattice by adding long-range edges (shortcuts) with probability P(r)∼r−δ, where r is the geographical distance between the two ends of the edge. Also, a cost constraint on the total length of the additional edges is introduced...
|