Next Article in Journal
Refined Iterative Method for a Common Variational Inclusion and Common Fixed-Point Problem with Practical Applications
Next Article in Special Issue
Sharp Second-Order Hankel Determinants Bounds for Alpha-Convex Functions Connected with Modified Sigmoid Functions
Previous Article in Journal
Intuitionistic Implication and Logics of Formal Inconsistency
Previous Article in Special Issue
A Variational Theory for Biunivalent Holomorphic Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Arbitrary Random Variables and Wiman’s Inequality

1
Faculty of Mechanics and Mathematics, Ivan Franko National University of Lviv, 79000 Lviv, Ukraine
2
Department of Physics and Mathematics, Ivano-Frankivsk National Technical University of Oil and Gas, 76019 Ivano-Frankivsk, Ukraine
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2024, 13(11), 739; https://doi.org/10.3390/axioms13110739
Submission received: 8 October 2024 / Revised: 26 October 2024 / Accepted: 26 October 2024 / Published: 29 October 2024
(This article belongs to the Special Issue Recent Advances in Complex Analysis and Related Topics)

Abstract

:
We study the class of random entire functions given by power series, in which the coefficients are formed as the product of an arbitrary sequence of complex numbers and two sequences of random variables. One of them is the Rademacher sequence, and the other is an arbitrary complex-valued sequence from the class of sequences of random variables, determined by a certain restriction on the growth of absolute moments of a fixed degree from the maximum of the module of each finite subset of random variables. In the paper we prove sharp Wiman–Valiron’s type inequality for such random entire functions, which for given p ( 0 ; 1 ) holds with a probability p outside some set of finite logarithmic measure. We also considered another class of random entire functions given by power series with coefficients, which, as above, are pairwise products of the elements of an arbitrary sequence of complex numbers and a sequence of complex-valued random variables described above. In this case, similar new statements about not improvable inequalities are also obtained.

1. Introduction

Let us consider an entire functions of the form
f ( z ) = n = 0 a n z n .
Denote
M f ( r ) = max { | f ( z ) | : | z | = r } , μ f ( r ) = max { | a n | r n : n 0 } , ν f ( r ) = max { n : | a n | r n = μ f ( r ) } , r > 0 ,
as the maximum modulus, the maximal term, and central index of series (1), respectively.
The following Wiman–Valiron theorem is well known [1,2].
Theorem 1
([1,2]). For every non-constant entire function f ( z ) of form (1) and any ε > 0 there exists a set E = E ( f ) ( 1 , + ) of finite logarithmic measure, i.e.,
E d ( ln r ) < + ,
such that for all r ( 1 ; + ) E f ( ε ) we have
M f ( r ) μ f ( r ) ln 1 / 2 + ε μ f ( r ) .
Note that the constant 1 / 2 in the inequality (2) cannot be replaced in general by a smaller number. Indeed, for the entire function f ( z ) = e z we have ([3], p. 177)
lim r + M f ( r ) μ f ( r ) ln μ f ( r ) = 2 π .
Furthermore, from results proved in [4] for entire Dirichlet series it follows that there exists entire function g ( z ) of the form (1) such that
lim r + M g ( r ) μ g ( r ) ln μ g ( r ) = + .
Therefore, inequality (2) is sharp in the class of non-constant entire functions. However, this inequality can be improved in some subclasses of entire functions, i.e., in the subclasses of:
(1)
Entire functions of finite order ([3,5,6]);
(2)
Entire function, which can be represented by gap power series ([7,8]);
(3)
Random entire functions ([9,10,11,12,13]).
In this paper, we consider only random entire functions.
Let ( Ω , A , P ) be the probability space, which allows the existence of a uniform distribution on it, where A is the σ -algebra of subsets of Ω , P is the probability measure on A . In the paper, the notion “almost surely” will be used in the sense that the corresponding property holds almost everywhere with respect to the measure P on A . We say that some relation holds almost surely if it holds for each analytic function f ( z , ω ) from some class of almost surely in ω .
Let R n ( ω ) be the Rademacher sequence, which is a sequence of independent random variables defined on the Steinhaus probability space ( Ω , A , P ) . For any n Z + , we have
P { ω : R n ( ω ) = 1 } = P { ω : R n ( ω ) = 1 } = 1 2 .
Firstly, we consider random entire function of the form
f ( z , ω ) = n = 0 R n ( ω ) a n z n .
From the results proved in [11], the following theorem can be established.
Theorem 2.
For f ( z , ω ) of the form (4) and any ε > 0 , there almost surely exists a set
E : = E ( ε , ω , f ) [ 1 ; + )
of finite logarithmic measure such that for all r [ 1 ; + ) E we have
M f ( r , ω ) : = max { | f ( z , ω ) | : | z | = r } μ f ( r ) ln 1 / 4 μ f ( r ) ( ln ln μ f ( r ) ) 1 + ε .
From the results proved in ([14], p. 45), the following statement can be derived. For the random entire function
f ( z , ω ) = n = 0 R n ( ω ) z n n !
we have, almost surely,
lim r + M f ( r , ω ) μ f ( r ) ln μ f ( r ) 4 π 8 .
Furthermore, from results proved in [4], it follows that there exists a random entire function g ( z ) of the form (4) such that
lim r + M g ( r , ω ) μ g ( r ) ln μ g ( r ) 4 = + .
Wiman’s inequality for the most general class of random entire functions was established in [8]. Let { Z n ( ω ) } be a sequence of real, independent, centered sub-Gaussian random variables, that is for any n Z + , we have E ( Z n ) = 0 , and there exist a constant C 1 > 0 such that for any t [ 0 ; + ) ,
P { ω : | Z n ( ω ) | t } 2 exp ( t 2 C 1 ) .
Also, for such random variables (see [15]), there exists D > 0 such that for any k N and all λ 0 R we have
E ( e λ 0 Z k ) e D λ 0 2 .
We denote the class of such random variables by Ξ .
For { Z n ( ω ) } Ξ we have ([15], p. 81 [Exercise 7.8]) for any k N : E ( Z k ) = 0 and
sup k N E ( Z k 2 ) = sup k N D ( Z k ) 2 D ,
where D ( Z k ) : = E ( Z k 2 ) ( E Z k ) 2 is the variance of random variable Z k .
From statement established in [8], the following result can be derived (specifically for the case when ρ = 1 ).
Theorem 3
([8]). Let Z Ξ , ε > 0 and
f ( z , ω ) = n = 0 Z n ( ω ) a n z n .
Then there exists a set E ( ε ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) , + ) E , almost surely
M f ( r , ω ) μ f ( r ) ln 1 / 4 μ f ( r ) ( ln ln μ f ( r ) ) 3 / 2 + ε .
Also in [8], there was constructed an example of random entire function of the form (6), from which it follows necessity of boundedness of sequence { D ( Z n ) } .
Theorem 4
([8]). For any α > 0 there exist a sequence of real independent random variables satisfying for all n Z +
E Z n = 0 , sup n D Z n = + ,
with the entire function f ( z ) of the form (6) and a constant C > 0 such that almost surely
M f ( r , ω ) C μ f ( r ) ln 1 / 4 + α μ f ( r ) , r > r 0 ( ω ) .
It is worth noting that in the statements about random entire functions mentioned above (such as Theorem 1 from [7] and similar results), the expectation of the random variables is zero. In light of this, Professor M. M. Sheremeta, in 1996 asked whether it is possible to derive a sharper Wiman’s inequality for classes of random entire functions of the form
f ( z , ω ) = n = 0 Z n ( ω ) a n z n ,
where E ( Z n ) = α 0 for k 0 . One can find a negative answer to this question in [9].
Let Δ be the class of uniformly bounded real sequences { X n ( ω ) } such that
E ( X i 1 X i 2 X i k ) = E ( X i 1 ) E ( X i 2 ) · · E ( X i k )
for any i 1 < i 2 < < i k , i N .
Theorem 5
([9]). If { Re Z n ( ω ) } Δ , { Im Z n ( ω ) } Δ and | E Z n |   O ( n α ) , n + ,   α [ 0 ; 1 / 4 ] , then for any ε > 0 and f ( z , ω ) of the form (6) there exists a set E ( ε , ω ) of finite logarithmic measure, such that for all r ( 1 ; + ) E , almost surely,
M f ( r , ω ) μ f ( r ) ln 1 / 2 α μ f ( r ) ( ln ln μ f ( r ) ) 1 + ε .
The sharpness of inequality (7) follows from the next statement.
Theorem 6
([9]). For any sequence { Z n ( ω ) } such that { Re Z n ( ω ) } Δ , { Im Z n ( ω ) } Δ and | E Z n |   C n α , n + , α [ 0 ; 1 / 4 ) , then there exists a function f ( z , ω ) of the form (6) such that, almost surely,
M f ( r , ω ) C 8 μ f ( r ) ln 1 / 2 α μ f ( r ) , r > r 0 ( ω ) .
Remark that in all statements about random entire functions cited above, the inequalities were proved only with probability equal to 1 (almost surely) and only for sequences of random variables which are independent and sub-Gaussian.
The following questions also arise in this regard: are we able to obtain sharp estimates of maximum modulus of random entire functions:
(a) 
with probability p ( 0 ; 1 ) ;
(b) 
in the cases when the sequence { Z n ( ω ) } :
(1) 
is not sub-Gaussian;
(2) 
may not be independent.
In this paper, we provide an answer to all these questions.

