%0 Journal Article %1 Hu2008 %A Hu, Yanqing %A Li, Menghui %A Zhang, Peng %A Fan, Ying %A Di, Zengru %D 2008 %I American Physical Society %J Physical Review E %K algorithms community-detection graphs networks signaling %N 1 %P 016115 %R 10.1103/PhysRevE.78.016115 %T Community detection by signaling on complex networks %V 78 %X 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.

@article{Hu2008, abstract = {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.}, added-at = {2011-07-05T16:09:38.000+0200}, author = {Hu, Yanqing and Li, Menghui and Zhang, Peng and Fan, Ying and Di, Zengru}, biburl = {https://www.bibsonomy.org/bibtex/27b2a74a05079a14249aa737cec3a9160/rincedd}, doi = {10.1103/PhysRevE.78.016115}, interhash = {9a8696c3ae1a809d85747df1a9dabbc7}, intrahash = {7b2a74a05079a14249aa737cec3a9160}, journal = {Physical Review E}, keywords = {algorithms community-detection graphs networks signaling}, number = 1, pages = 016115, publisher = {American Physical Society}, timestamp = {2011-07-05T16:09:38.000+0200}, title = {Community detection by signaling on complex networks}, volume = 78, year = 2008 }