| | |
Summary: k-Wise Independent Random Graphs
Noga Alon
Schools of Mathematics and Computer Science,
Sackler Faculty of Exact Sciences,
Tel Aviv University, Tel Aviv 69978, Israel, and
IAS, Princeton, NJ 08540, USA.
nogaa@post.tau.ac.il.
Asaf Nussboim
Department of Computer Science and Applied Mathematics,
Weizmann Institute of Science, Rehovot, Israel.
asaf.nussbaum@weizmann.ac.il.
Abstract
We study the k-wise independent relaxation of the usual
model G(N, p) of random graphs where, as in this model, N
labeled vertices are fixed and each edge is drawn with prob-
ability p, however, it is only required that the distribution of
any subset of k edges is independent. This relaxation can
be relevant in modeling phenomena where only k-wise in-
dependence is assumed to hold, and is also useful when the
relevant graphs are so huge that handling G(N, p) graphs
|
