Method evidence record
Directed Modularity Analysis
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.
Evidence statusSources recorded, not reviewedBibliographic sources are present. Claim-level evidence review has not been performed.
Source record
Recorded
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
Directed Modularity Analysis (Leicht-Newman Directed Community Detection)
Taxonomic method recordml-modelnetwork-analysis
Open full method2 recorded citations, copied from the method source record.
Curated claims
Assessed
Claims persisted in the evidence ledger, each with its own assessment.
No curated claims yet
This view does not invent a claim assessment when the ledger has none.
Related methods
Suggested5
Generated from the method graph and shown as machine-suggested relations. No evidence claim is inferred.
- Taxonomic bucketBetweenness Centrality
machine-suggestedRelational suggestion, not evidence.
- Taxonomic bucketDirected Community Detection
machine-suggestedRelational suggestion, not evidence.
- Taxonomic bucketDirected Social Network Analysis
machine-suggestedRelational suggestion, not evidence.
- Taxonomic bucketModularity Analysis
machine-suggestedRelational suggestion, not evidence.
- Used in the same domainStochastic Block Model
machine-suggestedRelational suggestion, not evidence.