2. Additional Notations and Definitions

For two positive functions φ ( N ) and ψ ( N ) , the relation φ ( N ) ψ ( N ) , as N + , signifies the asymptotic equivalence of the functions up to constant factors. Specifically,
φ ( N ) ψ ( N ) , N + ,
which means that there exist positive constants c , C such that the inequality
c φ ( N ) ψ ( N ) C φ ( N )
holds for sufficiently large N.
Let us consider the random entire functions of the form
f ( z , ω ) = f ( z , ω 1 , ω 2 ) = n = 0 R n ( ω 1 ) ξ n ( ω 2 ) a n z n ,
where
a n C : # { n : a n 0 } = + , lim n + | a n | n = 0 ,
R n ( ω ) is the Rademacher sequence, and ξ n ( ω ) is a sequence of complex-valued random variables (denote by Δ φ ) such that there exist a constant β > 0 and a function
φ ( N , β ) : N × R + [ 1 ; + )
non-decreasing by N and β such that
( E ( max 0 n N | ξ n | β ) ) 1 / β φ ( N , β ) , N + ,
α = lim ¯ N + ln φ ( N , β ) ln N < + .
We denote such a class of random entire functions with E ( φ , β ) .
Remark that for any sequence ξ n ( ω ) function
ψ ( N , β ) = ( E ( max 0 n N | ξ n | β ) ) 1 / β
is non-decreasing by N and β because
max 0 n N | ξ n ( ω ) | β max 0 n N + 1 | ξ n ( ω ) | β
and by Lyapunov’s inequality for 0 < β 1 < β 2 we have
( E ( max 0 n N | ξ n | β 1 ) ) 1 / β 1 ( E ( max 0 n N | ξ n | β 2 ) ) 1 / β 2 .
Also, the class of random entire functions of the form
f ( z , ω ) = n = 0 ξ n ( ω ) a n z n
is denoted by E 1 ( φ , β ) .
In this paper, we will use the following notations.
N = { 1 , 2 , } , Z + = N { 0 } , R = ( , + ) , R + = ( 0 ; + ) , C = { z = x + i y : x , y R } , N ( r ) = min { n 0 ln μ f ( r ) : ( n n 0 ) | a n | r n < 1 } , ln 2 x = ln ln x , N ε ( r ) = N ( r e ε ) = min { n 0 ln μ f ( r e ε ) : ( n n 0 ) | a n | r n e n ε < 1 } = = min { n 0 ln μ f ( r e ε ) : ( n n 0 ) | a n | r n < e n ε } , ε = 1 N γ ( r ) , γ > 0 , W N ( r , ω ) = W N ( r , ω 1 , ω 2 ) = n = N ε ( r ) | R n ( ω 1 ) | | ξ n ( ω 2 ) | | a n | r n .

