All Research Areas
Research Areas
Year Published

95 Results

February 6, 2013

Balanced Label Propagation for Partitioning Massive Graphs

ACM International Conference on Web Search and Data Mining (WSDM)

Partitioning graphs at scale is a key challenge for any application that involves distributing a graph across disks, machines, or data centers. Graph partitioning is a very well studied problem with a…

By: Johan Ugander, Lars Backstrom
February 5, 2013

Yahtzee: An Anonymized Group Level Matching Procedure


Researchers often face the problem of needing to protect the privacy of subjects while also needing to integrate data that contains personal information from diverse data sources. The advent of comput…

By: Jason J. Jones, Robert Bond, Christopher J. Fariss, Jaime Settle, Adam D. I. Kramer, Cameron Marlow
January 2, 2013

Inferring Tie Strength from Online Directed Behavior


Some social connections are stronger than others. People have not only friends, but also best friends. Social scientists have long recognized this characteristic of social connections and researchers frequently use the term ‘tie strength’ to refer to this concept. We used online interaction data (specifically, Facebook interactions) to successfully identify real-world strong ties.

By: Jason J. Jones, Jaime Settle, Robert Bond, Christopher J. Fariss, Cameron Marlow
September 13, 2012

A 61-million-person experiment in social influence and political mobilization


Human behaviour is thought to spread through face-to-face social networks, but it is difficult to identify social influence effects in observational studies, and it is unknown whether online social ne…

By: Robert Bond, Christopher J. Fariss, Jason J. Jones, Adam D. I. Kramer, Cameron Marlow, Jaime Settle
June 22, 2012

Four Degrees of Separation

ACM Web Science Conference (WebSci)

Frigyes Karinthy, in his 1929 short story “Lancszemek” (in English, “Chains”) suggested that any two persons are distanced by at most six friendship links. Stanley Milgram in his famous experiments challenged people to route postcards to a fixed recipient by passing them only through direct acquaintances. Milgram found that the average number of intermediaries on the path of the postcards lay between 4.4 and 5.7, depending on the sample of people chosen.

By: Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna
June 8, 2012

Social Influence in Social Advertising: Evidence from Field Experiments

ACM Conference on Electronic Commerce (EC)

Social advertising uses information about consumers’ peers, including peer affiliations with a brand, product, organization, etc., to target ads and contextualize their display. This approach can incr…

By: Eytan Bakshy, Dean Eckles, Rong Yan, Itamar Rosenn
May 16, 2012

The spread of emotion via Facebook

ACM Conference on Human Factors in Computing Systems (CHI)

In this paper we study large-scale emotional contagion through an examination of Facebook status updates. After a user makes a status update with emotional content, their friends are significantly more likely to make a valence-consistent post.

By: Adam D. I. Kramer
April 17, 2012

Structural Diversity in Social Contagion

Proceedings of the National Academy of Sciences (PNAS)

The concept of contagion has steadily expanded from its original grounding in epidemic disease to describe a vast array of processes that spread across networks, notably social phenomena such as fads,…

By: Johan Ugander, Lars Backstrom, Cameron Marlow, Jon Kleinberg
April 16, 2012

The Role of Social Networks in Information Diffusion

International World Wide Web Conference (WWW)

Online social networking technologies enable individuals to simultaneously share information with any number of peers. Quantifying the causal effect of these mediums on the dissemination of informatio…

By: Eytan Bakshy, Itamar Rosenn, Cameron Marlow, Lada Adamic
March 1, 2012

Bootstrapping Data Arrays of Arbitrary Order

The Annals of Applied Statistics (AOAS)

In this paper we study a bootstrap strategy for estimating the variance of a mean taken over large multifactor crossed random effects data sets. We apply bootstrap reweighting independently to the lev…

By: Art B. Owen, Dean Eckles