Spectral ranking
Bibliographic Data
| ID | 6161634 |
|---|---|
| Authors | Sebastiano Vigna (0000-0002-3257-651X, University of Milan, corresponding author) |
| Year | 2016 |
| Volume | 4 |
| Issue | 4 |
| Pages | 433-445 |
| Publication date | 2016-11-21 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Network Science (JOURNAL) |
| Journal identifiers | ISSN: 2050-1250 • E-ISSN: 2050-1242 |
| Publisher | Cambridge University Press (PUBLISHER • US) |
| DOI | 10.1017/nws.2016.21 |
| OpenAlex | W3037400782 |
| Language | EN |
| Citations received | 5 |
| References cited | 30 |
We sketch the history of spectral ranking —a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities . Albeit recently made famous by the ample press coverage of Google's PageRank algorithm, spectral ranking was devised more than 60 years ago, almost exactly in the same terms, and has been studied in psychology, social sciences, bibliometrics, economy, and choice theory. We describe the contribution given by previous scholars in precise and modern mathematical terms: Along the way, we show how to express in a general way damped rankings, such as Katz's index, as dominant eigenvectors of perturbed matrices, and then use results on the Drazin inverse to go back to the dominant eigenvectors by a limit process. The result suggests a regularized definition of spectral ranking that yields for a general matrix a unique vector depending on a boundary condition
Algebra over a field · Algorithm · Combinatorics · Eigenvalues and eigenvectors · Information retrieval · Matrix (chemical analysis · PageRank · Physics · Pure mathematics · Rank (graph theory · Ranking (information retrieval · Sketch · Complex Network Analysis Techniques · Computer Science · Mathematics · Topological and Geometric Data Analysis
Social balance-based centrality measure for directed signed networks
A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations
Rank monotonicity in centrality measures
Monotonicity in undirected networks
A Method of Matrix Analysis of Group Structure
Authoritative sources in a hyperlinked environment
A formal theory of social power.
A New Status Index Derived from Sociometric Analysis
Simultaneous group and individual centralities
Eigenvector-like measures of centrality for asymmetric relations
An Input-Output Approach to Clique Identification
Factoring and weighting approaches to status scores and clique identification
The Analysis of Sociograms using Matrix Algebra
On the Geographical Interpretation of Eigenvalues
Theoretical Foundations for Centrality Measures
Power and Centrality
| Unique citing works | 5 |
|---|---|
| Citations per year | 0.56 |
| Citation span | 2017 - 2024 (8) |
| Citation velocity | recent |
| Highly cited | No |
| Citation types | Neutral: 5 |