Centrality in directed networks
Bibliographic Data
| ID | 12025632 |
|---|---|
| Authors | Gordana Marmulla (0000-0003-3577-2230, ETH Zurich, corresponding author), Ulrik Brandes (0000-0002-1520-0430, ETH Zurich) |
| Year | 2026 |
| Volume | 86 |
| Pages | 23-34 |
| Publication date | 2026-01-07 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Social Networks (JOURNAL) |
| Journal identifiers | ISSN: 0378-8733 • E-ISSN: 1879-2111 |
| Publisher | Elsevier BV (PUBLISHER) |
| DOI | 10.1016/j.socnet.2026.01.001 |
| OpenAlex | W7118846363 |
| Language | EN |
| References cited | 40 |
The identification of important nodes in a network is a pervasive task in a variety of disciplines from sociology and bibliometry to geography and chemistry, and an ever growing number of centrality indices is proposed for this purpose. While such indices are often ad-hoc, preservation of the vicinal preorder has been identified as the core axiom shared by centrality rankings on undirected graphs. We extend this idea to directed graphs by defining vertex preorders based on directed neighborhood-inclusion criteria. While, for the undirected case, the vicinal preorder is total on threshold graphs and preserves all standard centrality indices, we show that our generalized preorders are total on certain subclasses of threshold digraphs. We thus provide a consistent formalization of the hitherto rather conceptual notions of radial, medial, and hierarchical centralities. Through the criteria different notions of centrality are distinguishable, as we exemplify with selected standard centrality indices.
Axiom · Centrality · Identification (biology) · Katz centrality · Network science · Network theory · Preorder · Vertex (graph theory) · Complex Network Analysis Techniques · Evolutionary Game Theory and Cooperation · Game Theory and Applications
Semiorders and a Theory of Utility Discrimination
The Centrality Index of a Graph
The anatomy of a large-scale hypertextual Web search engine
Centrality measures in networks
Centrality in social networks conceptual clarification
The political network in Mexico
A Graph-theoretic perspective on centrality
Sorting out centrality
Centrality and network flow
Eigenvector-like measures of centrality for asymmetric relations
An Input-Output Approach to Clique Identification
Ordinal Centrality
Factoring and weighting approaches to status scores and clique identification
Centrality without indices
Correlations among centrality indices and a class of uniquely ranked graphs
What is network science
On the centrality in a directed graph
| Highly cited | No |
|---|