Measurement and analysis of online social networks
Online social networking sites like Orkut, YouTube, and Flickr are among the most popular
sites on the Internet. Users of these sites form a social network, which provides a powerful …
sites on the Internet. Users of these sites form a social network, which provides a powerful …
Walking in facebook: A case study of unbiased sampling of osns
With more than 250 million active users, Facebook (FB) is currently one of the most
important online social networks. Our goal in this paper is to obtain a representative …
important online social networks. Our goal in this paper is to obtain a representative …
Practical recommendations on crawling online social networks
Our goal in this paper is to develop a practical framework for obtaining a uniform sample of
users in an online social network (OSN) by crawling its social graph. Such a sample allows …
users in an online social network (OSN) by crawling its social graph. Such a sample allows …
[LIBRO][B] Online social networks: measurement, analysis, and applications to distributed information systems
AE Mislove - 2009 - search.proquest.com
Recently, online social networking sites have exploded in popularity. Numerous sites are
dedicated to finding and maintaining contacts and to locating and sharing different types of …
dedicated to finding and maintaining contacts and to locating and sharing different types of …
On the bias of BFS (breadth first search)
Breadth First Search (BFS) and other graph traversal techniques are widely used for
measuring large unknown graphs, such as online social networks. It has been empirically …
measuring large unknown graphs, such as online social networks. It has been empirically …
Towards unbiased BFS sampling
Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it
has been empirically observed that BFS sampling is biased toward high-degree nodes …
has been empirically observed that BFS sampling is biased toward high-degree nodes …
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks
Our objective is to sample the node set of a large unknown graph via crawling, to accurately
estimate a given metric of interest. We design a random walk on an appropriately defined …
estimate a given metric of interest. We design a random walk on an appropriately defined …
[LIBRO][B] Web corpus construction
R Schäfer, F Bildhauer - 2013 - books.google.com
The World Wide Web constitutes the largest existing source of texts written in a great variety
of languages. A feasible and sound way of exploiting this data for linguistic research is to …
of languages. A feasible and sound way of exploiting this data for linguistic research is to …
Temporal analysis of the wikigraph
Wikipedia is an online encyclopedia, available in more than 100 languages and comprising
over 1 million articles in its English version. If we consider each Wikipedia article as a node …
over 1 million articles in its English version. If we consider each Wikipedia article as a node …
A walk in facebook: Uniform sampling of users in online social networks
Our goal in this paper is to develop a practical framework for obtaining a uniform sample of
users in an online social network (OSN) by crawling its social graph. Such a sample allows …
users in an online social network (OSN) by crawling its social graph. Such a sample allows …