Analysis of Large Graphs

  • K. Erciyes
Part of the Texts in Computer Science book series (TCS)


Analysis of these graphs requires introduction of new parameters and methods conceptually different than the ones used for relatively smaller graphs. We describe new parameters and methods for the analysis of these graphs and also describe various models to represent them in this chapter. Two widely used models for the large graphs representing real networks are small-world and scale-free models. The former means the average distance between any two nodes in large graphs is small and only few nodes with high degrees exist with majority of the nodes having low degrees in the latter.


  1. 1.
    Barabasi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512MathSciNetCrossRefGoogle Scholar
  2. 2.
    Batagelj V, Zaversnik M (2003) An O(m) algorithm for cores decomposition of networks. CoRR (Computing research repository), arXiv:0310049
  3. 3.
    Blaar H, Karnstedt M, Lange T, Winter R (2005) Possibilities to solve the clique problem by thread parallelism using task pools. In: Proceedings of the 19th IEEE international parallel and distributed processing symposium (IPDPS05)Workshop 5 Volume 06 in GermanyGoogle Scholar
  4. 4.
    Boccaletti S, Latorab V, Morenod Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577CrossRefGoogle Scholar
  6. 6.
    Erciyes K (2015) Distributed and sequential algorithms for bioinformatics. Springer, Berlin (chapters 10–11)Google Scholar
  7. 7.
    Erdos P, Renyi A (1959) On random graphs. Publicationes Mathematicae 6:290–297MathSciNetzbMATHGoogle Scholar
  8. 8.
    Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17–61MathSciNetzbMATHGoogle Scholar
  9. 9.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W H Freeman and company, New YorkzbMATHGoogle Scholar
  10. 10.
    Jaber K, Rashid NA, Abdullah R (2009) The parallel maximal cliques algorithm for protein sequence clustering. Am J Appl Sci 6:13681372Google Scholar
  11. 13.
    Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113CrossRefGoogle Scholar
  12. 14.
    Newman MEJ, Strogatz SH, Watts DJ (2002) Random graph models of social networks. Proc Natl Acad Sci USA 99:25662572CrossRefGoogle Scholar
  13. 15.
    Özgr A, Vu T, Erkan G, Radev DR (2008) Identifying gene-disease associations using centrality on a literature mined geneinteraction network. Bioinformatics 24(13):277–285CrossRefGoogle Scholar
  14. 16.
    Perron O (1907) Mathematische Annalen. Zur Theorie der Matrices 64(2):248–263Google Scholar
  15. 17.
    Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabsi AL (2002) Hierarchical organization of modularity in metabolic networks. Science 297:15511555CrossRefGoogle Scholar
  16. 18.
    Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1:2764CrossRefGoogle Scholar
  17. 19.
    Schmidt MC, Samatova NF, Thomas K, Park B-H (2009) A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69:417428CrossRefGoogle Scholar
  18. 21.
    Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393:440442CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.International Computer InstituteEge UniversityIzmirTurkey

Personalised recommendations