Related papers: Coincidence rank and multivariate equicontinuity
A simple proof of the fact that each rank-one infinite measure preserving (i.m.p.) transformation is subsequence weakly rationally ergodic is found. Some classes of funny rank-one i.m.p. actions of Abelian groups are shown to be subsequence…
A Cantor minimal system is of finite topological rank if it has a Bratteli-Vershik representation whose number of vertices per level is uniformly bounded. We prove that if the topological rank of a minimal dynamical system on a Cantor set…
In this note, it is shown that several results concerning mean equicontinuity proved before for minimal systems are actually held for general topological dynamical systems. Particularly, it turns out that a dynamical system is mean…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
The ranking problem is to order a collection of units by some unobserved parameter, based on observations from the associated distribution. This problem arises naturally in a number of contexts, such as business, where we may want to rank…
In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…
The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn…
An algebraic isopair is a commuting pair of pure isometries that is annihilated by a polynomial defining a distinguished variety $\mathcal{V}$. The notion of the rank of a pure algebraic isopair with finite bimultiplicity is introduced. For…
The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages. In this paper, we study the problem of ranking vertices of a bipartite graph,…
In a recent paper entitled "Inconsistencies of Recently Proposed Citation Impact Indicators and how to Avoid Them," Schreiber (2012, at arXiv:1202.3861) proposed (i) a method to assess tied ranks consistently and (ii) fractional attribution…
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
Ranks estimated from data are uncertain and this poses a challenge in many applications. However, estimated ranks are deterministic functions of estimated parameters, so the uncertainty in the ranks must be determined by the uncertainty in…
The inequality between rank and crank moments was conjectured and later proved by Garvan himself in 2011. Recently, Dixit and the authors introduced finite analogues of rank and crank moments for vector partitions while deriving a finite…
We consider the space of matrices, with given number of rows and of columns, equipped with the classic trace scalar product. With any matrix (source) norm, we associate a coupling, called Capra, between the space of matrices and itself.…
We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…
We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…
Competition between a complex system's constituents and a corresponding reward mechanism based on it have profound influence on the functioning, stability, and evolution of the system. But determining the dominance hierarchy or ranking…
Kechris and Louveau showed that each real-valued bounded Baire class 1 function defined on a compact metric space can be written as an alternating sum of a decreasing countable transfinite sequence of upper semi-continuous functions.…
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…