activity
20152021
most citedAssembling thefacebook: Using heterogeneity to understand online social network assembly

40 citations · 62 across the 8 of their papers we have counts for

collaborators
Showing cs.SIShow all

8 papers · 1 filter

cs.SI20211 cited

How to Quantify Polarization in Models of Opinion Dynamics

Christopher Musco, Indu Ramesh, Johan Ugander +1

It is widely believed that society is becoming increasingly polarized around important issues, a dynamic that does not align with common mathematical models of opinion formation in…

cs.SI2020

Prioritized Restreaming Algorithms for Balanced Graph Partitioning

Amel Awadelkarim, Johan Ugander

Balanced graph partitioning is a critical step for many large-scale distributed computations with relational data. As graph datasets have grown in size and density, a range of high…

cs.SI2020

Scaling Choice Models of Relational Social Data

Jan Overgoor, George Pakapol Supaniratisai, Johan Ugander

Many prediction problems on social networks, from recommendations to anomaly detection, can be approached by modeling network data as a sequence of relational events and then lever…

cs.SI2019

An Experimental Study of Structural Diversity in Social Networks

Jessica Su, Krishna Kamath, Aneesh Sharma +2

Several recent studies of online social networking platforms have found that adoption rates and engagement levels are positively correlated with structural diversity, the degree of…

cs.SI2019

Measuring Directed Triadic Closure with Closure Coefficients

Hao Yin, Austin R. Benson, Johan Ugander

Recent work studying triadic closure in undirected graphs has drawn attention to the distinction between measures that focus on the "center" node of a wedge (i.e., length-2 path) v…

cs.SI2018

Choosing to Grow a Graph: Modeling Network Formation as Discrete Choice

Jan Overgoor, Austin R. Benson, Johan Ugander

We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is…