Graph Centrality Analysis
Graph Centrality Analysis is a methodological framework within graph analytics that identifies and quantifies the relative importance or influence of nodes in a network based on their structural position, distinguished by its focus on measuring centrality through metrics such as degree, betweenness, closeness, and eigenvector centrality.
515
Publications
51.5K
Citations
1.4K
Authors
664
Institutions
Publications per year
2017–2026
238
Parents
515
A Set of Measures of Centrality Based on Betweenness
Linton C. Freeman · Sociometry · 1977 · 10.2K citations
A faster algorithm for betweenness centrality*
Ulrik Brandes · Journal of Mathematical Sociology · 2001 · 4.9K citations · Full text
Measurement and analysis of online social networks
Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi et al. · 2007 · 3.1K citations
Some unique properties of eigenvector centrality
Phillip Bonacich · Social Networks · 2007 · 1.6K citations
1–5 of 515
1.4K
8
h-index
8
h-index
7
h-index
6
h-index
6
h-index
1–5 of 1.4K
664
Georgia Institute of Technology
Atlanta, United States
10 h-index
25 publications
1.8K citations
University of Oxford
Oxford, United Kingdom
7 h-index
7 publications
611 citations

University of Strathclyde
Glasgow, United Kingdom
7 h-index
10 publications
312 citations
Universidad Rey Juan Carlos
Madrid, Spain
7 h-index
27 publications
3.4K citations
Brown University
Providence, United States
7 h-index
9 publications
283 citations

University of Warsaw
Warsaw, Poland
6 h-index
12 publications
268 citations
National University of Singapore
Singapore, Singapore
6 h-index
9 publications
378 citations
Université Claude Bernard Lyon 1
Villeurbanne, France
6 h-index
11 publications
185 citations
1–8 of 664
16 publications · 1.2K citations
15
h-index
Repository · 16 publications · 378 citations
13
h-index
10 publications · 398 citations
10
h-index
9 publications · 3.2K citations
9
h-index
9 publications · 549 citations
9
h-index
1–5