First order zero-one laws for random graphs on the circle

Random Structures and Algorithms

Volumn 14, Issue 3, 1999, Pages 239-266

  McColm, Gregory L ^a  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033463133     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199905)14:3<239::AID-RSA3>3.0.CO;2-3     Document Type: Article

References (44)

1. N. Alon, J. Spencer, and P. Erdos, The Probabilistic Method, Wiley, 1992.
2. B. Bollobas, Graph theory: an introductory course, Springer-Verlag, New York, 1979.
3. A. Chandra and D. Harel, Structure and complexity of relational queries, J Comput System Sci 25 (1982), 99-128.
4. B. N. Clark and C. J. Colbourn, Unit Disk Graphs, Discrete Math 86 (1990), 165-177.
5. K. J. Compton, C. W. Henson, and S. Shelah, Nonconvergence, undecidability, and intractibility in asymptotic problems, Ann Pure & Appl Log 36 (1987), 207-224.
6. A. Dawar and S. Grumbach, Expressive Power of Built-in Relations, unpublished manuscript.
7. G. Di Battista, W. Lenhart, and G. Liotta, "Proximity drawability: a survey," Graph Drawing, R. Tamassia and I. G. Tollis (Editors), Springer Lect Notes in Comp Sci 894, 1994, pp. 328-339.
8. P. Dolan, A zero-one law for a random subset, Random Structures Algorithms 2 (1991), 317-326.
9. P. Dolan and J. Lynch, The logic of ordered random structures, Random Structures Algorithms 4 (1993), 429-445.
10. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer, Berlin, 1995.
11. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund Math 49 (1961), 130-141.
12. P. Erdos, Some remarks on the theory of graphs, Bull AMS 53 (1947), 292-294.
13. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5, 17-61.
14. R. Fagin, Probabilities on finite models, J Sym Log 41 (1976), 50-58.
15. R. Fraïssé, Sur les Classifications des Systems de relations, Publications Sc d l'Universite D'Alager 1:I (1954).
16. E. Gilbert, Random Plane Networks, J Soc Indust Appl Math 9 (1961), 533-543.
17. Y. Glebski, D. Kogan, M. Liogon'kii, and V. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetica 2 (Kiev, 1969), 17-28; Cybernetics 5 (English trans., 1969), 142-154.
18. Y. Glebski, D. Kogan, M. Liogon'kii, and V. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetica 2 (Kiev, 1969), 17-28; Cybernetics 5 (English trans., 1969), 142-154.
19. E. Godehardt, Graphs as structural models: the application of graphs and multigraphs in cluster analysis, Vieweg, Braunschweig, 1990.
20. E. Godehardt and B. Harris, Asymptotic Properties of Random Interval Graphs and their Use in Cluster Analysis, Univ Wisconsin-Madison Tech Rept #968.
21. A. Gräf, M. Stumpf, and G. Weissenfels, On Coloring Unit Disk Graphs, manuscript, Johannes Gutenberg-Universität (1994).
22. G. Grimmett, Percolation, Springer-Verlag, 1989.
23. G. Grimmett and D. Stirzaker, Probability and Random Processes, Clarendon, Oxford, 1992.
24. P. Hall, Introduction to the Theory of Coverage Processes, Wiley, New York, 1988.
25. J. Jaromczyk and G. Toussaint, Relative neighborhood graphs and their relatives Proc IEEE 80 (1992), 1502-1517.
26. T. Luczak and S. Shelah, Convergence in Homogeneous Random Graphs, Random Structures Algorithms 6 (1995), 371-391.
27. G. L. McColm, Parametrization over inductive relations of a bounded number of variables, Ann Pure & Appl Logic 48 (1990), 103-134.
28. G. L. McColm, Eventual Periodicity and "One-Dimensional" Queries, Notre Dame J Formal Log 33 (1992), 273-290.
29. G. L. McColm, Zero One Laws for Gilbert Random Graphs, Proc 11th Symp Logic Comp Sci (LICS'96), IEEE, 1996, pp. 360-369.
30. G. L. McColm, A Splitting Inequality, The Ramanujan Journal 2 (1998), 511-519.
31. G. L. McColm, Weak Thresholds, submitted for publication.
32. G. L. McColm, MSO asymptotics on random acyclic graphs, submitted for publication.
33. G. L. McColm, MSO zero-one laws on random acyclic graphs, submitted for publication.
34. E. M. Palmer, Graphical Evolution, John Wiley & Sons, New York, 1985.
35. J. F. Pedersen and W. R. Stark, Mathematics for a fundamental problem of biological information processing, Proc Internat'l IEEE Symp Intelligence Neural and Biological Systems, 146-154, 1995.
36. K. St. John and J. Spencer, Random Unary Predicates: Almost Sure Theories and Countable Models, unpublished manuscript.
37. S. Shelah and J. Spencer, 0-1 laws for sparse random graphs, J AMS 1 (1988), 97-115.
38. S. Shelah and J. Spencer, Can you feel the double jump? Random Structures Algorithms 5 (1994), 191-204.
39. S. Shelah and J. Spencer, Random Sparse Unary Predicates, Random Structures Algorithms 5 (1994), 375-394.
40. K. Singer, Random Intersection Graphs, Ph.D. Thesis, Johns Hopkins University, 1995.
41. J. Spencer, Ten Lectures on the Probabilistic Method (SIAM), 2nd ed., Philadelphia 1995.
42. W.R. Stark, "Artificial Tissue Models," Computing with Biological Metaphors, R. Paton (Editor), Chapman-Hall, 1994, pp. 193-210.
43. G. Toussaint, "Computational geometric problems in pattern recognition," Pattern Recognition Theory, J. Kittler (Editor), NATO Adv Stud Inst, 1981, pp. 73-91.
44. J. Tyszkiewicz, Infinitary Queries and Their Asymptotic Probabilities II. Properties Definable in Least Fixed Point Logic, Random Structures Algorithms 5 (1994), 215-234.