A multiplicative inequality for concentration functions of \(n\)-fold convolutions (Q4524733)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1552477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multiplicative inequality for concentration functions of \(n\)-fold convolutions |
scientific article; zbMATH DE number 1552477 |
Statements
23 September 2001
0 references
concentration function
0 references
convolutions oscillator
0 references
0.8751298785209656
0 references
0.8475058078765869
0 references
0.8097767233848572
0 references
0.8020651340484619
0 references
A multiplicative inequality for concentration functions of \(n\)-fold convolutions (English)
0 references
For a distribution \(F\) on the Borel set of the real line, the concentration function \(Q\) is defined by \(Q(F,b)=\sup_x F\{[x,x+b]\}\) for all \(b\geq 0\). The present paper generalizes a result of the authors [J. Theor. Probab. 11, No. 3, 715-731 (1998; Zbl 0936.60014), Theorem 2] on the \(n\)-fold convolution. This generalization consists in the discussion of the concentration function of \(H*F^{n*}\). Special choices of \(H\) yield the interesting results. For the entire collection see [Zbl 0948.00040].
0 references