The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

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.
Fichier principal
Vignette du fichier
dmAH0128.pdf (279.24 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184774 , version 1 (17-08-2015)

Identifiers

Cite

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, ⟨10.46298/dmtcs.3526⟩. ⟨hal-01184774⟩

Collections

INSMI TDS-MACS
238 View
450 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More