Central Limit Theorem for Multiplicative Class Functions on the Symmetric Group
نویسندگان
چکیده
منابع مشابه
A Central Limit Theorem for Belief Functions
The purpose of this Note is to prove a form of CLT (Theorem 1.4) that is used in Epstein and Seo (2011). More general central limit results and other applications will follow in later drafts. Let S = fB;Ng and K (S) = ffBg; fNg; fB;Ngg the set of nonempty subsets of S. Denote by s1 = (s1; s2; :::) the generic element of S1 and by n (s1) the empirical frequency of the outcome B in the rst n exp...
متن کاملCesàro summation and multiplicative functions on a symmetric group
σ = κ1κ2...κω this decomposition is unique up to the order of the multiplicands. We will call a function f : Sn → C multiplicative if f(σ) = f(κ1)f(κ2)...f(κn). In what follows we will assume that the value of f on cycles depends only on the length of cycle, that is f(κ) = f̂(|κ|), where |κ| the order of cycle κ. Let mk(σ) be equal to the number of cycles in the decomposition σ whose order is eq...
متن کاملCentral Limit Theorem for a Class of Relativistic Diffusions
Two similar Minkowskian diffusions have been considered, on one hand by Barbachoux, Debbasch, Malik and Rivet ([BDR1], [BDR2], [BDR3], [DMR], [DR]), and on the other hand by Dunkel and Hänggi ([DH1], [DH2]). We address here two questions, asked in [DR] and in ([DH1], [DH2]) respectively, about the asymptotic behaviour of such diffusions. More generally, we establish a central limit theorem for ...
متن کاملA Central Limit Theorem for Iterated Random Functions
A central limit theorem is established for additive functions of a Markov chain that can be constructed as an iterated random function. The result goes beyond earlier work by relaxing the continuity conditions imposed on the additive function, and by relaxing moment conditions related to the random function. It is illustrated by an application to a Markov chain related to fractals.
متن کاملCombable functions , quasimorphisms , and the central limit theorem
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the leftand right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include: (1) homomorphisms to Z; (2) word length with respect to a finite gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2011
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-011-0382-3