Directed Social Network Analysis
Directed Social Network Analysis (Digraph-Based SNA) · Also known as: directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis
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.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+4 more
When to use it
Use directed SNA whenever the direction of a tie is theoretically meaningful and empirically recorded: citation networks, advice-seeking or information-seeking surveys, social media follower and retweet graphs, hyperlink networks, and organisational authority flows. It is the correct default when raw data contain a source and a target column. Do not apply directed SNA to surveys that record only mutual acknowledgment (friendship, co-authorship, kinship) without measuring directionality, or when the data-collection instrument cannot distinguish sender from receiver — in those cases, undirected SNA avoids artificially asymmetric results.
Strengths & limitations
- Preserves directional information that undirected analysis loses, enabling richer structural insights.
- Separates in-degree (prestige, popularity) from out-degree (activity, reach) for more nuanced actor profiling.
- Reciprocity and asymmetry metrics reveal power imbalances, hierarchy, and role differentiation.
- Directional path analysis correctly models the flow of information, resources, or influence.
- Compatible with the full SNA toolkit — visualisation, centrality, community detection — extended to digraphs.
- Widely supported in standard software including igraph, NetworkX, Gephi, UCINET, and R statnet.
- Requires data that explicitly record the direction of each tie; retrospective symmetrisation is a lossy workaround.
- Many directed metrics such as directed betweenness and directed clustering are computationally expensive on large networks.
- Small directed networks are prone to reciprocity estimates with high variance and unreliable centrality rankings.
- Visualising large directed graphs is challenging; arrow overlaps and layout algorithms can obscure structure.
Frequently asked
When should I use directed rather than undirected SNA?
Use directed SNA whenever your data-collection instrument records who initiates or sends a tie and who receives it, and when that asymmetry is theoretically important. If your survey asks who is your friend without a matching question to the other person, the data are already inherently directed even if reciprocity is common.
How is reciprocity different from density?
Density is the proportion of all possible directed ties that are present. Reciprocity is the proportion of existing directed ties that are mutual — it answers how symmetric the network is, independently of how sparse or dense it is.
Can I symmetrise a directed network to use standard SNA tools?
Symmetrisation is acceptable only as a sensitivity check or when direction truly does not matter theoretically. Replacing every directed pair with an undirected edge discards information about asymmetry, flow, and hierarchy, and can distort centrality rankings substantially.
Which software packages support directed SNA?
igraph (R and Python), NetworkX (Python), statnet/sna (R), Gephi (GUI), and UCINET all handle directed graphs natively. Most functions take a directed=TRUE or create_using=nx.DiGraph() argument to preserve arrow orientation.
What sample size do I need for reliable directed centrality estimates?
There is no universal minimum, but reciprocity estimates and centrality rankings become unstable in networks with fewer than around 20 nodes. For inferential tests such as permutation-based QAP or ERGM, at least 50 to 100 nodes with reasonably dense ties are advisable.
Sources
- Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
- Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press. ISBN: 978-0-19-920665-0
How to cite this page
ScholarGate. (2026, June 3). Directed Social Network Analysis (Digraph-Based SNA). ScholarGate. https://scholargate.app/en/network-analysis/directed-social-network-analysis
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Betweenness CentralityNetwork analysis↔ compare
- Degree CentralityNetwork analysis↔ compare
- Directed Community DetectionNetwork analysis↔ compare
- Directed PageRankNetwork analysis↔ compare
- Social Network AnalysisNetwork analysis↔ compare