Photo by polarmermaid from unsplash
where 0≤ α < 1/ρ(M) is a damping factor, and v is a nonnegative preference vector. In Boldi et al. (2017), we discussed under which conditions damped spectral rankings on… Click to show full abstract
where 0≤ α < 1/ρ(M) is a damping factor, and v is a nonnegative preference vector. In Boldi et al. (2017), we discussed under which conditions damped spectral rankings on graphs, such as Katz’s index or PageRank, enjoy strict rank monotonicity, that is, if it happens that when the score of z = y is smaller than or equal to the score of y, after adding an arc from x to y the score of z becomes smaller than the score of y. In this note we correct the statement of Theorem 5, which is not true without the condition v > 0. Adding the latter condition to Theorem 5 of Boldi et al. (2017), the statement becomes3:
Journal Title: Network Science
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!