1. Introduction
Let us consider an entire functions of the form
Denote
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 of form (1) and any there exists a set of finite logarithmic measure, i.e.,such that for all we have Note that the constant
in the inequality (
2) cannot be replaced in general by a smaller number. Indeed, for the entire function
we have ([
3], p. 177)
Furthermore, from results proved in [
4] for entire Dirichlet series it follows that there exists entire function
of the form (
1) such that
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)
In this paper, we consider only random entire functions.
Let be the probability space, which allows the existence of a uniform distribution on it, where is the -algebra of subsets of , P is the probability measure on . 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 . We say that some relation holds almost surely if it holds for each analytic function from some class of almost surely in .
Let
be the Rademacher sequence, which is a sequence of independent random variables defined on the Steinhaus probability space
. For any
we have
Firstly, we consider random entire function of the form
From the results proved in [
11], the following theorem can be established.
Theorem 2. For of the form (4) and any , there almost surely exists a setof finite logarithmic measure such that for all we have From the results proved in ([
14], p. 45), the following statement can be derived. For the random entire function
we have, almost surely,
Furthermore, from results proved in [
4], it follows that there exists a random entire function
of the form (
4) such that
Wiman’s inequality for the most general class of random entire functions was established in [
8]. Let
be a sequence of real, independent, centered sub-Gaussian random variables, that is for any
, we have
and there exist a constant
such that for any
Also, for such random variables (see [
15]), there exists
such that for any
and all
we have
We denote the class of such random variables by
.
For
we have ([
15], p. 81 [Exercise 7.8]) for any
and
where
is the variance of random variable
From statement established in [
8], the following result can be derived (specifically for the case when
).
Theorem 3 ([
8]).
Let andThen there exists a set of finite logarithmic measure, such that for all , almost surely 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
Theorem 4 ([
8]).
For any there exist a sequence of real independent random variables satisfying for all with the entire function of the form (6) and a constant such that almost surely 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
where
for
. One can find a negative answer to this question in [
9].
Let
be the class of uniformly bounded real sequences
such that
for any
Theorem 5 ([
9]).
If and , then for any and of the form (6) there exists a set of finite logarithmic measure, such that for all almost surely, The sharpness of inequality (
7) follows from the next statement.
Theorem 6 ([
9]).
For any sequence such that and then there exists a function of the form (6) such that, almost surely, 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 ;
- (b)
in the cases when the sequence :
- (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
and
the relation
as
signifies the asymptotic equivalence of the functions up to constant factors. Specifically,
which means that there exist positive constants
such that the inequality
holds for sufficiently large
N.
Let us consider the random entire functions of the form
where
is the Rademacher sequence, and
is a sequence of complex-valued random variables (denote by
) such that there exist a constant
and a function
non-decreasing by
N and
such that
We denote such a class of random entire functions with
Remark that for any sequence
function
is non-decreasing by
N and
because
and by Lyapunov’s inequality for
we have
Also, the class of random entire functions of the form
is denoted by
In this paper, we will use the following notations.
4. Main Results
We derive sharp asymptotic estimates for the maximum modulus of functions In this case, the elements of a sequence may not be sub-Gaussian and could be dependent. The main result of this paper is stated in the following theorem.
Theorem 7. Let For there exist and a set of finite logarithmic measure, such that for all we have, with probability Remark that the exponent 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 in N and β that satisfies condition (10), there exist a sequence of random variables , an entire function , and a constant such that, almost surely, Also, we derive sharp asymptotic estimates for the maximum modulus of functions In this case, the elements of a sequence may be dependent or not centered.
Theorem 9. Let For , there exist and a set of finite logarithmic measure, such that for all we have, with probability , Remark that exponent and the degree 1 of function cannot be simultaneously replaced by smaller numbers.
Theorem 10. For any non-decreasing function in N and β that satisfies condition (10), there exist a sequence of random variables , an entire function and a constant such that for all Proof of Theorem 7. By Theorem 2,
-almost surely there exists a set
of finite logarithmic measure such that for all
we have
Then by Lemma 3 we get
where
is the non-negative random variable. Then, by Markov’s inequality, we obtain
Remark that there exist
a set
of finite logarithmic measure such that for all
with probability
, we have
Finally, for
with probability
p we get
or more precisely
□
Proof of Theorem 8. Let
be a non-decreasing function by
n and
for which (10) holds. Suppose that
It follows from (10) that there exists
such that we have
Therefore, by inequality (
5) we get
-almost surely
□
Proof of Theorem 9. By Theorem 1, there exists a set
of finite logarithmic measure such that for all
and for almost all
, we have
Finally, using (
11) for
with probability
p we obtain
□
Proof of Theorem 10. Let be a function which satisfies (10) and does not decrease by n and .
As in proof of Theorem 8, for some
, we get
Therefore, by inequality (
3) for
we have for all
□
5. Some Corollaries
First, we consider the case of sequence
is an almost surely bounded, i.e., for almost all
Then, we can choose
and
Corollary 1. Let and a sequence be almost surely bounded. Then, for each function there exist and a set of finite logarithmic measure, such that for all we have, with probability , Let
be the class of random variables
such that there exist a constant
such that for every
and any
, we have
Remark, that if then is the class of sub-Gaussian random variables and if then is the class of subexponential random variables.
We prove that for any
Inequality (
14) is sharp in the case of
. Indeed ([
16], p. 28) [Ex.2.5.11], in the case of
is a sequence of independent real standard Gaussian random variables there exists a constant
such that
We will prove that the degree
in inequality (
14) is sharp for the class of random variables
for any
. This follows from such a statement.
Lemma 4. There exists a sequence such that for any , we have Proof. Let
be a sequence of independent non-negative random variables such that for any
, we have
Then,
In this case, we have
One can make the substitution
Then, we obtain
□
The following statement holds without the condition of independence of sequence
Theorem 11. Let and Then, for there exist and a set of finite logarithmic measure, such that for all we have, with probability , Proof. Firstly, we prove (
14). Let
Then, using (
13) we get
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 , an entire function and a constant such that, almost surely, Proof. By Lemma 4, we can choose
and
and by Theorem 8 we get
□
If
satisfies
then we obtain
Corollary 2. Let and satisfies condition (16). Then, for a random entire function f of form (8), there exist and a set of finite logarithmic measure, such that for all we have, with probability , Proof. Here, we can choose
Then
which continues to use Theorem 7. There exist
and a set
of finite logarithmic measure such that for all
we have with probability
□
Let
be a sequence of independent Pareto distributed random variables with parameter
, which is the density function of
Corollary 3. Let and be Pareto distributed random variables with parameter . Then, for a random entire function f of the form (8), there exist and a set of finite logarithmic measure, such that for all we have, with probability , Proof. It is enough to remark that satisfies Corollary 2 with for any □
Remark that exponents and in the inequalities of Corollaries 2 and 3, respectively, cannot be replaced by smaller numbers. This follows from the next statement.
Theorem 13. Let be a sequence of independent Pareto distributed random variables with parameter . For any there exist an entire function and a constant such that, almost surely, Proof. Let
be a sequence of independent random variables having a Pareto distribution with parameter
. Then, for any
we get
Firstly, we calculate expectation
One can make the substitution
Then
Therefore, We can choose
By Theorem 8, there exist
and
such that we have almost surely
Also, for any
, we choose
. Then, almost surely, one has
where
□
If
has Cauchy distribution for all
, i.e., density function of
we obtain such a statement.
Corollary 4. Let and be a sequence of Cauchy distributed random variables. Then, for random entire function f of form (8) there exist and a set of finite logarithmic measure, such that for all , we obtain, with probability , Proof. Let
Remark that
Therefore, we can choose
in Corollary 2. So, by Corollary 2, there exist
and a set
of finite logarithmic measure such that for all
we have with probability
It continues to choose □
Remark, that exponent in Corollary 4 cannot be replaced by smaller number. This follows from the next statement.
Theorem 14. Let be a sequence of independent Cauchy distributed random variables. There exist an entire function and a constant such that, almost surely, Proof. Firstly, we remark that for
On the other hand, one has
Now, one can make the substitution
Then
It continues to use Theorem 8. Then, there exist an entire function
and constant
such that we have, almost surely,
□