Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution

From MaRDI portal
Publication:281902

DOI10.1016/J.AAM.2016.04.002zbMATH Open1358.05008arXiv1604.04766OpenAlexW2963684686MaRDI QIDQ281902FDOQ281902


Authors: Simona Grusea, Anthony Labarre Edit this on Wikidata


Publication date: 11 May 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange distance for a random uniform permutation. We also obtain expressions for the mean and the variance of this distribution, and finally, we show that the normalised prefix exchange distribution converges in distribution to the standard normal distribution.


Full work available at URL: https://arxiv.org/abs/1604.04766




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281902)