Rank Independence and Rearrangements of Random Variables
Alexander Gnedin, Zbigniew Nitecki
Abstract
A rearrangement of n independent uniform [0,1] random variables is a sequence of n random variables Y1,...,Yn whose vector of order statistics has the same distribution as that for the n uniforms. We consider rearrangements satisfying the strong rank independence condition, that the rank of Yk among Y1,...,Yk is independent of the values of Y1,...,Yk-1, for k=1,...,n. Nontrivial examples of such rearrangements are the travellers' processes defined by Gnedin and Krengel. We show that these are the only examples when n=2, and when certain restrictive assumptions hold for n≥ 3; we also construct a new class of examples of such rearrangements for which the restrictive assumptions do not hold.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang