@article{cattuto2007network,
  author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd},
  editor = {Hoche, Susanne and Nürnberger, Andreas and Flach, Jürgen},
  interhash = {fc5f2df61d28bc99b7e15029da125588},
  intrahash = {da6c676c5664017247c7564fc247b190},
  issn = {0921-7126},
  journal = {AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''},
  number = 4,
  pages = {245-262},
  publisher = {IOS Press},
  title = {Network Properties of Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/cattuto2007network.pdf},
  vgwort = {67},
  volume = 20,
  year = 2007
}

@inproceedings{1526808,
  abstract = {In this paper we give models and algorithms to describe and analyze the collaboration among authors of Wikipedia from a network analytical perspective. The edit network encodes who interacts how with whom when editing an article; it significantly extends previous network models that code author communities in Wikipedia. Several characteristics summarizing some aspects of the organization process and allowing the analyst to identify certain types of authors can be obtained from the edit network. Moreover, we propose several indicators characterizing the global network structure and methods to visualize edit networks. It is shown that the structural network indicators are correlated with quality labels of the associated Wikipedia articles.},
  address = {New York, NY, USA},
  author = {Brandes, Ulrik and Kenis, Patrick and Lerner, J\"{u}rgen and van Raaij, Denise},
  booktitle = {WWW '09: Proceedings of the 18th international conference on World wide web},
  doi = {http://doi.acm.org/10.1145/1526709.1526808},
  interhash = {1d0c41c49ae3821dbde05fe6e34d0a4a},
  intrahash = {3569586bacbec77f6da6db5461db7857},
  isbn = {978-1-60558-487-4},
  location = {Madrid, Spain},
  pages = {731--740},
  publisher = {ACM},
  title = {Network analysis of collaboration structure in Wikipedia},
  url = {http://portal.acm.org/citation.cfm?id=1526808},
  year = 2009
}

@inproceedings{1367620,
  abstract = {We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft Messenger instant-messaging system. We examine characteristics and patterns that emerge from the collective dynamics of large numbers of people, rather than the actions and characteristics of individuals. The dataset contains summary properties of 30 billion conversations among 240 million people. From the data, we construct a communication graph with 180 million nodes and 1.3 billion undirected edges, creating the largest social network constructed and analyzed to date. We report on multiple aspects of the dataset and synthesized graph. We find that the graph is well-connected and robust to node removal. We investigate on a planetary-scale the oft-cited report that people are separated by "six degrees of separation" and find that the average path length among Messenger users is 6.6. We find that people tend to communicate more with each other when they have similar age, language, and location, and that cross-gender conversations are both more frequent and of longer duration than conversations with the same gender.},
  address = {New York, NY, USA},
  author = {Leskovec, Jure and Horvitz, Eric},
  booktitle = {WWW '08: Proceeding of the 17th international conference on World Wide Web},
  doi = {http://doi.acm.org/10.1145/1367497.1367620},
  interhash = {27d7144813bb85492b18cad6cf6525e7},
  intrahash = {bfe758ce74fac01c2108c3f2184d6c48},
  isbn = {978-1-60558-085-2},
  location = {Beijing, China},
  pages = {915--924},
  publisher = {ACM},
  title = {Planetary-scale views on a large instant-messaging network},
  url = {http://portal.acm.org/citation.cfm?id=1367620},
  year = 2008
}

@inproceedings{zheleva2009join,
  abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.},
  address = {New York, NY, USA},
  author = {Zheleva, Elena and Getoor, Lise},
  booktitle = {WWW '09: Proceedings of the 18th International Conference on World Wide Web},
  doi = {10.1145/1526709.1526781},
  interhash = {4726d0a13b0337998d6d0f54fc5c26e9},
  intrahash = {25e6c200ace070886f01d7d30957b504},
  isbn = {978-1-60558-487-4},
  location = {Madrid, Spain},
  month = apr,
  pages = {531--540},
  publisher = {ACM},
  title = {To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles},
  url = {http://portal.acm.org/citation.cfm?id=1526709.1526781&coll=GUIDE&dl=acm&type=series&idx=SERIES968&part=series&WantType=Proceedings&title=WWW},
  year = 2009
}

@misc{candia-2007,
  abstract = { Novel aspects of human dynamics and social interactions are investigated by means of mobile phone data. Using extensive phone records resolved in both time and space, we study the mean collective behavior at large scales and focus on the occurrence of anomalous events. We discuss how these spatiotemporal anomalies can be described using standard percolation theory tools. We also investigate patterns of calling activity at the individual level and show that the interevent time of consecutive calls is heavy-tailed. This finding, which has implications for dynamics of spreading phenomena in social networks, agrees with results previously reported on other human activities.},
  author = {Candia, J. and Gonzalez, M. C. and Wang, P. and Schoenharl, T. and Madey, G. and Barabasi, A. L.},
  interhash = {16dacb08d5f7c4e2b9876ecba8a99a41},
  intrahash = {ea8b6a4442ccc0cb7dd222f6bd1d992a},
  title = {Uncovering individual and collective human dynamics from mobile phone records},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0710.2939},
  year = 2007
}

@inproceedings{Brandes07Role,
  abstract = {Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.},
  author = {Brandes, Ulrik and Lerner, Jürgen},
  booktitle = {ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities},
  editor = {Obiedkov, Sergei and Roth, Camille},
  interhash = {38a2ada146d754d86889068e548316ec},
  intrahash = {6ea541158f972b850e9ea330b473c7c4},
  title = {Role-equivalent Actors in Networks},
  url = {http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf},
  year = 2007
}