The 4Th Moment In Luby Distribution
Abbreviated Journal Title
Theor. Comput. Sci.
FOURTH MOMENT; FULL INDEPENDENCE; K-WISE INDEPENDENCE; DERANDOMIZATION; INDEPENDENT SET PROBLEM; PARALLEL ALGORITHM; Computer Science, Theory & Methods
Luby (1988) proposed a way to derandomize randomized computations which is based on the construction of a small probability space whose elements are 3-wise independent. In this paper we prove some new properties of Luby's space. More precisely, we analyze the fourth moment and prove an interesting technical property which helps to understand better Luby's distribution. As an application, we study the behavior of random edge cuts in a weighted graph.
Theoretical Computer Science
"The 4Th Moment In Luby Distribution" (1995). Faculty Bibliography 1990s. 1327.