3. Auxiliary Statements

We need the following statement about upper and lower bound of N ( r ) .
Lemma 1
([8]). For any δ > 0 there exists a set E ( δ ) ( 1 ; + ) of finite logarithmic measure such that for all r ( 1 ; + ) E , we have
ln μ f ( r ) N ( r ) ln μ f ( r ) ( ln 2 μ f ( r ) ) 1 + δ , N ( r ) N ε ( r ) ( 1 + γ ) N ( r ) .
In order to obtain estimates, which hold outside some exception set, the next lemma is useful.
Lemma 2
([9]). Let l ( r ) be a continuous increasing to + function on ( 1 ; + ) , E ( 1 ; + ) be a set such that its complement contains an unbounded open set. Then, there is an infinite sequence 1 < r 1 . . . r n + ( n + ) such that
(1) 
( n N ) : r n E ;
(2) 
( n N ) : ln l ( r n ) n 2 ;
(3) 
if ( r n ; r n + 1 ) E ( r n , r n + 1 ) , then l ( r n + 1 ) e l ( r n ) ;
(4) 
the set of indices, for which (3) holds, is unbounded.
The following lemma is about the upper bound of W N ( r , ω ) for random entire functions from the class E ( φ , β ) .
Lemma 3.
Let f E ( φ , β ) . For any δ > 0 there exist r 0 ( ω ) > 0 , a set E ( δ ) ( 1 ; + ) of finite logarithmic measure such that for all r ( r 0 ( ω ) ; + ) E , one has
W N ( r , ω ) < ( ln μ f ( r ) ) α + 1 + ( 2 + δ ) / β .
Proof. 
For n N ε ( r ) denote B n = { ω : | ξ n ( ω ) | β n α β + 2 + δ 1 } , δ 1 > 0 . Using Markov’s inequality and (9), we can estimate probabilities of these events. So, for some C 1 > 0 we have
P ( B n ) = P { ω : | ξ n ( ω ) | β n α β + 2 + δ 1 } E | ξ n | β n α β + 2 + δ 1 1 n α β + 2 + δ 1 E ( max 0 k n | ξ k | β ) C 1 φ β ( n , β ) n α β + 2 + δ 1 , r + .
So,
n = N ε ( r ) P ( B n ) C 1 n = N ε ( r ) φ β ( n , β ) n α β + 2 + δ 1 C 1 n = N ε ( r ) 1 n 2 + δ 1 / 2 1 N ε 1 + δ 1 / 3 ( r ) , r + .
Let
B = n = N ε ( r ) B n .
Then, P ( B ) N ε 1 δ 1 / 3 ( r ) , r + . For ω B , we get
W N ( r , ω ) = n = N ε ( r ) | R n ( ω 1 ) | | ξ n ( ω 2 ) | | a n | r n n = N ε ( r ) n α + ( 2 + δ 1 ) / β e n ε C 2 ( N ε ( r ) ) α + 1 + ( 2 + δ 1 ) / β ( ln μ f ( r ) ) α + 1 + ( 2 + 2 δ 1 ) / β , r + , ( r E ) .
Therefore, for r + we obtain
P { ω : n = N ε ( r ) | R n ( ω 1 ) | | ξ n ( ω 2 ) | | a n | r n ( ln μ f ( r ) ) α + 1 + ( 2 + 2 δ 1 ) / β } 1 N ε 1 + δ 1 / 3 ( r ) .
Let us choose l ( r ) = μ f ( r ) , a set E and a sequence { r k } from Lemma 2. Define
F k = { ω : W N ( r k , ω ) ( ln μ f ( r k ) ) α + 1 + ( 2 + 2 δ 1 ) / β } .
By the definition of N ε ( r ) we get
k = 1 P ( F k ) k = 1 1 N ε 1 + δ 1 / 3 ( r k ) k = 1 1 ln 1 + δ 1 / 3 μ f ( r k ) k = 1 1 k 1 + δ 1 / 3 < + .
Then, by the Borel–Cantelli Lemma for almost all ω [ 0 , 1 ] for k k 0 ( ω ) , we obtain
W N ( r k , ω ) < ( ln μ f ( r k ) ) α + 1 + ( 2 + 2 δ 1 ) / β .
Let r r k 0 ( ω ) be an arbitrary number outside the set E , r ( r p , r p + 1 ) . By Lemma 2
μ f ( r p + 1 ) e μ f ( r p ) e μ f ( r ) .
Therefore, for almost all ω [ 0 ; 1 ] and r r 0 ( ω ) outside of a set of finite logarithmic measure E we have
W N ( r , ω ) < W N ( r p + 1 , ω ) < ( ln μ f ( r p + 1 ) ) α + 1 + ( 2 + 2 δ 1 ) / β ( ln ( e μ f ( r ) ) ) α + 1 + ( 2 + 2 δ 1 ) / β ( ln μ f ( r ) ) α + 1 + ( 2 + 3 δ 1 ) / β .
It remains to choose δ = 3 δ 1 .

4. Main Results

