Related papers: Rank and randomness
Rankings are central to decision-making in fields ranging from education to online platforms, yet classical deterministic methods such as the Borda count method or Copeland-type pairwise methods ignore uncertainty due to sampling noise or…
In this paper we consider level l Appell functions, and find a partial differential equation for all odd l. For l=3 this recovers the Rank-Crank PDE, found by Atkin and Garvan, and for l=5 we get a similar PDE found by Garvan.
We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…
We want to select the best systems out of a given set of systems (or rank them) with respect to their expected performance. The systems allow random observations only and we assume that the joint observation of the systems has a…
We study algorithmically random closed subsets of $2^\omega$, algorithmically random continuous functions from $2^\omega$ to $2^\omega$, and algorithmically random Borel probability measures on $2^\omega$, especially the interplay between…
We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a…
We consider the problem of inferring an unknown ranking of $n$ items from a random tournament on $n$ vertices whose edge directions are correlated with the ranking. We establish, in terms of the strength of these correlations, the…
Low-rank structure have been profoundly studied in data mining and machine learning. In this paper, we show a dense matrix $X$'s low-rank approximation can be rapidly built from its left and right random projections $Y_1=XA_1$ and…
The theory of ordinal ranks on Baire class 1 functions developed by Kechris and Loveau was recently extended by Elekes, Kiss and Vidny\'{a}nszky to Baire class $\xi$ functions for any countable ordinal $\xi\geq1$. In this paper, we answer…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
Recent work has proposed stochastic Plackett-Luce (PL) ranking models as a robust choice for optimizing relevance and fairness metrics. Unlike their deterministic counterparts that require heuristic optimization algorithms, PL models are…
We study the Cantor--Bendixson rank of the space of subgroups for members of a general class of finitely generated self-replicating branch groups. In particular, we show for $G$ either the Grigorchuk group or the Gupta--Sidki $3$ group, the…
This working paper describes new results in derivations of the Continuous Ranked Probability Score of a generalized beta-prime distribution and several special cases, such as the Dagum distribution and Singh-Maddala distribution. Comparison…
One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…
For any Polish space $X$ it is well-known that the Cantor-Bendixson rank provides a co-analytic rank on $F_{\aleph_0}(X)$ if and only if $X$ is a $\sigma$-compact. In the case of $\omega^\omega$ one may recover a co-analytic rank on…
Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…
Many outcomes of interest in the social and health sciences, as well as in modern applications in computational social science and experimentation on social media platforms, are ordinal and do not have a meaningful scale. Causal analyses…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…