On Convergence Rates in the Central Limit Theorems for Combinatorial Structures
نویسنده
چکیده
Flajolet and Soria established several central limit theorems for the parameter “number of components” in a wide class of combinatorial structures. In this paper, we shall prove a simple theorem which applies to characterize the convergence rates in their central limit theorems. This theorem is also applicable to arithmetical functions. Moreover, asymptotic expressions are derived for moments of integral order. Many examples from different applications are discussed.
منابع مشابه
ON CONVERGENCE THEOREMS FOR FUZZY HENSTOCK INTEGRALS
The main purpose of this paper is to establish different types of convergence theorems for fuzzy Henstock integrable functions, introduced by Wu and Gong cite{wu:hiff}. In fact, we have proved fuzzy uniform convergence theorem, convergence theorem for fuzzy uniform Henstock integrable functions and fuzzy monotone convergence theorem. Finally, a necessary and sufficient condition under which th...
متن کاملFunctional central limit theorems in L(0, 1) for logarithmic combinatorial assemblies
Functional central limit theorems in L(0, 1) for logarithmic combinatorial assemblies are presented. The random elements argued in this paper are viewed as elements taking values in L(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...
متن کاملPointwise convergence rates and central limit theorems for kernel density estimators in linear processes
Convergence rates and central limit theorems for kernel estimators of the stationary density of a linear process have been obtained under the assumption that the innovation density is smooth (Lipschitz). We show that smoothness is not required. For example, it suffices that the innovation density has bounded variation.
متن کاملLarge Deviations of Combinatorial Distributions I: Central Limit Theorems
We prove a general central limit theorem for probabilities of large deviations for sequences of random variables satisfying certain natural analytic conditions. This theorem has wide applications to combinatorial structures and to the distribution of additive arithmetical functions. The method of proof is an extension of Kubilius’ version of Cramér’s classical method based on analytic moment ge...
متن کاملRates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
Rates of convergence of limit theorems are established for a class of random processes called here quasi-additive smooth Euclidean functionals. Examples include the objective functions of the traveling salesman problem, the Steiner tree problem, the minimumspanning tree problem, the minimumweight matching problem, and a variant of the minimum spanning tree problem with power weighted edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 1998