We derive sharp asymptotic estimates for the maximum modulus of functions f E ( φ , β ) . In this case, the elements of a sequence ξ n ( ω ) may not be sub-Gaussian and could be dependent. The main result of this paper is stated in the following theorem.
Theorem 7.
Let δ > 0 . For f E ( φ , β ) , there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) · ln 1 / 4 + δ μ f ( r ) 1 p · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) .
Remark that the exponent 1 / 4 and the degree 1 of function φ cannot be replaced simultaneously by smaller numbers. This follows from the next theorem.
Theorem 8.
For any non-decreasing function φ ( N , β ) in N and β that satisfies condition (10), there exist a sequence of random variables ξ n ( ω ) Δ φ , an entire function f E ( φ , β ) , and a constant c ( 0 ; 1 ) such that, almost surely,
M f ( r , ω ) μ f ( r ) φ ( c ln μ f ( r ) ln 2 μ f ( r ) , β ) · ln 1 / 4 { μ f ( r ) φ ( c ln μ f ( r ) ln 2 μ f ( r ) , β ) } , r + .
Also, we derive sharp asymptotic estimates for the maximum modulus of functions f E 1 ( φ , β ) . In this case, the elements of a sequence ξ n ( ω ) may be dependent or not centered.
Theorem 9.
Let δ > 0 . For f E 1 ( φ , β ) , there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) · ln 1 / 2 + δ μ f ( r ) 1 p · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) .
Remark that exponent 1 / 2 and the degree 1 of function φ cannot be simultaneously replaced by smaller numbers.
Theorem 10.
For any non-decreasing function φ ( N , β ) in N and β that satisfies condition (10), there exist a sequence of random variables ξ n ( ω ) Δ φ , an entire function f E 1 ( φ , β ) and a constant c ( 0 ; 1 ) such that for all ω [ 0 ; 1 ]
M f ( r , ω ) μ f ( r ) φ ( c ln μ f ( r ) ln 2 μ f ( r ) , β ) · ln 1 / 2 { μ f ( r ) φ ( c ln μ f ( r ) ln 2 μ f ( r ) , β ) } , r + .
Proof of Theorem 7.
By Theorem 2, ω -almost surely there exists a set E : = E ( ε , ω , f ) [ 1 ; + ) of finite logarithmic measure such that for all r [ 1 ; + ) E we have
M f ( r , ω ) = M f ( r , ω 1 , ω 2 ) μ f ( r , ω 2 ) ln 1 / 4 + δ μ f ( r , ω 2 ) .
Then by Lemma 3 we get
μ f ( r , ω 2 ) max max 0 n N ε ( r ) | ξ n ( ω 2 ) | | a n | r n ; max N ε ( r ) < n < + | ξ n ( ω 2 ) | | a n | r n max max 0 n N ε ( r ) | ξ n ( ω 2 ) | · μ f ( r ) ; ( ln μ f ( r ) ) α + 1 + ( 2 + δ ) / β = = max η ( ω 2 ) μ f ( r ) ; ( ln μ f ( r ) ) α + 1 + ( 2 + δ ) / β , r + , ( r E ) ,
where
η ( ω 2 ) = max 0 n N ε ( r ) | ξ n ( ω 2 ) |
is the non-negative random variable. Then, by Markov’s inequality, we obtain
P { ω : η β ( ω ) < E η β 1 p } p , P { ω : η ( ω ) < ( E η β 1 p ) 1 / β } p .
Remark that there exist δ > 0 , C > 0 , a set E [ 1 ; + ) of finite logarithmic measure such that for all r [ 1 ; + ) E with probability p ( 0 ; 1 ) , we have
( E η β ) 1 / β C φ ( N ε , β ) < C φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) , μ f ( r , ω 2 ) max { C ( E η β 1 p ) 1 / β μ f ( r ) ; ( ln μ f ( r ) ) α + 1 + ( 2 + δ ) / β } max C μ f ( r ) ( 1 p ) 1 / β φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) ; ( ln μ f ( r ) ) α + 1 + ( 2 + δ ) / β = = C μ f ( r ) ( 1 p ) 1 / β φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) .
Finally, for r E with probability p we get
M f ( r , ω ) μ f ( r , ω 2 ) ln 1 / 4 + δ μ f ( r , ω 2 ) μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) · ln 1 / 4 + 2 δ μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) ,
or more precisely
M f ( r , ω ) μ f ( r , ω 2 ) ln 1 / 4 μ f ( r , ω 2 ) ln 2 1 + δ μ f ( r , ω 2 ) μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) · ln 1 / 4 μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) × × ln 2 1 + 2 δ μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) .
Proof of Theorem 8.
Let φ ( n , β ) be a non-decreasing function by n and β , for which (10) holds. Suppose that
ξ n ( ω 2 ) = φ ( n , β ) , f ( z ) = n = 0 z n φ ( n , β ) · n ! , g ( z ) = e z = n = 0 z n n ! , h ( z ) = e ε z , ε > 0 .
Remark that
( E ( max 0 n N | ξ n | β ) ) 1 / β = ( E ( max 0 n N ( φ ( n , β ) ) β ) ) 1 / β = ( ( φ ( N , β ) ) β ) 1 / β = φ ( N , β ) .
Then
f ( z , ω ) = n = 0 R n ( ω 1 ) ξ n ( ω 2 ) z n φ ( n , β ) · n ! = n = 0 R n ( ω 1 ) z n n ! = g ( z , ω 1 ) , M f ( r , ω ) = M g ( r , ω 1 ) , μ g ( r ) = max n Z + r n n ! = max n Z + { φ ( n , β ) r n φ ( n , β ) · n ! } φ ( ν f ( r ) , β ) μ f ( r ) .
It follows from (10) that there exists ε ( 0 ; 1 ) such that we have
φ ( n , β ) ( 1 ε ) n , max n Z + r n φ ( n , β ) · n ! max n Z + ( ε r ) n n ! , ln μ f ( r ) ln μ h ( r ) = ln μ g ( ε r ) ε r ln ( ε r ) ε 2 r , ln μ f ( r ) ln μ f ( 1 ) = 1 r ν f ( t ) t d t ν f ( r ) 1 r d t t = ν f ( r ) ln r , ln μ f ( r ) ln μ f ( 1 ) ν f ( r ) ln r , ν f ( r ) ln μ f ( r ) ln μ f ( 1 ) ln r 1 2 · ln μ f ( r ) ln r ε 4 · r ln r , ln μ f ( r ) ln 2 μ f ( r ) ln μ g ( r ) ln 2 μ g ( r ) ln M g ( r ) ln 2 M g ( r ) = r ln r 4 ν f ( r ) ε , ν f ( r ) ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , r + .
Therefore, by inequality (5) we get ω -almost surely
M f ( r , ω ) = M g ( r , ω 1 ) π 3 μ g ( r ) ln 1 / 4 μ g ( r ) π 3 φ ( ν f ( r ) , β ) μ f ( r ) ln 1 / 4 ( φ ( ν f ( r ) , β ) μ f ( r ) ) π 3 φ ( ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , β ) μ f ( r ) ln 1 / 4 ( φ ( ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , β ) μ f ( r ) ) , r + .
Proof of Theorem 9.
By Theorem 1, there exists a set E : = E ( ε , f ) [ 1 ; + ) of finite logarithmic measure such that for all r [ 1 ; + ) E and for almost all ω [ 0 ; 1 ] , we have
M f ( r , ω ) μ f ( r , ω ) ln 1 / 2 + δ μ f ( r , ω ) .
Finally, using (11) for r E with probability p we obtain
M f ( r , ω ) μ f ( r , ω 2 ) ln 1 / 2 + δ μ f ( r , ω 2 ) μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) · ln 1 / 2 + δ μ f ( r ) ( 1 p ) 1 / β · φ ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) , β ) .
Proof of Theorem 10.
Let φ ( n , β ) be a function which satisfies (10) and does not decrease by n and β .
Suppose that
ξ n ( ω ) = φ ( n , β ) , f ( z ) = n = 0 z n φ ( n , β ) · n ! , g ( z ) = e z = n = 0 z n n ! .
Then
f ( z , ω ) = n = 0 ξ n ( ω ) z n φ ( n , β ) · n ! = n = 0 z n n ! = g ( z ) , M f ( r , ω ) = M g ( r ) .
As in proof of Theorem 8, for some ε > 0 , we get
μ g ( r ) φ ( ν f ( r ) , β ) μ f ( r ) , ν f ( r ) ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , r + .
Therefore, by inequality (3) for r + we have for all ω [ 0 ; 1 ]
M f ( r , ω ) = M g ( r ) π μ g ( r ) ln 1 / 2 μ g ( r ) π φ ( ν f ( r ) , β ) μ f ( r ) ln 1 / 2 ( φ ( ν f ( r ) , β ) μ f ( r ) ) π φ ( ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , β ) μ f ( r ) ln 1 / 2 ( φ ( ε 4 · ln μ f ( r ) ln 2 μ f ( r ) , β ) μ f ( r ) ) .

