Infinite Systems of Functional Equations and Gaussian Limiting Distributions

In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in the generating function of the system tend to a f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AQ,...; H. Proceedings; S. 453 - 478
Hauptverfasser: Drmota, Michael, Gittenberger, Bernhard, Morgenbesser, Johannes F.
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: DMTCS 01.01.2012
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:DMTCS Proceedings
Schlagworte:
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
central limit theorem
Combinatorics
Computational Geometry
Computer Science
Data Structures and Algorithms
Discrete Mathematics
functional equation
generating functions
Mathematics
singularity analysis
singularity analysis
generating functions
central limit theorem
functional equation
ISSN:1365-8050, 1462-7264, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in the generating function of the system tend to a finite or infinite dimensional limiting distribution.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.3012