Threshold functions for random graphs on a line segment

Combinatorics Probability and Computing

Volumn 13, Issue 3, 2004, Pages 373-387

  McColm, Gregory L ^a  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; FUNCTIONS; MATHEMATICAL PROGRAMMING; POISSON DISTRIBUTION; SCATTERING; THEOREM PROVING; THRESHOLD LOGIC;

LINE SEGMENTS; METRIC SPACES; RANDOM GRAPHS; THRESHOLD FUNCTIONS;

GRAPH THEORY;

EID: 3142567129     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006121     Document Type: Article

References (30)

1. d. Adv. Appl. Probab. 29 567-581.
2. Barbour, A. D. and Eagleson, G. K. (1984) Poisson convergence for dissociated statistics. J. Royal Statist. Soc. B 46 397-402.
3. Bollobás, B. (1977) Graph Theory: An Introductory Course, Springer, New York.
4. Bollobás, B. (1981) Threshold functions for small subgraphs. Math. Proc. Camb. Phil. Soc. 90 197-206.
5. Bollobás, B. and Thomason, A. (1986) Threshold functions. Combinatorica 7 35-38.
6. Clark, B. N. and Colbourn, C. J. (1990) Unit disk graphs. Discrete Math. 86 165-177.
7. Cox, D. R. and Isham, V. (1980) Point Processes, Chapman and Hall.
8. Di Battista, G., Lenhart, W. and Liotta, G. (1994) Proximity drawability: A survey. In Graph Drawing (R. Tamassia and I. G. Tollis, eds), Vol. 894 of Springer Lect. Notes, in Comp. Sci., pp. 328-339.
9. Erdos, P. and Rényi, A. (1960) On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Kozl. 5 17-61.
10. Friedgut, E. and Kalai, G. (1996) Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124 2993-3002.
11. Gilbert, E. (1961) Random plane networks. J. Soc. Indust. Appl. Math. 9 533-543.
12. Godehardt, E. (1990) Graphs as Structural Models: The Application of Graphs and Multigraphs in Cluster Analysis, 2nd edn, Vieweg, Braunschweig.
13. Godehardt, E. and Harris, B. (1997) Asymptotic properties of random interval graphs and their use in cluster analysis. In International Petrozavodsk Conference, 1996, Probabilistic Methods in Discrete Mathematics, VSP, Utrecht, pp. 19-30.
14. Godehardt, E., Harris, B. and Horsch, A. (1995) Random multigraphs, classification and clustering. In New Trends in Probability and Statistics, Vol. 3: Multivariate Statistics and Matrices in Statistics (E.-M. Tut, T. Kollo and H. Niemi, eds), VSP, pp. 279-286.
15. Goel, A., Rai, S. and Krishnamachari, B. Sharp thresholds for monotone properties in tandom geometric graphs. Submitted.
16. Gräf, A., Stumpf, M. and Weissenfels, G. (1998) On coloring unit disk graphs. Algorithmica 20 277-293.
17. Grimmett, G. (1989) Percolation, Springer.
18. Hafner, R. (1972) The asymptotic distribution of random clumps. Computing (Arch. Elektron. Rechnen) 10 335-351.
19. Hall, P. (1988) Introduction to the Theory of Coverage Processes, Wiley.
20. Jammalamadaka, S. R. and Janson, S. (1986) Limit theorems for a triangular scheme of U-statistics with applications to inter-point distances. Ann. Probab. 14 1347-1358.
21. Jaromczyk, J. and Toussaint, G. (1992) Relative neighborhood graphs and their relatives. Proc. IEEE 80 1502-1517.
22. McColm, G. L. (1998) A splitting inequality. The Ramanujan Journal 1 511-519.
23. McColm, G. L. (1999) First order zero-one laws for random graphs on the circle. Random Struct. Alg. 14 239-266.
24. Penrose, M. (2003) Random Geometric Graphs, Oxford University Press.
25. Ripley, B. D. (1977) Modelling spatial patterns. J. Royal Statist. Soc. Ser. B 39 172-212.
26. Shiryaev, A. N. (1996) Probability, 2nd edn, Springer.
27. Silverman, B. and Brown, T. (1978) Short distances, flat triangles and Poisson limits. J. Appl. Probab. 15 815-825.
28. Stark, W. R. (1994) Artificial tissue models. In Computing with Biological Metaphors (R. Paton, ed.), Chapman and Hall, pp. 193-210.
29. Toussaint, G. (1982) Computational geometric problems in pattern recognition. In Pattern Recognition Theory (J. Kittler, ed.), NATO Adv. Stud. Inst., pp. 73-91.
30. Tyszkiewicz, J. (1994) Infinitary queries and their asymptotic probabilities, II: Properties definable in least fixed point logic. Random Struct. Alg. 5 215-234.