636 citations · 994 across the 14 of their papers we have counts for
7 papers · 1 filter
Relations between Average Distance, Heterogeneity and Network Synchronizability
Ming Zhao, Tao Zhou, Bing-Hong Wang +3
By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex netwo…
Generalized BBV Models for Weighted Complex Networks
Bo Hu, Gang Yan, Wen-Xu Wang +1
We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathemati…
A Mutual Attraction Model for Both Assortative and Disassortative Weighted Networks
Wen-Xu Wang, Bo Hu, Bing-Hong Wang +1
In most networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a Mutual Attraction Model to charact…
Weighted Network Models Based on Local and Global Rules
Bo Hu, Gang Yan, Wen-Xu Wang +1
We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathemati…
Simplex triangulation induced scale-free networks
Zhi-Ming Gu, Tao Zhou, Bing-Hong Wang +3
We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation…
Efficient routing on complex networks
Gang Yan, Tao Zhou, Bo Hu +2
In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a g…