Methoden vergelijken

	Modulariteitsanalyse voor gerichte grafen	Gerichte Netwerkanalyse
Vakgebied	Netwerkanalyse	Netwerkanalyse
Familie	Machine learning	Machine learning
Jaar van ontstaan	2008	1994
Grondlegger	Leicht, E. A. & Newman, M. E. J.	Wasserman, S. & Faust, K.
Type	Community detection / graph partitioning	Structural analysis of directed graphs
Oorspronkelijke bron	Leicht, E. A., & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703.	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
Aliassen	directed community detection via modularity, directed Q-modularity, digraph modularity optimization, Leicht-Newman modularity	directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis
Verwant	5	5
Samenvatting	Directed modularity analysis extends the classic Newman-Girvan modularity framework to directed graphs, where edges carry a source and a destination. Formalized by Leicht and Newman in 2008, it partitions nodes into communities by maximizing a modularity score that accounts for each node's separate in-degree and out-degree in the null model, making it the standard approach for community detection in citation networks, information flows, and other asymmetric relational data.	Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades.