The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern

Abstract : In our previous work [paper1], we derived an asymptotic expression for the probability that a random decomposable combinatorial structure of size n in the \exp -\log class has a given restricted pattern. In this paper, under similar conditions, we provide the probability that a random decomposable combinatorial structure has a given restricted pattern and the size of its rth smallest component is bigger than k, for r,k given integers. Our studies apply to labeled and unlabeled structures. We also give several concrete examples.
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.403-422, 2007, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184774
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 16:59:03
Dernière modification le : mercredi 20 décembre 2017 - 14:48:02
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:15:27

Fichier

dmAH0128.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184774, version 1

Collections

Citation

Lihua Dong, Zhicheng Gao, Daniel Panario. The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.403-422, 2007, DMTCS Proceedings. 〈hal-01184774〉

Partager

Métriques

Consultations de la notice

65

Téléchargements de fichiers

172