A general limit theorem for recursive algorithms and combinatorial structures (Q1431560): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:19, 5 March 2024

scientific article
Language Label Description Also known as
English
A general limit theorem for recursive algorithms and combinatorial structures
scientific article

    Statements

    A general limit theorem for recursive algorithms and combinatorial structures (English)
    0 references
    0 references
    0 references
    10 June 2004
    0 references
    Limit laws of vector-valued recursive equations \(X_n=\sum_{r=1} A_n^r X_{I_r^n}^r+b_n^n\) are proved via the contraction method. The Zolotarev \(\xi_s\)-metric provides under suitable conditions a limit law \(X\) of \(X_n\). In contrary to Mallows \(\ell_P\)-metrics the Zolotarev metrics include the normal law as limit law and also limit laws, when the accompanying stochastic fixed point equation is degenerate. This is achieved by an accompanying sequence of rvs satisfying approximately the recursion. The Zolotarev metric allows also local limit laws. Many examples show the strength of this approach.
    0 references
    contraction method
    0 references
    multivariate limit law
    0 references
    recursive structure
    0 references
    divide-and-conquer algorithm
    0 references
    Zolotarev metric
    0 references
    0 references

    Identifiers