K-wise independent random graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 813-822

  Alon, Noga ^a,b   Nussboim, Asaf ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; GRAPH THEORY; PROBABILITY; PROBABILITY DISTRIBUTIONS;

HAMILTONICITY; RANDOM GRAPHS; SPECTRAL TECHNIQUES; SUBGRAPHS;

RANDOM PROCESSES;

EID: 57949111887     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.61     Document Type: Conference Paper

References (45)

1. N. Alon, L. Babai, A. Itai. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms 7, 567-583, 1986.
2. N. Alon, F. R. K. Chung. Explicit construction of linear sized tolerant networks. Discrete Math. 72, 15-19, 1988; (Proc. of the First Japan Conference on Graph Theory and Applications, Hakone, Japan, 1986.)
3. N. Alon, M. Krivelevich, B. Sudakov. List Coloring of Random and Pseudo-Random Graphs. Combinatorica 19 (1999), 453-472.
4. N. Alon, M. Krivelevich, B. Sudakov. Coloring graphs with sparse neighborhoods. J. Combinatorial Theory, Ser. B 77 (1999), 73-82.
5. N. Alon, A. Nussboim. k-Wise Independent Random Graphs. Complete version is available at http://www.wisdom.weizmann.ac.il/~asafn/PAPERS/K-WISE- GNP.pdf.
6. N. Alon, J. Spencer. The Probabilistic Method. John Wiley, New York, 1992.
7. I. Benjamini, O. Gurel-Gurevich, R. Peled. On k-wise independent distributions and boolean functions. To appear.
8. B. Bollobás. Random Graphs. Academic Press, 1985.
9. B. Bollobás. Random Graphs. In Combinatorics (Swansea, 1981), Volume 52 of London. Math. Soc. Lecture Note Ser., 80102. Cambridge Univ. Press, 1981.
10. B. Bollobás. The Chromatic Number of Random Graphs. In Combinatorica 8 49-55, 1988.
11. B. Bollobás, P. Erdös. Cliques in Random Graphs. Math Proc Camb Phil Soc 80 (1976), 419-427.
12. B. Bollobás, A. Thomason. Threshold Functions. Combinatorica 7 (1986), 35-38.
13. B. Chor, O. Goldreich. On the Power of Two-Point Based Sampling. J. Complexity 5(1): 96-106 (1989).
14. F. R. K. Chung, R. L. Graham, R. M. Wilson. Quasi-Random Graphs. Combinatorica 9, 345-362, 1989.
15. P. Erdös, A. Rényi. On Random Graphs I. Publicationes Mathematicae 6 (1959), 290-297.
16. P. Erdös, A. Rényi. On the Evolution of Random Graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17-61, 1960.
17. P. Erdös, A. Rényi. On Random Matrices. Publicationes Mathematicae 8 (1964), 455-461.
18. P. Erdös, A. Rényi. On the Existence of a Factor of Degree One of a Connected Random Graph. Acta Mathematica 17 (1966),359-368.
19. P. Erdös, A. Rényi. On Random Matrices ii. Studia Sci. Math. Hungar. 3, 459-464, 1968.
20. R. Fagin. Probabilities in Finite Models, Journal of Symbolic Logic, Vol. 41, 50-58, 1969.
21. Z. Füredi, J. Komlos. The eigenvalues of random symmetric matrices. Combinatorica 1 (1981), 233-241.
22. E. Friedgut, G. Kalai. Every Monotone Graph Property Has a Sharp Threshold. Proc. Amer. Math. Soc. 124 (1996), 2993-3002.
23. A. Frieze. On the Independence Number of Random Graphs. Discrete Math.81 171-175, 1990
24. O. Goldreich, S. Goldwasser, A. Nussboim. On the Implementation of Huge Random Objects. In Proc. 44th IEEE Symposium on Foundations of Computer Science, 68-79, 2003.
25. Y. V. Glebskii, D. I. Kogan, M. I. Liagonkii, V. A. Talanov. Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus. Cybernetics, Vol. 5, 142-154, 1976.
26. D. Hefetz, M. Krivelevich, T. Szabo. Hamilton Cycles in Highly Connected and Expanding Graphs. Preprint.
27. A. Joffe. On a Set of Almost Deterministic k-Wise Independent Random Variables. Annals of Probability 2, 1961-1962, 1974.
28. A.R. Johansson. Asymptotic Choice Number for Triangle Free Graphs. DIMACS Technical Report 91-5.
29. S. Janson, T. Łuczak, A. Rucinski. Random Graphs. New York: Wiley, 2000.
30. A.D. Koršunov. Solution of a Problem of Erdös and Rényi on Hamiltonian Cycles in Nonoriented Graphs. Dokl. Akad. Nauk SSSR Tom 228(1976) 760-764.
31. J. Komlós, E. Szemerédi. Limit Distributions for the Existence of Hamilton Circuits in a Random Graph. Discrete Math. 43 (1983) 55-63.
32. M. Krivelevich , B. Sudakov. Pseudo-random Graphs. In More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, Springer, 2006, 199-262.
33. Nikolai N. Kuzjurin. On the difference between asymptotically good packings and coverings. European J. Combin. 16 (1995), no. 1, 35-40.
34. T. Łuczak. The Chromatic Number of Random Graphs. Combinatorica(11),45-54,1991.
35. D.W. Matula. The Largest Clique Size in a Random Graph. Tech. Rep. Dept. Comp. Sci. Southern Methodist Univ., Dallas, 1976.
36. M. Naor, A. Nussboim, E. Tromer. Efficiently Constructible Huge Graphs that Preserve First Order Properties of Random Graphs. Proceedings of the 2'nd Theory of Cryptography Conference, 66-85, 2005.
37. A. Nussboim. Huge Pseudo-Random Graphs that Preserve Global Properties of Random Graphs. M.Sc. Thesis, Advisor: S. Goldwasser, Weizmann Institute of Science, 2003, http://www.wisdom.weizmann.ac.il/~asafn/psdgraphs.ps.
38. L. Posa. Hamiltonian Circuits in Random Graphs. Discrete Math 14 (1976), 359-364.
39. A. Rucinski, A. Vince. Strongly Balanced Graphs and Random Graphs. J. Graph Theory 10 (1986) 251-264.
40. S. Shelah, J. H. Spencer. Zero-One Laws for Sparse Random Graphs, Journal of the American Mathematical Society, Vol. 1,97-115, 1988.
41. J. P. Schmidt, A. Siegel, A. Srinivasan. Cheeroff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discrete Math. 8(2): 223-250 (1995).
42. A. Thomason. Pseudo-Random Graphs. Proceedings of Random Graphs, Annals of Discrete Mathematics 33, 307-331, 1987.
43. V. H. Vu. Spectral norm of random matrices. STOC 2005, 423-430.
44. E. Wigner. On the Distribution of the Roots of Certain Symmetric Matrices. Ann. of Math. 67, 325-328, 1958.
45. R. M. Wilson. Decomposition of complete graphs into subgraphs isomorphic to a given graph. Congressus Numerantium XV (1975), 647-659.