Distance graphs: from random geometric graphs to Bernoulli graphs and between

DIALM-POMC'08: Proceedings of the ACM 5th International Workshop on Foundations of Mobile Computing

Volumn , Issue , 2008, Pages 71-77

  Avin, Chen ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Bernoulli graphs; Connectivity; Distance graphs; Random geometric graphs; Small world

Indexed keywords

BERNOULLI GRAPHS; CONNECTIVITY; DISTANCE GRAPHS; RANDOM GEOMETRIC GRAPHS; SMALL WORLD;

LARGE SCALE SYSTEMS; MOBILE COMPUTING; MODEL STRUCTURES; SOLVENTS;

GRAPH THEORY;

EID: 65249160516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400863.1400878     Document Type: Conference Paper

References (27)

1. AVIN, C. Random Geometric Graphs: An Algorithmic Prospective. PhD thesis, University of California, Los Angeles (UCLA), 2006.
2. AVIN, C., AND ERCAL, G. On the cover time of random geometric graphs. In Proc. Automata, Languages and Programming, 32nd International Colloquium, ICALP05 (2005), pp. 677-689.
3. BOLLOBÁS, B. Random Graphs. Academic Press, Orlando, FL, 1985.
4. CHUNG, F., AND LU, L. The diameter of sparse random. graphs. Adv. Appl. Math. 26,4 (2001), 257-279.
5. COOPER, C., AND FRIEZE, A. The cover time of sparse random graphs. In Proc. of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03) (2003), pp. 140-147.
6. 2. Lecture Notes in Computer Science 1518 (1998).
7. E.RDÕS, P., AND RÉ.NYI, A. On random, graphs. Publicationes Mathemticae (Debrecen) 6 (1959), 290-297.
8. FILL, J. A., SCHEINERMAN, E. R., AND SINGER-COHEN, K. B. Random intersection graphs when m= w(n): an equivalence theorem relating the evolution of the g(n, m, p) and g(n,p) models. Random Struct. Algorithms 16, 2 (2000), 156-176.
9. FRAIGNIAUD, P. Small worlds as navigable augmented networks: Model, analysis, and validation. In Algorithms U ESA 2007 (2007), pp. 2-11.
10. FRAIGNIAUD, P., LEBHAR, E., AND LOTKER, Z. Recovering the long-range links in augmented graphs. In SIROCCO (2008), pp. 104-118.
11. GILBERT, E. N. Random graphs. The Annals of Mathematical Statistics 30, 4 (Dec. 1959), 1141-1144.
12. GILBERT, E. N. Random plane networks. Journal of the Society for Industrial and Applied Mathematics 9, 4 (Dec. 1961), 533-543.
13. GOEL, A., RAI, S., AND KRISHNAMACHARI, B. Sharp thresholds for monotone properties in random geometric graphs. In Proc. of the thirty-sixth annual ACM symposium on Theory of computing (2004), pp. 580-586.
14. GUPTA, P., AND KUMAR, P. R. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming (1998), 547-566.
15. KLEINBERG, J. The small-world phenomenon: an algorithmic perspective. In STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing (New York, NY, USA, 2000), ACM Press, pp. 163-170.
16. MEESTER, R., PENROSE, M. D., AND SARKAR, A. The random connection model in high dimensions. Statistics & Probability Letters 35, 2 (1997), 145-153.
17. MEESTER, R., AND ROY, R. Continuum percolation. Cambridge Univesity Press, Cambridge, UK., 1996.
18. MILGRAM, S. The small world problem. Psychology today 2 (1967), 60-67.
19. NEWMAN, M. The Structure and Function of Complex Networks. SIAM Review 45, 2 (2003), 167-256.
20. NEWMAN, M., WATTS, D., AND STROGATZ, S. Random graph models of social networks. In Proc. Natl. Acad. Sci (2002), vol. 99, pp. 2566-2572.
21. PALMER, E. M. Graphical Evolution: An Introduction to the Theory of Random Graphs. Jhon Wiley & Sons, Inc., 1985.
22. PENROSE, M. D. On a continuum percolation model. Advances in Applied Probability 23, 3 (Sep 1991), 536-556.
23. PENROSE, M. D. The longest edge of the random minimal spanning tree. The Annals of Applied Probability 7, 2 (1997), 340-361.
24. PENROSE, M. D. Random Geometric Graphs, vol. 5 of Oxford Studies in Probability. Oxford University Press, May 2003.
25. SINGER, K. B. Random intersection graphs. PhD thesis, Johns Hopkins University, 1995.
26. SLIVKINS, A. Distance estimation and object location via rings of neighbors. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (New York, NY, USA, 2005), ACM, pp. 41-50.
27. WATTS, D. J., AND STROGATZ, S. H. Collective dynamics of 'small-world' networks. Nature 393, 4 (June 1998), 440-442.