Abstract. We proposed three approximate longest chain-attack strategies and studied the vulnerability of complex networks under these intentional attack strategies. Experimental results indicate that when random network and small-world network are under any one of the three chain-attacks, the larger the is, the smaller the iterative step T is. However, scale-free network shows different characteristics: the larger the is, the larger the T is. These findings supplement and extend the previous attack results on nodes and edges, and can thus help us better explain the vulnerability of different complex networks.

No abstract

No abstract

In order to detect the hierarchical semantic community which is helpful to discover the true organization of information network,we propose a complete information graph approach. In this method, we first use complete information graphs including semantic edges and link edges to represent information networks. Then we define semantic modularity as an objective function, a measure that can express not only the tightness of links, but also the consistency of content. Next, we improve Lovain's algorithm and propose simLV algorithm to detect communities on the complete information graph. This recursive algorithm itself can discover semantic communities of different sizes in the process of execution. Experiment results show the hierarchical community detected by the simLV algorithm performs better than the Louvain in measuring the consistency of semantic content for our approach takes into account the content attributes of nodes, which are neglected by many other methods. It can detect more meaningful community structures with consistent content and tight structure in information networks such as social networks, citation networks, web networks, etc., which is helpful to the application of information dissemination analysis, topic detection, public opinion detection, etc.

Abstract-We proposed three shortest path-attack strategies and investigated the vulnerability of three complex model networks under these path-attack strategies. The experimental results indicate that the robustness of random network is the weakest, but small-world network is the strongest under the shortest pathattack strategies. We also obtain that the shortest path-attack strategies are more harmful than RPA(random augmenting approach) attack strategy. These findings supplement and extend the previous attack results and can thus help us to provide some insights into the design of more robust networks.