5. Some Corollaries

First, we consider the case of sequence ξ n ( ω ) is an almost surely bounded, i.e., for almost all ω [ 0 ; 1 ]
C 0 > 0 : max n N | ξ n ( ω ) | C 0 .
Then, we can choose β = 1 and
φ ( N , 1 ) = E ( max 0 n N | ξ n | ) C 0 .
Corollary 1.
Let δ > 0 and a sequence ξ n ( ω ) be almost surely bounded. Then, for each function f E ( φ , β ) , there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) 1 p · ln 1 / 4 μ f ( r ) 1 p · ln 2 1 + δ μ f ( r ) 1 p .
Let Ξ ρ be the class of random variables ξ n ( ω ) such that there exist a constant C 1 > 0 such that for every n Z + and any t [ 0 ; + ) , we have
P { ω : | ξ n ( ω ) | t } 2 exp ( t ρ C 1 ) , C 1 > 0 , ρ > 0 .
Remark, that if ρ = 2 then Ξ ρ is the class of sub-Gaussian random variables and if ρ = 1 then Ξ ρ is the class of subexponential random variables.
We prove that for any N N
φ ( N , 1 ) = E ( max 1 n N | ξ n | ) C 2 ( ρ , C 1 ) · ( 1 + ln N ) 1 / ρ .
Inequality (14) is sharp in the case of ρ = 2 . Indeed ([16], p. 28) [Ex.2.5.11], in the case of { ξ n ( ω ) } is a sequence of independent real standard Gaussian random variables there exists a constant c 1 > 0 such that
E ( max 1 n N | ξ n | ) c 1 ln N , N + .
We will prove that the degree 1 / ρ in inequality (14) is sharp for the class of random variables Ξ ρ for any ρ > 0 . This follows from such a statement.
Lemma 4.
There exists a sequence { ξ n ( ω ) } Ξ ρ such that for any N N , we have
E ( max 1 n N | ξ n | ) ( 1 1 e ) ( ln N ) 1 / ρ .
Proof. 
Let { ξ n ( ω ) } be a sequence of independent non-negative random variables such that for any n Z + , we have
P { ω : ξ n ( ω ) t } = exp ( t ρ ) , t > 0 .
Then, { ξ n ( ω ) } Ξ ρ . In this case, we have
E ( max 1 n N | ξ n | ) = 0 + P { ω : max 1 n N ξ n ( ω ) t } d t = = 0 + ( 1 P { ω : max 1 n N ξ n ( ω ) < t } ) d t = = 0 + ( 1 n = 1 N P { ω : ξ n ( ω ) < t } ) d t = 0 + ( 1 ( 1 P { ω : ξ 1 ( ω ) t } ) N ) d t = = 0 + ( 1 ( 1 exp ( t ρ ) ) N ) d t .
One can make the substitution t = ( ln N ) 1 / ρ · y . Then, we obtain
E ( max 1 n N | ξ n | ) = 0 + ( 1 ( 1 exp ( y ρ ln N ) ) N ) ( ln N ) 1 / ρ d y ( ln N ) 1 / ρ 0 1 ( 1 ( 1 N y ρ ) N ) d y ( ln N ) 1 / ρ 0 1 ( 1 ( 1 1 N ) N ) d y = = ( 1 ( 1 1 N ) N ) ( ln N ) 1 / ρ ( 1 1 e ) ( ln N ) 1 / ρ .
The following statement holds without the condition of independence of sequence ξ n ( ω ) .
Theorem 11.
Let δ > 0 and ξ n ( ω ) Ξ ρ . Then, for f E ( φ , β ) , there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) 1 p · ln 1 / 4 μ f ( r ) 1 p · ( ln 2 μ f ( r ) 1 p ) 1 + 1 / ρ + δ .
Proof. 
Firstly, we prove (14). Let b = ( 2 C 1 ) 1 / ρ > 0 . Then, using (13) we get
E ( max 1 n N | ξ n | ) ( 1 + ln N ) 1 / ρ = E ( max 1 n N | ξ n | ( 1 + ln N ) 1 / ρ ) E ( max 1 n N | ξ n | ( 1 + ln n ) 1 / ρ ) = = 0 + P { ω : max 1 n N | ξ n ( ω ) | ( 1 + ln n ) 1 / ρ > t } d t = = 0 b P { ω : max 1 n N | ξ n ( ω ) | ( 1 + ln n ) 1 / ρ > t } d t + b + P { ω : max 1 n N | ξ n ( ω ) | ( 1 + ln n ) 1 / ρ > t } d t b + b + n = 1 N P { ω : | ξ n ( ω ) | ( 1 + ln n ) 1 / ρ > t } d t = = b + b + n = 1 N P { ω : | ξ n ( ω ) | > t ( 1 + ln n ) 1 / ρ } d t b + b + n = 1 N 2 exp ( t ρ ( 1 + ln n ) C 1 ) d t = b + b + n = 1 N 2 exp ( t ρ C 1 ) n t ρ / C 1 d t b + 2 n = 1 N b + exp ( t ρ C 1 ) n 2 d t < b + 2 n = 1 1 n 2 · b + exp ( t ρ C 1 ) d t = = ( 2 C 1 ) 1 / ρ + π 3 · ( 2 C 1 ) 1 / ρ + exp ( t ρ C 1 ) d t = C 2 ( ρ ) < + .
Therefore, (14) holds. It continues to use (12). □
Using Lemma 4, we deduce the following statement.
Theorem 12.
There exist a sequence of random variables ξ n ( ω ) Ξ ρ , an entire function f E ( φ , β ) and a constant c ( 0 ; 1 ) such that, almost surely,
M f ( r , ω ) c μ f ( r ) ln 1 / 4 μ f ( r ) ( ln 2 μ f ( r ) 1 / ρ , r + .
Proof. 
By Lemma 4, we can choose β = 1 and φ ( N , 1 ) = ( ln N ) 1 / ρ and by Theorem 8 we get
M f ( r , ω ) μ f ( r ) ln 1 / ρ ( c ln μ f ( r ) ln 2 μ f ( r ) ) · ln 1 / 4 { μ f ( r ) ln 1 / ρ ( c ln μ f ( r ) ln 2 μ f ( r ) ) } c μ f ( r ) ln 1 / 4 μ f ( r ) ( ln 2 μ f ( r ) 1 / ρ , r + .
If ξ n ( ω ) satisfies
a > 0 : sup n N E | ξ n | a < + ,
then we obtain
φ ( N , a ) C 3 ( a ) N 1 / a , C 3 ( a ) > 0 .
Corollary 2.
Let δ > 0 and ξ n ( ω ) satisfies condition (16). Then, for a random entire function f of form (8), there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 / a · ( ln μ f ( r ) 1 p ) 1 / 4 + 1 / a + δ .
Proof. 
Here, we can choose β = a . Then
( E ( max 0 n N | ξ n | a ) ) 1 / a ( E ( n = 0 N | ξ n | a ) ) 1 / a = ( n = 0 N E | ξ n | a ) 1 / a ( N + 1 ) 1 / a ( sup n N E | ξ n | a ) 1 / a C 3 ( a ) N 1 / a , C 3 ( a ) > 0 , N + .
which continues to use Theorem 7. There exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure such that for all r ( r 0 ( ω ) ; + ) E we have with probability p ( 0 ; 1 )
M f ( r , ω ) C ( a ) μ f ( r ) ( 1 p ) 1 / a · ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) ) 1 / a · ln 1 / 4 + δ μ f ( r ) 1 p · ( ln μ f ( r ) ln 2 1 + δ μ f ( r ) ) 1 / a .
Let ξ n ( ω ) be a sequence of independent Pareto distributed random variables with parameter γ > 0 , which is the density function of ξ n ( ω )
f ξ n ( x ) = γ x 1 + γ , x 1 ; 0 , x < 1 .
Corollary 3.
Let δ > 0 and ξ n ( ω ) be Pareto distributed random variables with parameter γ > 0 . Then, for a random entire function f of the form (8), there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we have, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 / δ · ln μ f ( r ) 1 p 1 / 4 + 1 / γ + δ .
Proof. 
It is enough to remark that ξ n ( ω ) satisfies Corollary 2 with a = γ δ for any δ ( 0 ; γ ) .
Remark that exponents 1 / 4 + 1 / a and 1 / 4 + 1 / γ in the inequalities of Corollaries 2 and 3, respectively, cannot be replaced by smaller numbers. This follows from the next statement.
Theorem 13.
Let ξ n ( ω ) be a sequence of independent Pareto distributed random variables with parameter γ > 0 . For any δ > 0 there exist an entire function f E ( φ , β ) and a constant c ( 0 ; 1 ) such that, almost surely,
M f ( r , ω ) c μ f ( r ) ( ln μ f ( r ) ) 1 / 4 + 1 / γ ( ln 2 μ f ( r ) ) 1 / γ μ f ( r ) ( ln μ f ( r ) ) 1 / 4 + 1 / a δ , r + .
Proof. 
Let ξ n ( ω ) be a sequence of independent random variables having a Pareto distribution with parameter γ > 0 . Then, for any β > 0 we get
φ ( N , β ) = N 1 / γ , N + .
Firstly, we calculate expectation
E ( max 1 n N | ξ n | β ) = 1 + x β d ( 1 1 x γ ) N = 1 + x β N ( 1 1 x γ ) N 1 γ x γ + 1 d x = = γ N 1 + ( 1 1 x γ ) N 1 1 x γ β + 1 d x .
One can make the substitution t = 1 x γ . Then
E ( max 1 n N | ξ n | β ) = N 0 1 t N 1 ( 1 t ) β / γ d t = N B ( N , 1 β γ ) = N Γ ( N ) Γ ( 1 β γ ) Γ ( N + 1 β γ ) N Γ ( 1 β γ ) N 1 β γ = Γ ( 1 β γ ) N β γ , N + .
Therefore, φ ( N , β ) = 2 ( Γ ( 1 β γ ) ) 1 / β N 1 / γ . We can choose β = δ .
By Theorem 8, there exist c > 0 and ε > 0 such that we have almost surely
M f ( r , ω ) μ f ( r ) ( c ln μ f ( r ) ln 2 μ f ( r ) ) 1 / γ · ln 1 / 4 { μ f ( r ) ( c ln μ f ( r ) ln 2 μ f ( r ) ) 1 / γ } > > μ f ( r ) ( ln μ f ( r ) ) 1 / γ + 1 / 4 ( ln 2 μ f ( r ) ) 1 / γ , r + .
Also, for any δ 1 ( 0 ; γ ) , we choose a = γ δ 1 . Then, almost surely, one has
M f ( r , ω ) μ f ( r ) ( ln μ f ( r ) ) 1 / γ + 1 / 4 ( ln 2 μ f ( r ) ) 1 / γ μ f ( r ) ( ln μ f ( r ) ) 1 / ( a + δ 1 ) + 1 / 4 ( ln 2 μ f ( r ) ) 1 / ( a + δ 1 ) μ f ( r ) ( ln μ f ( r ) ) 1 / a + 1 / 4 δ , r + ,
where δ > δ 1 a ( a + δ 1 ) .
If ξ n ( ω ) has Cauchy distribution for all n 0 , i.e., density function of ξ n ( ω )
f ξ n ( x ) = 1 π · 1 1 + x 2 , x R ,
we obtain such a statement.
Corollary 4.
Let δ > 0 and ξ n ( ω ) be a sequence of Cauchy distributed random variables. Then, for random entire function f of form (8) there exist r 0 ( ω ) > 0 and a set E ( δ ) ( 1 ; + ) of finite logarithmic measure, such that for all r ( r 0 ( ω ) ; + ) E , we obtain, with probability p ( 0 ; 1 ) ,
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 + δ · ln 5 / 4 + δ μ f ( r ) 1 p .
Proof. 
Let δ 2 ( 0 ; 1 / 3 ) . Remark that
E | ξ n | 1 δ 2 = 2 π 0 + x 1 δ 2 1 + x 2 d x < + .
Therefore, we can choose a = 1 δ 2 in Corollary 2. So, by Corollary 2, there exist r 0 ( ω ) > 0 and a set E ( δ 2 ) ( 1 ; + ) of finite logarithmic measure such that for all r ( r 0 ( ω ) ; + ) E we have with probability p ( 0 ; 1 )
M f ( r , ω ) μ f ( r ) ( 1 p ) 1 / ( 1 δ 2 ) · ln 1 / 4 + 1 / ( 1 δ 2 ) + δ 2 μ f ( r ) 1 p μ f ( r ) ( 1 p ) 1 + 2 δ 2 · ln 5 / 4 + 3 δ 2 μ f ( r ) 1 p .
It continues to choose δ = 3 δ 2 .
Remark, that exponent 5 / 4 in Corollary 4 cannot be replaced by smaller number. This follows from the next statement.
Theorem 14.
Let ξ n ( ω ) be a sequence of independent Cauchy distributed random variables. There exist an entire function f E ( φ , β ) and a constant c ( 0 ; 1 ) such that, almost surely,
M f ( r , ω ) c μ f ( r ) ln 5 / 4 μ f ( r ) ln 2 μ f ( r ) , r + .
Proof. 
Firstly, we remark that for β < 1
E ( max 1 n N | ξ n | β ) = 0 + x β d ( 2 π arctan x ) N = = 0 + x β N ( 2 π arctan x ) N 1 2 π ( 1 + x 2 ) d x 2 N π 0 + x β 1 + x 2 d x = C 1 ( β ) N .
On the other hand, one has
E ( max 1 n N | ξ n | β ) > 1 + x β d ( 2 π arctan x ) N = 1 + x β N ( 2 π arctan x ) N 1 1 π ( 1 + x 2 ) d x 1 2 π 1 + x β N ( 1 1 x ) N 1 1 x 2 d x = N 2 π 1 + ( 1 1 x ) N 1 1 x 2 β d x .
Now, one can make the substitution t = 1 x 1 . Then
E ( max 1 n N | ξ n | β ) N 2 π 0 1 t N 1 ( 1 t ) β d t = N 2 π B ( N , 1 β ) = N 2 π · Γ ( N ) Γ ( 1 β ) Γ ( N + 1 β ) N 2 π · Γ ( 1 β ) N 1 β = Γ ( 1 β ) 2 π N β , φ ( N , β ) C 2 ( β ) N , N + .
It continues to use Theorem 8. Then, there exist an entire function f E ( φ , β ) and constant c ( 0 ; 1 ) such that we have, almost surely,
M f ( r , ω ) μ f ( r ) c ln μ f ( r ) ln 2 μ f ( r ) · ln 1 / 4 { μ f ( r ) c ln μ f ( r ) ln 2 μ f ( r ) } c 2 μ f ( r ) ln 5 / 4 μ f ( r ) ln 2 μ f ( r ) , r + .

