2013
DOI: 10.14490/jjss.43.17
|View full text |Cite
|
Sign up to set email alerts
|

Edgeworth Expansions for the Number of Distinct Components Associated with the Ewens Sampling Formula

Abstract: The Ewens sampling formula is well-known as a distribution of a random partition of the positive integer n. For the number of distinct components of the Ewens sampling formula, we derive its Edgeworth expansion. It is different from the Edgeworth expansion for the sum of independent and identically distributed random variables. It contains the digamma function of the parameter of the Ewens sampling formula. Especially, for the random permutation, the Edgeworth expansion contains Euler's constant. The Edgeworth… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…In this case, the left-hand side of (18) is approximately equal to (K n − θ(log n − ψ(θ)))/(θ (log n − ψ(θ ))) 1/2 . Yamato [8] showed that the approximation accuracy of this statistic is better than (11) when θ is a constant, which corresponds to β = 0.…”
Section: Remarkmentioning
confidence: 99%
“…In this case, the left-hand side of (18) is approximately equal to (K n − θ(log n − ψ(θ)))/(θ (log n − ψ(θ ))) 1/2 . Yamato [8] showed that the approximation accuracy of this statistic is better than (11) when θ is a constant, which corresponds to β = 0.…”
Section: Remarkmentioning
confidence: 99%
“…as n → ∞. Moreover, Yamato (2013) showed the approximation for K n by a Poisson variable with the approximate mean: For fixed θ > 0,…”
Section: Organizationmentioning
confidence: 99%
“…Later, in order to improve the approximation accuracy, Yamato (2013) provided the following CLT which adopts another standardization: For…”
Section: Organizationmentioning
confidence: 99%
See 1 more Smart Citation
“…In particular, when θ = 1 Goncharov (1944) proved that Fn,1 (x) → Φ(x) for any x ∈ R. From a theoretical perspective, it is important to derive error bounds for the approximation. Yamato (2013) discussed the first-order Edgeworth expansion of Fn,θ (•) via the Poisson approximation (Arratia and Tavaré, 1992, Remark after Theorem 3) and proved that Fn,θ Kabluchko, Marynych and Sulzbach (2016) derived the Edgeworth expansion of the probability function of K, and provided the firstorder Edgeworth expansion of Fn,θ (•).…”
Section: Introductionmentioning
confidence: 99%