Giant component and connectivity in geographical threshold graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4863 LNCS, Issue , 2007, Pages 209-216

  Bradonjic, Milan ^a   Hagberg, Aric ^b   Percus, Allon G ^c,d  

^a Department of Civil and Environmental Engineering   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Connectivity; Geographical threshold graph; Giant component; Random graph

Indexed keywords

MATHEMATICAL MODELS; RANDOM PROCESSES;

CONNECTIVITY; GEOGRAPHICAL THRESHOLD GRAPHS; GIANT COMPONENTS; RANDOM GRAPHS;

GRAPH THEORY;

EID: 38149024983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_18     Document Type: Conference Paper

References (18)

1. Bonato, A.: A survey of models of the web graph. In: López-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol. 3405, pp. 159-172. Springer, Heidelberg (2005)
2. Abello, J., Pardalos, P.M., Resende, M.G.C., (eds.): Handbook of massive data sets. Kluwer Academic Publishers, Norwell, MA (2002)
3. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM 1999: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 251-262. ACM Press, New York (1999)
4. Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The web as a graph: Measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 1-17. Springer, Heidelberg (1999)
5. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 57. IEEE Computer Society, Los Alamitos (2000)
6. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509-512 (1999)
7. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 171-180. ACM Press, New York (2000)
8. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18, 279-290 (2001)
9. Cooper, C., Frieze, A.M.: A general model of undirected Web graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 500-511. Springer, Heidelberg (2001)
10. Bradonjic, M., Kong, J.: Wireless ad hoc networks with tunable topology. In: Proceedings of the 45th Annual Allerton Conference on Communication, Control and Computing (to appear, 2007)
11. Erdõs, P., Rényi, A.: On random graphs. Publ. Math. Inst. Hungar. Acad. Sci. (1959)
12. Erdõs, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. (1960)
13. Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
14. Mahadev, N. V.R., Peled, U.N.: Threshold graphs and related topics. Annals of discrete mathematics, vol. 56. Elsevier, New York (1995)
15. Hagberg, A., Swart, P.J., Schult, D.A.: Designing threshold networks with given structural and dynamical properties. Phys. Rev. E 74, 056116 (2006)
16. Masuda, N., Miwa, H., Konno, N.: Geographical threshold graphs with small-world and scale-free properties. Physical Review E 71, 036108 (2005)
17. Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. John Wiley & Sons, Inc., New York (2000)
18. Gupta, P., Kumar, P.R. : Critical power for asymptotic connectivity. In: Proceedings of the 37th IEEE Conference on Decision and Control, vol. 1, pp. 1106-1110 (1998)