On Construction of k-Wise Independent Random Variables
نویسندگان
چکیده
A 0-1 probability space is a probability space ((; 2 ; P), where the sample space f0;1g n for some n. A probability space is k-wise independent if, when Yi is deened to be the ith coordinate of the random n-vector, then any subset of k of the Yi's is (mutually) independent, and it is said to be a probability space for p1; p2; :::;pn if PYi = 1] = pi. We study constructions of k-wise independent 0-1 probability spaces in which the pi's are arbitrary. It was known that for any p1; p2; :::;pn, a k-wise independent probability space of size m(n; k) =
منابع مشابه
OBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملMoments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables
In this paper we introduce a notion to be called k-wise uncorrelated random variables, which is similar but not identical to the so-called k-wise independent random variables in the literature. We show how to construct k-wise uncorrelated random variables by a simple procedure. The constructed random variables can be applied, e.g. to express the quartic polynomial (xTQx)2, where Q is an n×n pos...
متن کامل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.
متن کاملLecture 5: k-wise Independent Hashing and Applications
If the random variables X1, X2, · · · , Xn are independent, they are k-wise independent for any k. However, the converse is not true as shown by the following example. Also, if k1 > k2, k1-wise independence implies k2-wise independence. Example 2. Let X1, X2 be uniform independent random variables taking values in {0, 1}. Let X3 = X1 ⊕X2. It is easy to check that {X1, X2, X3} is pairwise indepe...
متن کاملA Simple Construction of Almost k-wise Independent Random Variables
We present a simple construction of a small probability space on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n + k + log ~), where e is the statistical difference between of the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 17 شماره
صفحات -
تاریخ انتشار 1997