Synonyms
Glossary
- Adjacency Matrix:
-
A characteristic matrix of a social network, typically denoted A. If the social network contains n persons, the adjacency matrix is a 0/1 n × n that contains 1 in the entries A ij that correspond to an edge {i, j} and 0 otherwise
- Eigenvalue Decomposition:
-
A decomposition of a square matrix giving A = UAU T, in which U contains the eigenvectors of A and Λ contains the eigenvalues
- Singular Value Decomposition:
-
A decomposition of any matrix giving A = U∑V T, in which ∑ contains the singular values of A
- Spectral Evolution Model:
-
The model that states that over time, eigenvectors stay constant and eigenvalues change
- Spectrum:
-
The set of eigenvalues or singular values of a matrix
Definition
The term spectral evolution describes a model of the evolution of network based on matrix decompositions. When applied to social networks, this model can be used to predict friendships, recommend friends, and implement other learning problems.
Introduction...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30(1–7): 107–117
Chung F (1997) Spectral graph theory. Am Math Soc
Cvetković D, Rowlinson P, Simic S (1997) Eigenspaces of graphs. Cambridge University Press, Cambridge
Harshman RA (1978) Models for analysis of asymmetrical relationships among n objects or stimuli. In: Proceedings of the first meeting of the psychometric society and the society for mathematical psychology, Hamilton, Ontario, Canada
Kandola J, Shawe-Taylor J, Cristianini N (2002) Learning semantic similarity. In: Advances in neural information processing systems, Whistler, British Columbia, Canada, pp 657–664
Kondor R, Lafferty J (2002) Diffusion kernels on graphs and other discrete structures. In: Proceedings of the international conference on machine learning, Sidney, Australia, pp 315–322
Kunegis J (2011) On the spectral evolution of large networks. PhD thesis, University of Koblenz–Landau. http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-phd-thesis-on-the-spectral-evolution-of-large-networks.pdf
Kunegis J, Lommatzsch A (2009) Learning spectral graph transformations for link prediction. In: Proceedings of the international conference on machine learning, Montréal, Québec, Canada, pp 561–568. http://uni-koblenz.de/~kunegis/paper/kunegis-spectral-transformation.pdf
Kunegis J, De Luca EW, Albayrak S (2010a) The link prediction problem in bipartite networks. In: Proceeding of the international conference in information processing and management of uncertainty in knowledge-based systems, Dortmund, Germany, pp 380–389. http://uni-koblenz.de/~kunegis/paper/kunegis-hyperbolic-sine.pdf
Kunegis J, Fay D, Bauckhage C (2010b) Network growth and the spectral evolution model. In: Proceeding of the international conference on information and knowledge management, Toronto, Ontario, Canada, pp 739–748. http://uni-koblenz.de/~kunegis/paper/kunegis-spectral-network-evolution.pdf
Kunegis J, Schmidt S, Lommatzsch A, Lerner J (2010c) Spectral analysis of signed graphs for clustering, prediction and visualization. In: Proceedings SIAM international conferences on data mining, Columbus, Ohio, USA, pp 559–570. http://uni-koblenz.de/~kunegis/paper/kunegis-spectral-analysis-of-signed-graphs.pdf
Kunegis J, Sizov S, Schwagereit F, Fay D (2012) Diversity dynamics in online networks. In: Proceedings of the conference on hypertext and social media, Milwaukee, Wisconsin, USA, pp 255–264. http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-diversity-dynamics-in-online-networks.pdf
Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings international conference on information and knowledge management, New Orleans, Louisiana, USA, pp 556–559
Luxburg Uv (2007) A tutorial on spectral clustering. Stat Comput 17(4):395–416
Mohar B (1991) The Laplacian spectrum of graphs. Graph Theory Combin Appl 2:871–898
Stewart GW (1990) Perturbation theory for the singular value decomposition. Tech. rep., University of Maryland, College Park
Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: Proceeding of the workshop on online social networks, Barcelona, Spain, pp 37–42
Wedin PÅ (1972) Perturbation bounds in connection with singular value decomposition. BIT Numer Math 12(1):99–111
Weyl H (1912) Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differenzialgleichungen (mit einer Anwendung auf die Theorie der Hohlraum-strahlung). Math Ann 71(4):441–479
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this entry
Cite this entry
Kunegis, J. (2014). Spectral Evolution of Social Networks. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6170-8_125
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6170-8_125
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6169-2
Online ISBN: 978-1-4614-6170-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering