A fixed point theorem for distributions (Q1194594): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5674726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some asymptotic theory for the bootstrap / rank
 
Normal rank
Property / cites work
 
Property / cites work: A moment estimate for rank statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential bounds for the running time of a selection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Recursive Constructions: Asymptotic Geometric and Topological Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for “quicksort” / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of Quicksort programs / rank
 
Normal rank

Latest revision as of 13:28, 16 May 2024

scientific article
Language Label Description Also known as
English
A fixed point theorem for distributions
scientific article

    Statements

    A fixed point theorem for distributions (English)
    0 references
    4 October 1992
    0 references
    The author studies, in a systematic form, the contractive behavior of the map \(S\) of distributions to distributions \(S(F)\overset{\mathcal D}=\sum_ i T_ i X_ i+C\), \((C,T=(T_ 1,T_ 2,\dots))\), \(X_ i\) are independent random variables with distribution function \(F\). Further the author obtains the higher and exponential moments of the fixed point. Applications of this structure are given for (a) weighted branching processes, (b) the Hausdorff dimension of random Cantor set, and (c) the Quicksort algorithm.
    0 references
    contractive behavior
    0 references
    exponential moments
    0 references
    weighted branching processes
    0 references
    Hausdorff dimension
    0 references
    random Cantor set
    0 references
    Quicksort algorithm
    0 references
    0 references
    0 references

    Identifiers