Bootstrapping and double-exponential limit laws - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Bootstrapping and double-exponential limit laws


We provide a rather general asymptotic scheme for combinatorial parameters that asymptotically follow a discrete double-exponential distribution. It is based on analysing generating functions Gh(z) whose dominant singularities converge to a certain value at an exponential rate. This behaviour is typically found by means of a bootstrapping approach. Our scheme is illustrated by a number of classical and new examples, such as the longest run in words or compositions, patterns in Dyck and Motzkin paths, or the maximum degree in planted plane trees.
Fichier principal
Vignette du fichier
dmtcs-17-1-9.pdf (291.01 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01196869 , version 1 (10-09-2015)



Helmut Prodinger, Stephan Wagner. Bootstrapping and double-exponential limit laws. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.123--144. ⟨10.46298/dmtcs.2125⟩. ⟨hal-01196869⟩


64 View
714 Download



Gmail Facebook X LinkedIn More