방법 비교

	Directed Community Detection	방향성 중심성
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2008	1977
창시자	Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T.	Freeman, L. C.
유형	Graph partitioning / modularity optimization	Centrality measure (directed graph)
원전	Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
별칭	directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning	directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness
관련	6	5
요약	Directed community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways.	Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies.