Common intervals in permutations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2006

Common intervals in permutations

Résumé

An interval of a permutation is a consecutive substring consisting of consecutive symbols. For example, 4536 is an interval in the permutation 71453682. These arise in genetic applications. For the applications, it makes sense to generalize so as to allow gaps of bounded size δ -1, both in the locations and the symbols. For example, 4527 has gaps bounded by 1 (since 3 and 6 are missing) and is therefore a δ -interval of 389415627 for δ =2. After analyzing the distribution of the number of intervals of a uniform random permutation, we study the number of 2-intervals. This is exponentially large, but tightly clustered around its mean. Perhaps surprisingly, the quenched and annealed means are the same. Our analysis is via a multivariate generating function enumerating pairs of potential 2-intervals by size and intersection size.\par

Mots clés

Fichier principal
Vignette du fichier
dm080112.pdf (235.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961109 , version 1 (19-03-2014)

Identifiants

Citer

Sylvie Corteel, Guy Louchard, Robin Pemantle. Common intervals in permutations. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.189-214. ⟨10.46298/dmtcs.362⟩. ⟨hal-00961109⟩

Collections

CNRS UVSQ TDS-MACS
125 Consultations
1294 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More