Showing 1 - 10 of 30
By incorporating local traffic information into the basic shortest path routing policy, we propose a congestion …-free networks with different clustering coefficients and in different congestion phases. We find that there exists an optimal value … for the tunable parameter in the congestion awareness strategy. Though the optimal value increases slowly as the traffic …
Persistent link: https://www.econbiz.de/10010873007
Persistent link: https://www.econbiz.de/10012822227
Persistent link: https://www.econbiz.de/10012660720
Persistent link: https://www.econbiz.de/10013188211
Persistent link: https://www.econbiz.de/10012153419
Persistent link: https://www.econbiz.de/10012433633
We propose several characterizations of weighted complex networks by incorporating the concept of metaweight into the clustering coefficient, degree correlation, and module decomposition. These incorporations make it possible to describe weighted networks depending on how strongly we emphasize...
Persistent link: https://www.econbiz.de/10010873130
In this paper, we present an alternate algorithm for detecting overlapping community structures in the complex network. Two concepts named the maximal sub-graph and the clustering coefficient between two neighboring communities are introduced. First, all the maximal sub-graphs are extracted from...
Persistent link: https://www.econbiz.de/10010931581
In this paper, we develop a general analytical method to compute clustering coefficients of growing networks. This method can be applied to any network as long as we can construct and solve the dynamic equation for the degree of any node. We also verify the accuracy of the method through simulation.
Persistent link: https://www.econbiz.de/10010872433
Persistent link: https://www.econbiz.de/10013412545