|
|
|
| Finding Community Structure in Networks Using Node’s Dynamic Connection Degree |
| JIA Jun, HU Xiaofeng, HE Xiaoyuan
|
| a. The Department of Information Operation Command Training; b. The Department of Graduate,National Defense University,Beijing 100091,China |
|
|
|
|
Abstract This paper gives the definition of node’s dynamic connection degree at first, and then introduces the algorithm of finding the community structure by the node’s dynamic connection degree. After that, it analyzes the range of parameter’s value in node’s connection degree and proves it by experimenting on the Zachary network. On this basis, it experiments on three real networks which are dolphins, polbooks and football. The result proves that this algorithm can find different network’s community structure correctly by adjust its parameter’s value. At last, it compares the result with some other common algorithms’ and illustrates some matters that need attention.
|
|
Received: 06 July 2015
Published: 25 February 2025
|
|
|
|
|
|
|
|
|
