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

@article{McColm1999FirstOZ,
  title={First order zero-one laws for random graphs on the circle},
  author={Gregory L. McColm},
  journal={Random Struct. Algorithms},
  year={1999},
  volume={14},
  pages={239-266}
}
We look at a competitor of the Erdos]Renyi models of random graphs, one ̋ ́ w Ž .x proposed in E. Gilbert J. Soc. Indust. Appl. Math. 9:4, 533]543 1961 : given d)0 and a metric space X of diameter )d , scatter n vertices at random on X and connect those of distance -d apart: we get a random graph G X . Letting X be a circle, we look at zero-one n, d Ž . laws for in First Order Logic various d . Q 1999 John Wiley & Sons, Inc. Random Struct. Alg., 
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

A Splitting Inequality

  • G. L. McColm
  • The Ramanujan Journal
  • 1998

Mathematics for a fundamental problem of biological information processing

  • J. F. Pedersen, W. R. Stark
  • Proc Internat’l IEEE Symp Intelligence Neural and…
  • 1995

Random Intersection Graphs, Ph.D

  • K. Singer
  • Thesis, Johns Hopkins University,
  • 1995

The logic of ordered random structures ,

  • J. Lynch
  • Random Structures Algorithms
  • 1991

Graphs as structural models: the application of graphs and multigraphs in cluster

  • E. Godehardt
  • 1990

0-1 laws for sparse random graphs

  • S. Shelah, J. Spencer
  • J AMS
  • 1988

Introduction to the Theory of Coverage

  • P. Hall
  • 1988

intractibility in asymptotic problems

  • C. W. Henson, S. Shelah, Ž.
  • Discrete Math
  • 1982

Similar Papers

Loading similar papers…