विधियों की तुलना करें

	निर्देशित द्वि-मोड नेटवर्क विश्लेषण	निर्देशित मॉड्यूलरिटी विश्लेषण
क्षेत्र	नेटवर्क विश्लेषण	नेटवर्क विश्लेषण
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1997	2008
प्रवर्तक	Borgatti, S. P. & Everett, M. G.	Leicht, E. A. & Newman, M. E. J.
प्रकार	Structural network analysis	Community detection / graph partitioning
मौलिक स्रोत	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications (Ch. 8). Cambridge University Press. ISBN: 978-0-521-38707-1	Leicht, E. A., & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703.
उपनाम	directed bipartite network analysis, asymmetric affiliation network analysis, directed actor-event network analysis, directed two-mode graph analysis	directed community detection via modularity, directed Q-modularity, digraph modularity optimization, Leicht-Newman modularity
संबंधित	6	5
सारांश	Directed two-mode network analysis studies bipartite graphs in which nodes belong to two distinct sets — such as actors and events, authors and papers, or firms and markets — and edges carry a direction, capturing asymmetric relationships like citation, referral, or endorsement. Combining the duality of two-mode structure with directed tie semantics reveals flow patterns and influence asymmetries that undirected or single-mode analyses would miss.	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.