Abstract

Functional central limit theorems in $L^{2}(0,1)$ for logarithmic combinatorial assemblies are presented. The random elements argued in this paper are viewed as elements taking values in $L^{2}(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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call