One of the common features of many real networks is community structure. Itwill be much easier for us to understand some network phenomenons if we can fig-ure the community structure out of a network. Here we talk about the algorithms tofind the community structure of networks. The first chapter introduces the concept ofcommunity structure and the history of some partitioning algorithms. Chapter 2 givesthe basic mathematics knowledge. In chapter 3 and chapter 4 , spectral clustering andalgorithms based on modularity are studied. And in chapter 5, A new algorithm frame-work for detecting community structure is carried out based on our analysis of spectralclustering and CNM algorithm. Chapter 6 gives some open questions for future studyand chapter 7 is the conclusion. |