A review of Facebook research in the social sciences

RE Wilson, SD Gosling… - … on psychological science, 2012 - journals.sagepub.com
With over 800 million active users, Facebook is changing the way hundreds of millions of
people relate to one another and share information. A rapidly growing body of research has …

Understanding user behavior in online social networks: A survey

L **, Y Chen, T Wang, P Hui… - IEEE communications …, 2013 - ieeexplore.ieee.org
Currently, online social networks such as Facebook, Twitter, Google+, LinkedIn, and
Foursquare have become extremely popular all over the world and play a significant role in …

Network sampling: From static to streaming graphs

NK Ahmed, J Neville, R Kompella - ACM Transactions on Knowledge …, 2013 - dl.acm.org
Network sampling is integral to the analysis of social, information, and biological networks.
Since many real-world networks are massive in size, continuously evolving, and/or …

Enterprise: breadth-first graph traversal on GPUs

H Liu, HH Huang - Proceedings of the International Conference for High …, 2015 - dl.acm.org
The Breadth-First Search (BFS) algorithm serves as the foundation for many graph-
processing applications and analytics workloads. While Graphics Processing Unit (GPU) …

Workload characterization: A survey revisited

MC Calzarossa, L Massari, D Tessera - ACM Computing Surveys (CSUR …, 2016 - dl.acm.org
Workload characterization is a well-established discipline that plays a key role in many
performance engineering studies. The large-scale social behavior inherent in the …

On Facebook, most ties are weak

P De Meo, E Ferrara, G Fiumara, A Provetti - Communications of the …, 2014 - dl.acm.org
On Facebook, most ties are weak Page 1 78 COMMUNICATIONS OF THE ACM | NOVEMBER
2014 | VOL. 57 | NO. 11 contributed articles On Facebook, Most Ties Are Weak …

Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling

CH Lee, X Xu, DY Eun - ACM SIGMETRICS Performance evaluation …, 2012 - dl.acm.org
Graph sampling via crawling has been actively considered as a generic and important tool
for collecting uniform node samples so as to consistently estimate and uncover various …

Making friends and communicating on Facebook: Implications for the access to social capital

A Bohn, C Buchta, K Hornik, P Mair - Social Networks, 2014 - Elsevier
In this paper, we explore the dynamics of access to social capital on Facebook. Existing
approaches to network-based social capital measures are adapted to the case of Facebook …

Tricore: Parallel triangle counting on gpus

Y Hu, H Liu, HH Huang - SC18: International Conference for …, 2018 - ieeexplore.ieee.org
Exact triangle counting algorithm enumerates the triangles in a graph by identifying the
common neighbors of two vertices of each edge. In this work, we present TriCore, a scalable …

On random walk based graph sampling

RH Li, JX Yu, L Qin, R Mao, T ** - 2015 IEEE 31st international …, 2015 - ieeexplore.ieee.org
Random walk based graph sampling has been recognized as a fundamental technique to
collect uniform node samples from a large graph. In this paper, we first present a …