Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184774
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:59:03 PM
Last modification on : Friday, April 12, 2019 - 2:26:48 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:15:27 PM

File

dmAH0128.pdf
Publisher files allowed on an open archive

Identifiers

  • 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. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.403-422. ⟨hal-01184774⟩

Share

Metrics

Record views

325

Files downloads

683