Related papers: Rank as a function of measure

The paper deals with the problem of reconstructing the topological structure of a network of dynamical systems. A distance function is defined in order to evaluate the "closeness" of two processes and a few useful mathematical properties…

This paper establishes endpoint $L^p-L^q$ and Sobolev mapping properties of Radon-like operators which satisfy a homogeneity condition (similar to semiquasihomogeneity) and a condition on the rank of a matrix related to rotational…

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

Neural networks can be thought of as applying a transformation to an input dataset. The way in which they change the topology of such a dataset often holds practical significance for many tasks, particularly those demanding non-homeomorphic…

Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in…

Two different notions of {\mu}-equicontinuity that apply to topological dynamical systems and probability measures were studied by Gilman (1987) and Huang-Lu-Ye (2011). One was used to classify measure preserving topological dynamical…

Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…

A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We…

The focus of this article is on entropy and Markov processes. We study the properties of functionals which are invariant with respect to monotonic transformations and analyze two invariant "additivity" properties: (i) existence of a…

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

Learning to rank -- producing a ranked list of items specific to a query and with respect to a set of supervisory items -- is a problem of general interest. The setting we consider is one in which no analytic description of what constitutes…

Consider a continuous random pair $(X,Y)$ whose dependence is characterized by an extreme-value copula with Pickands dependence function $A$. When the marginal distributions of $X$ and $Y$ are known, several consistent estimators of $A$ are…

Online learning to rank is a core problem in machine learning. In Lattimore et al. (2018), a novel online learning algorithm was proposed based on topological sorting. In the paper they provided a set of self-normalized inequalities (a) in…

The low for random reals are characterized topologically, as well as in terms of domination of Turing functionals on a set of positive measure.

In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…

It has been discovered previously that the topological order parameter could be identified from the topological data of the Green's function, namely the (generalized) TKNN invariant in general dimensions, for both non-interacting and…

Iverson's APL and its descendants (such as J, K and FISh) are examples of the family of "rank-polymorphic" programming languages. The principal control mechanism of such languages is the general lifting of functions that operate on arrays…

Here we shall consider the topology and dynamics associated to a wide class of matchbox manifolds, including a large selection of tiling spaces and all minimal matchbox manifolds of dimension one. For such spaces we introduce topological…

In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…