Finding community structure in networks using the eigenvectors of matrices

Finding community structure in networks using the eigenvectors of matrices

23 Jul 2006 | M. E. J. Newman
The paper by M. E. J. Newman discusses the problem of detecting communities or modules within networks, where vertices are grouped into clusters with higher-than-average edge density. The author proposes a robust approach based on maximizing the "modularity" function over possible network divisions. This process can be formulated in terms of the eigenspectrum of a matrix called the "modularity matrix," which plays a role similar to the graph Laplacian in graph partitioning. The paper introduces several algorithms for community detection and explores related concepts such as a spectral measure of bipartite structure and a centrality measure for vertices within communities. The algorithms are illustrated with applications to various real-world complex networks, including social networks, biochemical networks, and information networks like the web. The author also reviews the traditional spectral partitioning method and highlights its limitations, leading to the development of the modularity-based approach. The paper emphasizes the importance of community structure in understanding complex systems and provides insights into the nature and implications of community structure in networks.The paper by M. E. J. Newman discusses the problem of detecting communities or modules within networks, where vertices are grouped into clusters with higher-than-average edge density. The author proposes a robust approach based on maximizing the "modularity" function over possible network divisions. This process can be formulated in terms of the eigenspectrum of a matrix called the "modularity matrix," which plays a role similar to the graph Laplacian in graph partitioning. The paper introduces several algorithms for community detection and explores related concepts such as a spectral measure of bipartite structure and a centrality measure for vertices within communities. The algorithms are illustrated with applications to various real-world complex networks, including social networks, biochemical networks, and information networks like the web. The author also reviews the traditional spectral partitioning method and highlights its limitations, leading to the development of the modularity-based approach. The paper emphasizes the importance of community structure in understanding complex systems and provides insights into the nature and implications of community structure in networks.
Reach us at info@study.space
[slides] Finding community structure in networks using the eigenvectors of matrices. | StudySpace