6. Discussion

Remark 1.
For the random entire function f E 1 ( φ , β ) Theorem 13 and Corollaries 1–3 hold when we replace exponent 1 / 4 by 1 / 2 , and Corollary 4 and Theorem 14 also hold if we replace the exponent 5 / 4 by 3 / 2 , respectively.
It is obvious that the classical Wiman’s inequality (2) cannot be improved for f E 1 ( φ , β ) . Finally, we formulate the following open problem
Problem 1.
Is the degree 1 + 1 / ρ of ln 2 μ f ( r ) 1 p sharp in the inequality (15)?

7. Conclusions

We prove sharp Wiman–Valiron’s type inequality for random entire functions, which holds with a probability p ( 0 ; 1 ) outside the set of finite logarithmic measure. Random variables, which are multipliers of Taylor’s coefficients of entire functions, may not be sub-Gaussian and may not be independent.

Author Contributions

Conceptualization, O.S.; investigation, A.K. and O.S.; writing—original draft preparation, A.K. and O.S.; Writing—Review and Editing, A.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Valiron, G. Fonctions Analytiques; Presses Universitaires de France: Paris, France, 1954. [Google Scholar]
  2. Wittich, H. Neuere Untersuchungen über Eindeutige Analytische Funktionen; Springer: Berlin/Heidelberg, Germany; Göttingen, Germany, 1955. [Google Scholar]
  3. Pólya, G.; Szego, G. Aufgaben und Lehrsätze aus der Analysis, 2nd ed.; Springer: Berlin, Germany, 1925. [Google Scholar]
  4. Skaskiv, O.B. On the classical Wiman inequality for entire Dirichlet series. Visn. L’viv. Univ. Ser. Mekh.-Mat. 1999, 54, 180–182. [Google Scholar]
  5. Hayman, W.K. The local growth of power series: A survey of the Wiman-Valiron method. Canad. Math. Bull. 1974, 17, 317–358. [Google Scholar] [CrossRef]
  6. Filevych, P.V. Wiman-Valiron type inequalities for entire and random entire functions of finite logarithmic order. Siberian Math. J. 2003, 42, 579–586. [Google Scholar] [CrossRef]
  7. Skaskiv, O.B. Random gap power series and Wiman’s inequality. Mat. Stud. 2008, 30, 101–106. Available online: http://matstud.org.ua/texts/2008/30_1/101-106.pdf (accessed on 20 October 2024). (In Ukrainian).
  8. Kuryliak, A. Subnormal independent random variables and Levy’s phenomenon for entire functions. Mat. Stud. 2017, 47, 10–19. [Google Scholar] [CrossRef]
  9. Filevych, P.V. Correlation between the maximum modulus and maximal term of random entire functions. Mat. Stud. 1997, 7, 157–166. Available online: http://matstud.org.ua/texts/1997/7_2/7_2_157-166.pdf (accessed on 20 October 2024).
  10. Filevych, P. Some classes of entire functions in which the Wiman-Valiron inequality can be almost certainly improved. Mat. Stud. 1996, 6, 59–66. Available online: http://matstud.org.ua/texts/1996/6/6_059-066.pdf (accessed on 20 October 2024).
  11. Erdos, P.; Re´nyi, A. On random entire function. Zastos. Mat. 1969, 10, 47–55. [Google Scholar] [CrossRef]
  12. Lévy, P. Sur la croissance de fonctions entière. Bull. Soc. Math. Fr. 1930, 58, 127–149. [Google Scholar] [CrossRef]
  13. Steele, J.M. Wiman’s inequality for entire functions with rapidly oscilating coefficients. J. Math. Anal. Appl. 1987, 123, 550–558. [Google Scholar] [CrossRef]
  14. Hayman, W.K. On the characteristic of functions meromorphic in the plane and of their integrals. Proc. Lond. Math. Soc. 1965, 14, 93–128. [Google Scholar] [CrossRef]
  15. Kahane, J.P. Some Random Series of Functions; Cambridge University Press: Cambridge, UK, 1985. [Google Scholar]
  16. Vershynin, R. High-Dimensional Probability; V.47; Cambridge Series in Statistical and Probabilistic Mathematics; Cambridge University Press: Cambridge, UK, 2024. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kuryliak, A.; Skaskiv, O.; Bandura, A. Arbitrary Random Variables and Wiman’s Inequality. Axioms 2024, 13, 739. https://doi.org/10.3390/axioms13110739

AMA Style

Kuryliak A, Skaskiv O, Bandura A. Arbitrary Random Variables and Wiman’s Inequality. Axioms. 2024; 13(11):739. https://doi.org/10.3390/axioms13110739

Chicago/Turabian Style

Kuryliak, Andriy, Oleh Skaskiv, and Andriy Bandura. 2024. "Arbitrary Random Variables and Wiman’s Inequality" Axioms 13, no. 11: 739. https://doi.org/10.3390/axioms13110739

APA Style

Kuryliak, A., Skaskiv, O., & Bandura, A. (2024). Arbitrary Random Variables and Wiman’s Inequality. Axioms, 13(11), 739. https://doi.org/10.3390/axioms13110739

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop