Abstract
The problem faced in this paper is related to the comparison between two undirected networks on n actors. Actors are in two different configurations G k (k=1,2). Comparison is based on the evaluation of the how the relational node distances evolve in the passage from the first net (G 1 ) to the second net (G 2 ). The procedure consists of two steps: (i) define an appropriate relational distance among nodes of the two networks; (ii) compare the corresponding distance matrices. The first step is based on the so-called Euclidean Commute-Time Distance among the n nodes computed from a random walk on the graph and Laplacian matrix. The second step concerns the comparison between the obtained distance matrices by using Multidimensional Scaling techniques. The procedure has a wide range of application, especially for experimental purposes in social network applications where this issue has not been treated systematically.
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
Preview
Unable to display preview. Download preview PDF.
References
Bai, X., Yu, H., Hancock, E.R.: Graph matching using spectral embedding and alignment. In: Proceeding of the 17th International Conference on Pattern Recognition, Cambridge, pp. 398–401 (2004)
Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling. Springer, New York, NY (2005)
Borgatti, S.P., Everett, M.G., Freeman, L.C.: UCINET 6 for Windows: Software for Statistical Analysis of Social Networks. Analytic Technologies, Harvard, CA (2002)
Bunke, H., Irniger, C., Neuhaus, M.: Graph matching: challenges and potential solutions. In: Roli, F., Vitulano, S. (eds.) ICIAP 2005, Lecture Notes in Computer Science, vol. 3617, pp. 1–10. Springer, Heidelberg (2005)
Chung, F.: Spectral Graph Theory. AMS, New York, NY (1997)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18, 265–298 (2004)
Faust, K.: Comparing social networks: size, density and local structures. Methodoloski Zvezki 3, 185–216 (2006)
Gobel, F., Jagers, A.: Random walks on graph. Stoch. Process. Appl. 2, 311–336 (1974)
Kashima, H., Tsuda, K., Inokuchi, A.: Kernels for graphs. In: Scholkopf, B., Tsuda, K., Vert, J.P. (eds.) Kernel Methods in Computational Biology, Bradford Books, pp. 155–170. The MIT Press, Cambridge, MA (2004)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, New York, NY (1976)
Klein, D.J., Randic, M.: Resistance distance. J. Math. Chem. 12, 81–95 (1974)
Mayo, E.: The Social Problems of an Industrial Civilization. Routledge & Kegan Paul, London (1949)
Saerens, M., Fouss, F.: A novel way of computing similarities between nodes of a graph, with application. Technical report IAG WP 06/08, Université Catholique de Louvain (2006)
Valveny, E., Ferrer, M.: Application of Graph Embedding to Solve Graph Matching Problems. In: CIFED 2008, France (2008)
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Stefano, D. (2011). Spectral Graph Theory Tools for Social Network Comparison. In: Fichet, B., Piccolo, D., Verde, R., Vichi, M. (eds) Classification and Multivariate Analysis for Complex Data Structures. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13312-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-13312-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13311-4
Online ISBN: 978-3-642-13312-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)