@misc{ugander2011anatomy,
  abstract = {We study the structure of the social graph of active Facebook users, the
largest social network ever analyzed. We compute numerous features of the graph
including the number of users and friendships, the degree distribution, path
lengths, clustering, and mixing patterns. Our results center around three main
observations. First, we characterize the global structure of the graph,
determining that the social network is nearly fully connected, with 99.91% of
individuals belonging to a single large connected component, and we confirm the
"six degrees of separation" phenomenon on a global scale. Second, by studying
the average local clustering coefficient and degeneracy of graph neighborhoods,
we show that while the Facebook graph as a whole is clearly sparse, the graph
neighborhoods of users contain surprisingly dense structure. Third, we
characterize the assortativity patterns present in the graph by studying the
basic demographic and network properties of users. We observe clear degree
assortativity and characterize the extent to which "your friends have more
friends than you". Furthermore, we observe a strong effect of age on friendship
preferences as well as a globally modular community structure driven by
nationality, but we do not find any strong gender homophily. We compare our
results with those from smaller social networks and find mostly, but not
entirely, agreement on common structural network characteristics.},
  author = {Ugander, Johan and Karrer, Brian and Backstrom, Lars and Marlow, Cameron},
  interhash = {968abebf69b5959d2837eefcda3a8a32},
  intrahash = {efad3d029704f09829373a443eeefdde},
  note = {cite arxiv:1111.4503Comment: 17 pages, 9 figures, 1 table},
  title = {The Anatomy of the Facebook Social Graph},
  url = {http://arxiv.org/abs/1111.4503},
  year = 2011
}

@article{pham2011development,
  abstract = {In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.},
  address = {Wien},
  affiliation = {Information Systems and Database Technology, RWTH Aachen University, Aachen, Ahornstr. 55, 52056 Aachen, Germany},
  author = {Pham, Manh and Klamma, Ralf and Jarke, Matthias},
  doi = {10.1007/s13278-011-0024-x},
  interhash = {193312234ed176aa8be9f35d4d1c4e72},
  intrahash = {8ae08cacda75da80bfa5604cfce48449},
  issn = {1869-5450},
  journal = {Social Network Analysis and Mining},
  keyword = {Computer Science},
  number = 4,
  pages = {321--340},
  publisher = {Springer},
  title = {Development of computer science disciplines: a social network analysis approach},
  url = {http://dx.doi.org/10.1007/s13278-011-0024-x},
  volume = 1,
  year = 2011
}

@inproceedings{transybil2009,
  author = {Tran, D.N. and Min, B. and Li, J. and Subramanian, L.},
  interhash = {34d39d14be357a65eefa8207a3fb5856},
  intrahash = {40c3dea03e3e4c561db6bc4b34c6f3da},
  organization = {Citeseer},
  title = {Sybil-resilient online content rating},
  url = {http://scholar.google.com/scholar.bib?q=info:YVSgj4tFvzEJ:scholar.google.com/&output=citation&hl=de&as_sdt=0&scfhb=1&ct=citation&cd=0},
  year = 2009
}

@article{Berendt201095,
  author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},
  doi = {DOI: 10.1016/j.websem.2010.04.008},
  interhash = {4969eb2b7bf1fabe60c5f23ab6383d77},
  intrahash = {f8d7bc2af5753906dc3897196daac18c},
  issn = {1570-8268},
  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
  note = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0; The Future of Knowledge Dissemination: The Elsevier Grand Challenge for the Life Sciences},
  number = {2-3},
  pages = {95 - 96},
  title = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0},
  url = {http://www.sciencedirect.com/science/article/B758F-4YXK4HW-1/2/4cb514565477c54160b5e6eb716c32d7},
  volume = 8,
  year = 2010
}

@misc{Kitsak2010,
  abstract = {  Networks portray a multitude of interactions through which people meet, ideas
are spread, and infectious diseases propagate within a society. Identifying the
most efficient "spreaders" in a network is an important step to optimize the
use of available resources and ensure the more efficient spread of information.
Here we show that, in contrast to common belief, the most influential spreaders
in a social network do not correspond to the best connected people or to the
most central people (high betweenness centrality). Instead, we find: (i) The
most efficient spreaders are those located within the core of the network as
identified by the k-shell decomposition analysis. (ii) When multiple spreaders
are considered simultaneously, the distance between them becomes the crucial
parameter that determines the extend of the spreading. Furthermore, we find
that-- in the case of infections that do not confer immunity on recovered
individuals-- the infection persists in the high k-shell layers of the network
under conditions where hubs may not be able to preserve the infection. Our
analysis provides a plausible route for an optimal design of efficient
dissemination strategies.
},
  author = {Kitsak, Maksim and Gallos, Lazaros K. and Havlin, Shlomo and Liljeros, Fredrik and Muchnik, Lev and Stanley, H. Eugene and Makse, Hernan A.},
  interhash = {9545e268e6074cf2edc21693e7bb1b04},
  intrahash = {18a1220e45e38620051a0c9b854d1a28},
  note = {cite arxiv:1001.5285
Comment: 31 pages, 12 figures},
  title = {Identifying influential spreaders in complex networks},
  url = {http://arxiv.org/abs/1001.5285},
  year = 2010
}

@article{trier2009social,
  author = {Trier, M. and Bobrik, A.},
  interhash = {7d6b94d462aca41d1020494fcadca246},
  intrahash = {a446dfd22b95fd3e108fb11caf1669ae},
  journal = {IEEE Internet Computing},
  number = 2,
  pages = {51--59},
  publisher = {IEEE Educational Activities Department Piscataway, NJ, USA},
  title = {{Social Search: Exploring and Searching Social Architectures in Digital Networks}},
  url = {http://scholar.google.de/scholar.bib?q=info:C86yFh53ALEJ:scholar.google.com/&output=citation&hl=de&oi=citation},
  volume = 13,
  year = 2009
}

@article{juliaonline,
  abstract = {Zusammenfassung  Online Social Networks wie Xing.com oder Facebook.com gehören zu den am stärksten wachsenden Diensten im Internet. Im Jahr
2008 nutzten geschätzte 580 Mio. Menschen weltweit diese Angebote. Entsprechend schnell haben sich Online Social Networksinnerhalb weniger Jahre von einem Nischenphänomen zu einem weltweiten Medium der IT-gestützten Kommunikation entwickelt. Insbesondereaufgrund stark wachsender Mitgliederzahlen entfalten Online Social Networks eine erhebliche gesellschaftliche und wirtschaftlicheBedeutung. Vor diesem Hintergrund ist es Ziel dieses Beitrags, Begriff und Eigenschaften, Entstehung und Entwicklung sowieNutzenpotenziale und Herausforderungen von Online Social Networks näher zu untersuchen.},
  author = {Heidemann, Julia},
  interhash = {d535135f1f523873830c4e19f16fdf61},
  intrahash = {602e2e19ec9de91f4f992cd1486bc0df},
  journal = {Informatik-Spektrum},
  pages = {--},
  title = {Online Social Networks – Ein sozialer und technischer Überblick},
  url = {http://dx.doi.org/10.1007/s00287-009-0367-0},
  year = 2009
}

@article{Lerman:2007p3955,
  abstract = {The rise of the social media sites, such as blogs, wikis, Digg and Flickr among others, underscores the transformation of the Web to a participatory medium in which users are collaboratively creating, evaluating and distributing information. The innovations introduced by social media has lead to a new paradigm for interacting with information, what we call 'social information processing'. In this paper, we study how social news aggregator Digg exploits social information processing to solve the problems of document recommendation and rating. First, we show, by tracking stories over time, that social networks play an important role in document recommendation. The second contribution of this paper consists of two mathematical models. The first model describes how collaborative rating and promotion of stories emerges from the independent decisions made by many users. The second model describes how a user's influence, the number of promoted stories and the user's social network, changes in time. We find qualitative agreement between predictions of the model and user data gathered from Digg.},
  author = {Lerman, Kristina},
  date-added = {2008-02-07 01:06:26 +0100},
  date-modified = {2008-02-07 02:25:10 +0100},
  interhash = {aec2fc56edd502101e68e669b50ee17f},
  intrahash = {7a080f640fa62fc81e73b9fab1e7447c},
  journal = {arXiv},
  local-url = {file://localhost/Users/bertilhatt/Documents/Papers/Lerman/2007/Lerman%202007%20arXiv.pdf},
  month = Jan,
  pmid = {11330701288966819101related:HY3tKMq8Pp0J},
  rating = {0},
  read = {Yes},
  title = {Social Information Processing in Social News Aggregation},
  uri = {papers://C3B117CD-23C4-4854-9426-AC96AFB113DA/Paper/p3955},
  url = {http://arxiv.org/abs/cs.CY/0703087},
  year = 2007
}

@article{journals/corr/abs-physics-0602026,
  author = {Capocci, Andrea and Servedio, Vito Domenico Pietro and Colaiori, Francesca and Buriol, Luciana S. and Donato, Debora and Leonardi, Stefano and Caldarelli, Guido},
  date = {2008-01-02},
  ee = {http://arxiv.org/abs/physics/0602026},
  interhash = {88bf1242c692479acc414f633c4bab44},
  intrahash = {3c16ad257c21304d02f1d108571d9c8c},
  journal = {CoRR},
  note = {informal publication},
  title = {Preferential attachment in the growth of social networks: the case of Wikipedia},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0602.html#abs-physics-0602026},
  volume = {abs/physics/0602026},
  year = 2006
}

@inproceedings{hoser2006semantic,
  address = {Budva, Montenegro},
  author = {Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {Proceedings of the 3rd European Semantic Web Conference},
  interhash = {344ec3b4ee8af1a2c6b86efc14917fa9},
  intrahash = {85f032bf2ffe9b1b55f8656c8a0d6d70},
  isbn = {3-540-34544-2},
  month = {June},
  pages = {514-529},
  publisher = {Springer},
  series = {LNCS},
  title = {Semantic Network Analysis of Ontologies},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/hoser_sna_eswc2005.pdf},
  vgwort = {29},
  volume = 4011,
  year = 2006
}

@misc{golder05structure,
  author = {Golder, Scott and Huberman, Bernardo A.},
  citeulike-article-id = {305755},
  eprint = {cs.DL/0508082},
  interhash = {2d312240f16eba52c5d73332bc868b95},
  intrahash = {f852d7a909fa3edceb04abb7d2a20f71},
  month = Aug,
  priority = {2},
  title = {The Structure of Collaborative Tagging Systems},
  url = {http://arxiv.org/abs/cs.DL/0508082},
  year = 2005
}

@inproceedings{jin:07:eswc,
  author = {Jin, YingZi and Matsuo, Yutaka and Ishizuka, Mitsuru},
  booktitle = {Proceedings of the European Semantic Web Conference, ESWC2007},
  editor = {Franconi, Enrico and Kifer, Michael and May, Wolfgang},
  interhash = {cbac61a5d054dbb3d53798e85466464d},
  intrahash = {69e2126f99c29bda2c747bf6aceaaa8f},
  month = {July},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {{Extracting Social Networks among Various Entities on the Web}},
  url = {http://www.eswc2007.org/pdf/eswc07-jin.pdf},
  volume = 4519,
  year = 2007
}

@inproceedings{conf/ceas/KongBRSR05,
  author = {Kong, Joseph S. and Boykin, P. Oscar and Rezaei, Behnam Attaran and Sarshar, Nima and Roychowdhury, Vwani P.},
  booktitle = {CEAS},
  crossref = {conf/ceas/2005},
  date = {2006-06-01},
  ee = {http://www.ceas.cc/papers-2005/143.pdf},
  interhash = {4ff32863da5db6c23c744758b3ccdcbd},
  intrahash = {3d408185c7554a612b00508d618f539c},
  title = {Scalable and Reliable Collaborative Spam Filters: Harnessing the Global Social Email Networks.},
  url = {http://dblp.uni-trier.de/db/conf/ceas/ceas2005.html#KongBRSR05},
  year = 2005
}

@misc{text2006Mehler,
  author = {Mehler, A.},
  booktitle = {Proceedings of the EACL 2006 Workshop on New Text-Wikis and blogs and other dynamic text sources},
  date = {(2006):April 3-7},
  editor = {Jussi, Karlgren},
  interhash = {7b7bd4573d9d121dccb5a489084e06d7},
  intrahash = {be8f323d6ff541a4f6355f8dce8b5790},
  location = {Trento, Italy},
  pages = {1-8},
  title = {Text Linkage in the Wiki Medium-A comparative study},
  url = {http://www.sics.se/jussi/newtext/working_notes/01_mehler.pdf},
  year = 2006
}

@inproceedings{conf/kdd/BackstromHKL06,
  author = {Backstrom, Lars and Huttenlocher, Daniel P. and Kleinberg, Jon M. and Lan, Xiangyang},
  booktitle = {KDD},
  crossref = {conf/kdd/2006},
  date = {2006-10-05},
  editor = {Eliassi-Rad, Tina and Ungar, Lyle H. and Craven, Mark and Gunopulos, Dimitrios},
  ee = {http://doi.acm.org/10.1145/1150402.1150412},
  interhash = {a3cda51b88fd4ff49632bd6b393b5b6b},
  intrahash = {d7f58740d7b63881ba4993d0a576be94},
  isbn = {1-59593-339-5},
  pages = {44-54},
  publisher = {ACM},
  title = {Group formation in large social networks: membership, growth, and evolution.},
  url = {http://dblp.uni-trier.de/db/conf/kdd/kdd2006.html#BackstromHKL06},
  year = 2006
}

@book{surowiecki2004,
  author = {Surowiecki, J.},
  interhash = {18c796739b7555d3aad50d0db1ea0af1},
  intrahash = {b78f7a737aa99ffad5d1862f8ef478ae},
  publisher = {Doubleday},
  title = {The wisdom of crowds},
  year = 2004
}

@article{245123,
  address = {New York, NY, USA},
  author = {Kautz, Henry and Selman, Bart and Shah, Mehul},
  doi = {http://doi.acm.org/10.1145/245108.245123},
  interhash = {6995678b936b33eef9ea1396e53a1fc7},
  intrahash = {ba3606b3aa6c4cf94784db451b28cd68},
  issn = {0001-0782},
  journal = {Commun. ACM},
  number = 3,
  pages = {63--65},
  publisher = {ACM Press},
  title = {Referral Web: combining social networks and collaborative filtering},
  volume = 40,
  year = 1997
}

@misc{citeulike:361498,
  author = {Shen, Kaikai and Wu, Lide},
  citeulike-article-id = {361498},
  eprint = {cs.IR/0509072},
  interhash = {5150a1bb822f3ce4c888e2497eedbd07},
  intrahash = {0a5d7dfd17c6952fe7a07f7756098601},
  month = Sep,
  priority = {2},
  title = {Folksonomy as a Complex Network},
  url = {http://arxiv.org/abs/cs.IR/0509072},
  year = 2005
}

@inproceedings{conf/vldb/GyongyiGP04,
  author = {Gyöngyi, Zoltán and Garcia-Molina, Hector and Pedersen, Jan},
  booktitle = {VLDB},
  ee = {http://www.vldb.org/conf/2004/RS15P3.PDF},
  interhash = {df645e278ec1d72e4576f95ec7bb94c0},
  intrahash = {0d15cc263e9ca534e79c2d6f470f725e},
  pages = {576-587},
  title = {Combating Web Spam with TrustRank.},
  url = {http://dblp.uni-trier.de/db/conf/vldb/vldb2004.html#GyongyiGP04},
  year = 2004
}