Keywords
CentralityDigraphGraphDirected graphComputer scienceTheoretical computer scienceMathematicsCombinatoricsAlgorithm
Affiliated Institutions
Related Publications
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
Social network analysis methods and applications
Part I. Introduction: Networks, Relations, and Structure: 1. Relations and networks in the social and behavioral sciences 2. Social network data: collection and application Part...
Are randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined b...
PageRank for ranking authors in co‐citation networks
Abstract This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 ...
Publication Info
- Year
- 1973
- Type
- article
- Volume
- 2
- Issue
- 4
- Pages
- 371-378
- Citations
- 97
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
97
OpenAlex
Cite This
U. J. Nieminen
(1973).
On the centrality in a directed graph.
Social Science Research
, 2
(4)
, 371-378.
https://doi.org/10.1016/0049-089x(73)90010-0
Identifiers
- DOI
- 10.1016/0049-089x(73)90010-0