Abstract
Most of the real social networks extracted from various data sources evolve and change their profile over time. For that reason, there is a great need to model evolution of networks in order to enable complex analyses of theirs dynamics. The model presented in the paper focuses on definition of differences between following network snapshots by means of Graph Differential Tuple.
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
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8), 689–694 (1997)
Eroh, L., Schultz, M.: Matching graphs. Journal of Graph Theory 29(2), 73–86 (1998)
Kazienko, P., Bródka, P., Musiał, K., Gaworecki, J.: Multi-layered Social Network Creation Based on Bibliographic Data. In: SocialCom 2010, pp. 407–412. IEEE Computer Society Press, Los Alamitos (2010)
Kazienko, P., Bródka, P., Musiał, K.: Individual Neighbourhood Exploration in Complex Multi-layered Social Network. In: WI-IAT 2010, pp. 5–8. IEEE Computer Society Press, Los Alamitos (2010)
Zager, L.: Graph Similarity and Matching. MIT Thesis, USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michalski, R., Palus, S., Bródka, P., Kazienko, P., Juszczyszyn, K. (2011). Modelling Social Network Evolution. In: Datta, A., Shulman, S., Zheng, B., Lin, SD., Sun, A., Lim, EP. (eds) Social Informatics. SocInfo 2011. Lecture Notes in Computer Science, vol 6984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24704-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-24704-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24703-3
Online ISBN: 978-3-642-24704-0
eBook Packages: Computer ScienceComputer Science (R0)