Results 1  10
of
75
Simple Constructions of Almost kwise Independent Random Variables
, 1992
"... We present three alternative simple constructions of small probability spaces 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 (2 + o(1))(log log n + k/2 + log k + log 1 ɛ), where ɛ is the statistical difference between the dist ..."
Abstract

Cited by 319 (42 self)
 Add to MetaCart
We present three alternative simple constructions of small probability spaces 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 (2 + o(1))(log log n + k/2 + log k + log 1 ɛ), where ɛ is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ɛ < 1/(k log n)). An additional advantage of our constructions is their simplicity.
SmallBias Probability Spaces: Efficient Constructions and Applications
 SIAM J. Comput
, 1993
"... We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with "almost" equal probability. They are called fflbiased random variables. The number of random bits needed to generate the random var ..."
Abstract

Cited by 289 (15 self)
 Add to MetaCart
(Show Context)
We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with "almost" equal probability. They are called fflbiased random variables. The number of random bits needed to generate the random variables is O(log n + log 1 ffl ). Thus, if ffl is polynomially small, then the size of the sample space is also polynomial. Random variables that are fflbiased can be used to construct "almost" kwise independent random variables where ffl is a function of k. These probability spaces have various applications: 1. Derandomization of algorithms: many randomized algorithms that require only k wise independence of their random bits (where k is bounded by O(log n)), can be derandomized by using fflbiased random variables. 2. Reducing the number of random bits required by certain randomized algorithms, e.g., verification of matrix multiplication. 3. Exhaustive testing of combinatorial circui...
On the complexity of the parity argument and other inefficient proofs of existence
 JCSS
, 1994
"... We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is define ..."
Abstract

Cited by 202 (8 self)
 Add to MetaCart
We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is defined in terms of an implicitly given, exponentially large graph. The existence of the solution sought is established via a simple graphtheoretic argument with an inefficiently constructive proof; for example, PLS can be thought of as corresponding to the lemma "every dag has a sink. " The new classes are based on lemmata such as "every graph has an even number of odddegree nodes. " They contain several important problems for which no polynomial time algorithm is presently known, including the computational versions of Sperner's lemma, Brouwer's fixpoint theorem, Chfvalley's theorem, and the BorsukUlam theorem, the linear complementarity problem for Pmatrices, finding a mixed equilibrium in a nonzero sum game, finding a second Hamilton circuit in a Hamiltonian cubic graph, a second Hamiltonian decomposition in a quartic graph, and others. Some of these problems are shown to be complete. © 1994 Academic Press, Inc. 1.
Packet routing and jobshop scheduling in O(congestion+dilation) steps
 Combinatorica
, 1994
"... In this paper, we prove that there exists a schedule for routing any set of packets with edgesimple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machi ..."
Abstract

Cited by 119 (9 self)
 Add to MetaCart
(Show Context)
In this paper, we prove that there exists a schedule for routing any set of packets with edgesimple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machines, network emulations, and jobshop scheduling.
The algorithmic aspects of the Regularity Lemma
 J. Algorithms
, 1994
"... The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. Here we first demonstrate the computational difficulty of finding a regular partition; we show that ..."
Abstract

Cited by 113 (30 self)
 Add to MetaCart
(Show Context)
The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. Here we first demonstrate the computational difficulty of finding a regular partition; we show that deciding if a given partition of an input graph satisfies the properties guaranteed by the lemma is coNPcomplete. However, we also prove that despite this difficulty the lemma can be made constructive; we show how to obtain, for any input graph, a partition with the properties guaranteed by the lemma, efficiently. The desired partition, for an nvertex graph, can be found in time O(M(n)), where M(n) = O(n 2.376) is the time needed to multiply two n by n matrices with 0, 1entries over the integers. The algorithm can be parallelized and implemented in NC 1. Besides the curious phenomenon of exhibiting a natural problem in which the search for a solution is easy whereas the decision if a given instance is a solution is difficult (if P and NP differ), our constructive version of the Regularity Lemma supplies efficient sequential and parallel algorithms for many problems, some of which are naturally motivated by the study of various graph embedding and graph coloring problems.
A constructive proof of the general Lovász Local Lemma
, 2009
"... The Lovász Local Lemma [EL75] is a powerful tool to nonconstructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Si ..."
Abstract

Cited by 83 (2 self)
 Add to MetaCart
The Lovász Local Lemma [EL75] is a powerful tool to nonconstructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08a]. In [Mos08b], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.
Percolation on finite graphs and isoperimetric inequalities
, 2002
"... Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c> 0, a random subgraph of Gn obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least cGn, with probability going to ..."
Abstract

Cited by 62 (12 self)
 Add to MetaCart
(Show Context)
Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c> 0, a random subgraph of Gn obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least cGn, with probability going to one, uniformly in p. The method from Ajtai, Komlós and Szemerédi [Combinatorica 2 (1982) 1–7] is applied to obtain some new results about the critical probability for the emergence of a giant component in random subgraphs of finite regular expanding graphs of high girth, as well as a simple proof of a result of Kesten about the critical probability for bond percolation in high dimensions. Several problems and conjectures regarding percolation on finite transitive graphs are presented. 1. Introduction. In
Lifts, Discrepancy and Nearly Optimal Spectral Gaps
"... Let G be a graph on n vertices. A 2lift of G is a graph H on 2n vertices, with a covering map : H ! G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n \new" eigenvalues. We conjecture that every dregular graph has a 2lift such that all new ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
(Show Context)
Let G be a graph on n vertices. A 2lift of G is a graph H on 2n vertices, with a covering map : H ! G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n \new" eigenvalues. We conjecture that every dregular graph has a 2lift such that all new eigenvalues are in the range [ 2 d 1; 2 d 1] (If true, this is tight , e.g. by the AlonBoppana bound). Here we show that every graph of maximal degree d has a 2lift such that all \new" eigenvalues are in the range [ c d; c d] for some constant c.
The repulsive lattice gas, the independentset polynomial, and the Lovász local lemma
, 2004
"... We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász local lemma in probabilistic combinatorics. We show that the conclusion of the Lovász local lemma holds for dependency graph G and probabilities {px} if and only if the independent ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
(Show Context)
We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász local lemma in probabilistic combinatorics. We show that the conclusion of the Lovász local lemma holds for dependency graph G and probabilities {px} if and only if the independentset polynomial for G is nonvanishing in the polydisc of radii {px}. Furthermore, we show that the usual proof of the Lovász local lemma — which provides a sufficient condition for this to occur — corresponds to a simple inductive argument for the nonvanishing of the independentset polynomial in a polydisc, which was discovered implicitly by Shearer [98] and explicitly by Dobrushin [37, 38]. We also present some refinements and extensions of both arguments, including a generalization of the Lovász local lemma that allows for “soft” dependencies. In addition, we prove some general properties of the partition function of a repulsive lattice gas, most of which are consequences of the alternatingsign property for the Mayer coefficients. We conclude with a brief discussion of the repulsive lattice gas on countably infinite graphs.