English
Related papers

Related papers: HodgeRank is the limit of Perron Rank

200 papers

The relationship between associative composition algebras of dimensions 2 and 4 within the context of homogeneous spaces, with a particular focus on Hamiltonian quaternions, is explored. In the special case of Hamiltonian quaternions, the…

Algebraic Geometry · Mathematics 2025-09-08 Mahir Bilen Can , Ana Casimiro , Ferruh Özbudak

Pickrell has fully characterized the unitarily invariant probability measures on infinite Hermitian matrices, and an alternative proof of this classification has been found by Olshanski and Vershik. Borodin and Olshanski deduced from this…

Probability · Mathematics 2020-04-27 Joseph Najnudel

The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts - including ranking websites - and can be interpreted as the average portion of time spent at…

Data Structures and Algorithms · Computer Science 2014-05-22 Balázs Csanád Csáji , Raphaël M. Jungers , Vincent D. Blondel

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

Probability · Mathematics 2007-10-09 Alain Pajor , Leonid Pastur

Let be a general curve of genus g embedded via a general linear series of degree d in P^r. The well-known Maximal Rank Conjecture asserts that the restriction maps H^0(O_{P^r}(m)) \to H^0(O_C(m) are of maximal rank; if known, this…

Algebraic Geometry · Mathematics 2018-09-20 Eric Larson

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…

Numerical Analysis · Mathematics 2022-12-05 Chao Zeng

In order theory, a rank function measures the vertical "level" of a poset element. It is an integer-valued function on a poset which increments with the covering relation, and is only available on a graded poset. Defining a vertical measure…

Combinatorics · Mathematics 2014-09-24 Cliff Joslyn , Emilie Hogan , Alex Pogel

The p-rank of an algebraic curve X over an algebraically closed field k of characteristic p>0 is the dimension of the first etale cohomology vector space H^1(X,Z/pZ). We study the representations of finite groups G of automorphisms of X…

Algebraic Geometry · Mathematics 2007-05-23 Nicolas Stalder

The Hessian map is the rational map that sends a homogeneous polynomial to the determinant of its Hessian matrix. We prove that the Hessian map is birational on its image for ternary forms of degree $d\ge 4$, $d\neq 5$, by considering the…

Algebraic Geometry · Mathematics 2025-03-13 Ciro Ciliberto , Giorgio Ottaviani , Jerson Caro , Juanita Duque-Rosero

Mean dimension for AH-algebras is introduced. It is shown that if a simple unital AH-algebra with diagonal maps has mean dimension zero, then it has strict comparison on positive elements. In particular, the strict order on projections is…

Operator Algebras · Mathematics 2014-02-04 Zhuang Niu

Let G be a reductive group over a commutative ring R. We say that G has isotropic rank >=n, if every normal semisimple reductive R-subgroup of G contains (G_m)^n. We prove that if G has isotropic rank >=1 and R is a regular domain…

K-Theory and Homology · Mathematics 2018-08-02 Anastasia Stavrova

We study proper holomorphic maps between bounded symmetric domains $D$ and $\Omega$. In particular, when $D$ and $\Omega$ are of the same rank $\ge 2$ such that all irreducible factors of $D$ are of rank $\ge 2$, we prove that any proper…

Complex Variables · Mathematics 2019-07-18 Shan Tai Chan

We introduce and study the problem of consistent low-rank approximation, in which rows of an input matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ arrive sequentially and the goal is to provide a sequence of subspaces that well-approximate the…

Data Structures and Algorithms · Computer Science 2026-03-03 David P. Woodruff , Samson Zhou

The analytic hierarchy process (AHP) is one of the most widely used multicriteria decision-making methods, with applications from agriculture to space engineering. Despite its popularity, AHP has been repeatedly criticised for rank…

Optimization and Control · Mathematics 2026-02-20 Jiri Mazurek , Luis Ángel Calvo

The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…

Statistics Theory · Mathematics 2014-12-20 Jean Lafond , Olga Klopp , Eric Moulines , Jospeh Salmon

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…

Combinatorics · Mathematics 2014-01-14 Daniel C. McDonald

PageRank is a Web page ranking technique that has been a fundamental ingredient in the development and success of the Google search engine. The method is still one of the many signals that Google uses to determine which pages are most…

Information Retrieval · Computer Science 2010-08-17 Massimo Franceschet

We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its…

Information Retrieval · Computer Science 2012-09-21 K. M. Frahm , A. D. Chepelianskii , D. L. Shepelyansky

For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…

Combinatorics · Mathematics 2025-06-23 Qiyuan Chen , Ke Ye

We study the rank of the random $n\times m$ 0/1 matrix ${\bf A}_{n,m;k}$ where each column is chosen independently from the set $\Omega_{n,k}$ of 0/1 vectors with exactly $k$ 1's. Here 0/1 are the elements of the field $GF_2$. We obtain an…

Combinatorics · Mathematics 2018-11-16 C. Cooper , A. M. Frieze , W. Pegden