Functional central limit theorems in L2(0, 1) for logarithmic combinatorial assemblies

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Functional central limit theorems in L2(0, 1) for logarithmic combinatorial assemblies are presented. The random elements argued in this paper are viewed as elements taking values in L2(0, 1) whereas the Skorokhod space is argued as a framework of weak convergences in functional central limit theorems for random combinatorial structures in the literature. It enables us to treat other standardized random processes which converge weakly to a corresponding Gaussian process with additional assumptions.

Original languageEnglish
Pages (from-to)1033-1052
Number of pages20
JournalBernoulli
Volume24
Issue number2
DOIs
Publication statusPublished - May 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Statistics and Probability

Fingerprint Dive into the research topics of 'Functional central limit theorems in L<sup>2</sup>(0, 1) for logarithmic combinatorial assemblies'. Together they form a unique fingerprint.

Cite this