Related papers: Rank as a function of measure

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…

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…

We examine so-called rank function equations and their solutions consisting of non-nilpotent matrices. Secondly, we present some geometrical properties of the set of solutions to certain rank function equations in the nilpotent case.

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…

Rank one transformations serve as a source of examples in ergodic theory, showing variety of algebraic, asymptotic and spectral properties of dynamical systems. The properties of a rank one transformation are closely related to the weak…

Rank invariants are a parametrized version of Betti numbers of a space multi-filtered by a continuous vector-valued function. In this note we give a sufficient condition for their finiteness. This condition is sharp for spaces embeddable in…

We define a model for rank one measure preserving transformations in the sense of [2]. This is done by defining a new Polish topology on the space of codes, which are infinite rank one words, for symbolic rank one systems. We establish that…

Functional depth is used for ranking functional observations from most outlying to most typical. The ranks produced by functional depth have been proposed as the basis for functional classifiers, rank tests, and data visualization…

The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have…

Topological entropy is a widely studied indicator of chaos in topological dynamics. Here we give a generalized definition of topological entropy which may be applied to set-valued functions. We demonstrate that some of the well-known…

We introduce Loop Ranking, a new ranking measure based on the detection of closed paths, which can be computed in an efficient way. We analyze it with respect to several ranking measures which have been proposed in the past, and are widely…

Ranking is a key aspect of many applications, such as information retrieval, question answering, ad placement and recommender systems. Learning to rank has the goal of estimating a ranking model automatically from training data. In…

We generalize various notions of stability of invariant sets of dynamical systems to invariant measures, by defining a topology on the set of measures. The defined topology is similar, but not topologically equivalent to weak* topology, and…

In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class $1$ functions. A rank is a function assigning countable ordinals to certain objects, typically measuring their complexity. We extend this theory…

We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.

This paper is one in a series that investigates topological measures on locally compact spaces. A topological measure is a set function which is finitely additive on the collection of open and compact sets, inner regular on open sets, and…

In this article we define and study a notion of asymptotic rank for metric spaces and show in our main theorem that for a large class of spaces, the asymptotic rank is characterized by the growth of the higher filling functions. For a…

Given a countable relational language $L$, we consider probability measures on the space of $L$-structures with underlying set $\mathbb{N}$ that are invariant under the logic action. We study the growth rate of the entropy function of such…

Any collection can be ranked. Sports and games are common examples of ranked systems: players and teams are constantly ranked using different methods. The statistical properties of rankings have been studied for almost a century in a…