Distributional asymptotics in the analysis of algorithms: Periodicities and discretization - 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

Distributional asymptotics in the analysis of algorithms: Periodicities and discretization

Abstract

It is well known that many distributions that arise in the analysis of algorithms have an asymptotically fluctuating behaviour in the sense that we do not have 'full' convergence, but only convergence along suitable subsequences as the size of the input to the algorithm tends to infinity. We are interested in constructions that display such behaviour via an ordinarily convergent background process in the sense that the periodicities arise from this process by deterministic transformations, typically involving discretization as a decisive step. This leads to structural representations of the resulting family of limit distributions along subsequences, which in turn may give access to their properties, such as the tail behaviour (unsuccessful search in digital search trees) or the dependence on parameters of the algorithm (success probability in a selection algorithm).
Fichier principal
Vignette du fichier
dmAH0134.pdf (197.7 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

Rudolf Grübel. Distributional asymptotics in the analysis of algorithms: Periodicities and discretization. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.497-510, ⟨10.46298/dmtcs.3528⟩. ⟨hal-01184776⟩

Collections

INSMI TDS-MACS
64 View
441 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More