Subnormal independent random variables and Levy's phenomenon for entire functions
نویسندگان
چکیده
منابع مشابه
Growth analysis of entire functions of two complex variables
In this paper, we introduce the idea of generalized relative order (respectively generalized relative lower order) of entire functions of two complex variables. Hence, we study some growth properties of entire functions of two complex variables on the basis of the definition of generalized relative order and generalized relative lower order of entire functions of two complex variables.
متن کاملMoment inequalities for functions of independent random variables
A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions [7], and is based on a generalized tensorization inequality due to Lata la and Oleszkiewicz [25]. The new inequalities prove to be a versatile tool in a wide range o...
متن کاملLocal Tail Bounds for Functions of Independent Random Variables
It is shown that functions defined on {0, 1, . . . , r − 1}n satisfying certain conditions of bounded differences that guarantee subgaussian tail behavior also satisfy a much stronger “local” subgaussian property. For self-bounding and configuration functions we derive analogous locally subexponential behavior. The key tool is Talagrand’s (1994) variance inequality for functions defined on the ...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملPairwise Independent Random Variables
In this lecture we discuss how to derandomize algorithms. We will see a brute force algorithm (enumeration) for derandomization. We will also see that some random algorithms do not need true randomness. Specifically, we will see an example where only pairwise random bits are needed. Next, we will see how we can generate pairwise random values and how this conservation on the amount of randomnes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matematychni Studii
سال: 2016
ISSN: 1027-4634
DOI: 10.15330/ms.47.1.10-19