Abstract
Social networks are the focus of a large body of research. A number of popular email encryption tools make use of online directories to store public key information. These can be used to build a social network of people connected by email relationships. Since these directories contain creation and expiration time-stamps, the corresponding network can be built and analysed dynamically. At any given point, a snapshot of the current state of the model can be observed and traditional metrics evaluated and compared with the state of the model at other times.
We show that, with this described data set, simple traditional predictive measures do vary with time. Moreover, singular events pertinent to the participants in the social network (such as conferences) can be correlated with or implied by significant changes in these measures. This provides evidence that the dynamic behaviour of social networks should not be ignored, either when analysing a real model or when attempting to generate a synthetic model.
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
Wilson, R.J.: Introduction to graph theory. John Wiley & Sons, Chichester (1986)
Gross, J.L., Yellen, J. (eds.): Handbook of graph theory. Discrete mathematics and its applications. CRC press, Boca Raton (2004)
Wasserman, S., Faust, K.: Social network analysis: methods and applications. Cambridge University Press, Cambridge (1994)
Carrington, P.J., Scott, J., Wasserman, S. (eds.): Models and methods in social network analysis. Cambridge University Press, Cambridge (2005)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)
Milgram, S.: The small world problem. Psycology Today (1), 61–67 (1967)
Watts, D.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)
Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)
Hannerman, R.A.: Introduction to Social Network Methods. Department of Sociology, University of California (2001)
Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized trust management. In: IEEE Symposium on Security and Privacy, pp. 164–173 (1996)
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A.: Graph structure in the web: Experiments and models. In: 9th World Wide Web Conference (2000)
Feld, S.L., Elmore, R.: Patterns of sociometric choices: Transitivity reconsidered. Social Psychology Quarterly 45(2), 77–85 (1982)
MacKinnon, I., Warren, R.H.: Age and geographic analysis of the livejournal social network. Technical Report CS-2006-12, School of Computer Science, University of Waterloo (2006)
Kumar, R., Novak, J., Raghavan, P., Tomkins, A.: Structure and evolution of blogspace. Commun. ACM 47(12), 35–39 (2004)
Borisov, N., Goldberg, I., Brewer, E.: Off-the-record communication, or, why not to use pgp. In: Workshop on Privacy in the Electronic Society (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Warren, R.H., Wilkinson, D., Warnecke, M. (2007). Empirical Analysis of a Dynamic Social Network Built from PGP Keyrings. In: Airoldi, E., Blei, D.M., Fienberg, S.E., Goldenberg, A., Xing, E.P., Zheng, A.X. (eds) Statistical Network Analysis: Models, Issues, and New Directions. ICML 2006. Lecture Notes in Computer Science, vol 4503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73133-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-73133-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73132-0
Online ISBN: 978-3-540-73133-7
eBook Packages: Computer ScienceComputer Science (R0)