Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Coherent random perm ...
Conference paper

Coherent random permutations with record statistics

Alexander Gnedin (1)
(1) Utrecht Mathematical Institute
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2006
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Proceedings
DOI
10.46298/dmtcs.3551
License
https://about.hal.science/hal-authorisation-v1
Indicators
789
Views
1125
Downloads

Coherent random permutations with record statistics

Alexander Gnedin (1)
(1) Utrecht Mathematical Institute
Abstract
A two-parameter family of random permutations of $[n]$ is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution. A distinguished role of the family is determined by the fact that every sequence of coherent permutations $(π _n,n=1,2,\ldots)$ with the indicated kind of sufficiency is obtainable by randomisation of the parameters. Generating algorithms and asymptotic properties of the permutations follow from the representation via initial ranks.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • random permutations
  • records
  • sufficiency
  • Ewens' distribution
Cited by

Source: OpenCitations

  • Boundaries from Inhomogeneous Bernoulli Trials

    Progress in probability

    Authors : Alexander Gnedin

    Journal reference : Volume , 2011, pp. 91-110

    DOI : 10.1007/978-3-0346-0244-0_6
  • Counts of Failure Strings in Certain Bernoulli Sequences

    Journal of Applied Probability

    Authors : Lars Holst

    Journal reference : Volume 44, 2007, pp. 824-830

    DOI : 10.1239/jap/1189717547
Preview
Loading PDF preview...