Related papers: HodgeRank is the limit of Perron Rank
We examine three methods for ranking by pairwise comparison: Principal Eigenvector, HodgeRank and Tropical Eigenvector. It is shown that the choice of method can produce arbitrarily different rank order.To be precise, for any two of the…
Bias and heterogeneity in peer assessment can lead to the issue of unfair scoring in the educational field. To deal with this problem, we propose a reference ranking method for an online peer assessment system using HodgeRank. Such a scheme…
In prioritization schemes, based on pairwise comparisons, such as the Analytical Hierarchy Process, it is necessary to extract a cardinal ranking vector from a reciprocal matrix that is unlikely to be consistent. It is natural to choose…
The Hadamard rank of a point with respect to a projective variety is, if it exists, the minimum number of points of the variety whose coordinate-wise product is the given point. We classify the projective varieties for which the Hadamard…
HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It analyzes multipartite interactions on high-dimensional networks…
In the last years, Google's PageRank optimization problems have been extensively studied. In that case, the ranking is given by the invariant measure of a stochastic matrix. In this paper, we consider the more general situation in which the…
This paper examines the differences in ordinal rankings obtained from a pairwise comparison matrix using the eigenvalue method and the geometric mean method. First, we introduce several propositions on the (dis)similarity of both rankings…
Motivated by the study of decompositions of tensors as Hadamard products (i.e., coefficient-wise products) of low-rank tensors, we introduce the notion of Hadamard rank of a given point with respect to a projective variety: if it exists, it…
We consider the multilinear pagerank problem studied in [Gleich, Lim and Yu, Multilinear Pagerank, 2015], which is a system of quadratic equations with stochasticity and nonnegativity constraints. We use the theory of quadratic vector…
PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the…
A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatrix. We explore the ``factor-width-$k$ rank'' of a matrix,…
Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…
It has been shown recently that the Eigenvector Method may lead to strong rank reversal in group decision making, that is, the alternative with the highest priority according to all individual vectors may lose its position when evaluations…
The Google matrix is a positive, column-stochastic matrix that is used to compute the pagerank of all the web pages on the Internet: the eigenvector corresponding to the eigenvalue 1 is the pagerank vector. Due to its huge dimension, of the…
We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…
There are many priority deriving methods for pairwise comparison matrices. It is known that when these matrices are consistent all these methods result in the same priority vector. However, when they are inconsistent, the results may vary.…
Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…
In this paper we analyze the PageRank of a complex network as a function of its personalization vector. By using this approach, a complete characterization of the existence and uniqueness of fixed points of PageRank of a graph is given in…
In this paper, we describe the relationship between the Perron root and eigenvectors of an irreducible subshift of finite type with the correlation between the forbidden words in the subshift. In particular, we derive an expression for the…
In the tensor space $\mathrm{Sym}^d {\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a…