Related papers: Rank Independence and Rearrangements of Random Var…
Prior proposals for cumulative statistics suggest making tiny random perturbations to the scores (independent variables in a regression) in order to ensure the scores' uniqueness. Uniqueness means that no score for any member of the…
We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods,…
For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…
We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…
A framework for quantifying dependence between random vectors is introduced. With the notion of a collapsing function, random vectors are summarized by single random variables, called collapsed random variables in the framework. Using this…
We describe a new method that is both physically explicable and quantitatively accurate in describing the multifractal characteristics of intermittent events based on groupings of rank-ordered fluctuations. The generic nature of such…
In Robbins' problem of minimizing the expected rank, a finite sequence of $n$ independent, identically distributed random variables are observed sequentially and the objective is to stop at such a time that the expected rank of the selected…
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…
A rational probability distribution on four binary random variables $X, Y, Z, U$ is constructed which satisfies the conditional independence relations $[X \mathrel{\text{$\perp\mkern-10mu\perp$}} Y]$, $[X…
Due to the lack of a canonical ordering in ${\mathbb R}^d$ for $d>1$, defining multivariate generalizations of the classical univariate ranks has been a long-standing open problem in statistics. Optimal transport has been shown to offer a…
We apply concepts of majorization theory to derive new insights in the field of extremal dependence structures. In particular, we consider the Rearrangement Algorithm by Puccetti and Rueschendorf, where majorization arguments yield a…
A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or…
We introduce a new random mapping model, $T_n^{\hat D}$, which maps the set $\{1,2,...,n\}$ into itself.The random mapping $T_n^{\hat D}$ is constructed using a collection of exchangeable random variables $\hat{D}_1, ....,\hat{D}_n$ which…
Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as…
Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…
In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the notion of permutation pattern. More specifically, for any $k$,…
Random multifractals occur in particular at critical points of disordered systems. For Anderson localization transitions, Mirlin and Evers [PRB 62,7920 (2000)] have proposed the following scenario (a) the Inverse Participation Ratios…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…