Synonyms
Overview
Graphs are one of the basic representation tools in many fields of pure and applied science, useful to model a variety of different situations and phenomena. Besides the ubiquity of graphs as a representation tool, the emergence of social networking and social media has given a new strong impetus to the field of “social network analysis” and, more generally, to what is called “link analysis.” In a nutshell, link analysis aims at studying the graph structure in order to unveil properties, discover relations, and highlight pattern and trends. This process can be seen as a special type of data mining (Chakrabarti et al. 2006), sometimes referred to as...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anthonisse JM (1971) The rush in a directed graph. Technical Report BN 9/71, Mathematical Centre, Amsterdam
Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512
Bavelas A (1948) A mathematical model for group structures. Hum Organ 7:16–30
Berge C (1958) Théorie des graphes et ses applications. Dunod, Paris
Berge C (1984) Hypergraphs: combinatorics of finite sets, vol 45. Elsevier, North Holland
Boldi P, Vigna S (2014) Axioms for centrality. Internet Math 10(3–4):222–262
Bollobás B (1998) Modern graph theory. Graduate texts in mathematics. Springer, Heidelberg
Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30(1):107–117
Chakrabarti S, Ester M, Fayyad U, Gehrke J, Han J, Morishita S, Piatetsky-Shapiro G, Wang W (2006) Data mining curriculum: a proposal (version 1.0). In: Intensive working group of ACM SIGKDD curriculum committee, p 140
Craswell N, Hawking D, Upstill T (2003) Predicting fame and fortune: PageRank or indegree? In: In Proceedings of the Australasian document computing symposium, ADCS2003, pp 31–40
Cvetkovic D, Rowlinson P (2004) Spectral graph theory. In: Beineke LW, Wilson RJ, Cameron PJ (eds) Topics in algebraic graph theory, vol 102. Cambridge University Press, Cambridge, p 88
Diestel R (2012) Graph theory, 4th edn. Graduate texts in mathematics, vol 173. Springer, New York
Erdős P, Rényi A (1959) On random graphs, I. Publicationes Mathematicae (Debrecen) 6:290–297
Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41
Gross JL, Tucker TW (1987) Topological graph theory. Series in discrete mathematics and optimization. Wiley, New York
Harris CD (1954) The market as a factor in the localization of industry in the United States. Ann Assoc Am Geogr 44(4):315–348
Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 992–1000
Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43
Lovász L (2012) Large networks and graph limits. Colloquium publications, vol 60. American Mathematical Society, Providence
Newman M (2003) The structure and function of complex networks. SIAM Rev 45:167–256
Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford/New York
Vigna S (2016) Spectral ranking. Netw Sci 4(4):433–445
Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393(6684):440–442
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this entry
Cite this entry
Boldi, P. (2019). Graph Invariants. In: Sakr, S., Zomaya, A.Y. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-77525-8_77
Download citation
DOI: https://doi.org/10.1007/978-3-319-77525-8_77
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77524-1
Online ISBN: 978-3-319-77525-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering