default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohan Ugander
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
The Moderating Effect of Instant Runoff Voting. AAAI 2024: 9909-9917- [c35]Serina Chang, Frederic Koehler, Zhaonan Qu, Jure Leskovec, Johan Ugander:
Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting. ICML 2024 - [c34]Samir Khan, Martin Saveski, Johan Ugander:
Off-policy Evaluation Beyond Overlap: Sharp Partial Identification Under Smoothness. ICML 2024 - [c33]Amel Awadelkarim
, Johan Ugander:
Statistical Models of Top-k Partial Orders. KDD 2024: 39-48 - [i37]Kiran Tomlinson, Tanvi Namjoshi, Johan Ugander, Jon M. Kleinberg:
Replicating Electoral Success. CoRR abs/2402.17109 (2024) - [i36]Serina Chang, Frederic Koehler, Zhaonan Qu, Jure Leskovec, Johan Ugander:
Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting. CoRR abs/2402.18697 (2024) - [i35]David Liu, Arjun Seshadri, Tina Eliassi-Rad, Johan Ugander:
Re-visiting Skip-Gram Negative Sampling: Dimension Regularization for More Efficient Dissimilarity Preservation in Graph Embeddings. CoRR abs/2405.00172 (2024) - [i34]Amel Awadelkarim, Johan Ugander:
Statistical Models of Top-k Partial Orders. CoRR abs/2406.15893 (2024) - 2023
- [c32]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Ballot Length in Instant Runoff Voting. AAAI 2023: 5841-5849 - [c31]Serina Chang, Damir Vrabac, Jure Leskovec, Johan Ugander:
Estimating Geographic Spillover Effects of COVID-19 Policies from Large-Scale Mobility Networks. AAAI 2023: 14161-14169 - [c30]Amel Awadelkarim, Arjun Seshadri, Itai Ashlagi, Irene Lo, Johan Ugander:
Rank-heterogeneous Preference Models for School Choice. KDD 2023: 47-56 - [c29]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. NeurIPS 2023 - [i33]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Moderation in instant runoff voting. CoRR abs/2303.09734 (2023) - [i32]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. CoRR abs/2305.17339 (2023) - [i31]Izabel Aguiar, Johan Ugander:
The latent cognitive structures of social networks. CoRR abs/2309.11639 (2023) - [i30]Zhaonan Qu, Alfred Galichon, Johan Ugander:
On Sinkhorn's Algorithm and Choice Modeling. CoRR abs/2310.00260 (2023) - [i29]Arjun Seshadri, Stephen Ragain, Johan Ugander:
Learning Rich Rankings. CoRR abs/2312.15081 (2023) - 2022
- [j5]Alex Chin, Dean Eckles, Johan Ugander:
Evaluating Stochastic Seeding Strategies in Networks. Manag. Sci. 68(3): 1714-1736 (2022) - [c28]Serina Chang, Johan Ugander:
To Recommend or Not? A Model-Based Comparison of Item-Matching Processes. ICWSM 2022: 55-66 - [i28]Izabel Aguiar, Dane Taylor, Johan Ugander:
A factor model of multilayer network interdependence. CoRR abs/2206.01804 (2022) - [i27]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Ballot length in instant runoff voting. CoRR abs/2207.08958 (2022) - [i26]Serina Chang, Damir Vrabac, Jure Leskovec, Johan Ugander:
Estimating Geographic Spillover Effects of COVID-19 Policies From Large-Scale Mobility Networks. CoRR abs/2212.06224 (2022) - 2021
- [c27]Kristen M. Altenburger, Johan Ugander:
Which Node Attribute Prediction Task Are We Solving? Within-Network, Across-Network, or Across-Layer Tasks. ICWSM 2021: 38-48 - [c26]William Cai, Johan Ugander:
Experience-Driven Peer Effects: Evidence from a Large Natural Experiment. ICWSM 2021: 95-104 - [c25]Kiran Tomlinson, Johan Ugander, Austin R. Benson:
Choice Set Confounding in Discrete Choice. KDD 2021: 1571-1581 - [i25]Kiran Tomlinson, Johan Ugander, Austin R. Benson:
Choice Set Confounding in Discrete Choice. CoRR abs/2105.07959 (2021) - [i24]Serina Chang, Johan Ugander:
To Recommend or Not? A Model-Based Comparison of Item-Matching Processes. CoRR abs/2110.11468 (2021) - [i23]Christopher Musco, Indu Ramesh, Johan Ugander, R. Teal Witter:
How to Quantify Polarization in Models of Opinion Dynamics. CoRR abs/2110.11981 (2021) - 2020
- [j4]Hao Yin, Austin R. Benson, Johan Ugander:
Measuring directed triadic closure with closure coefficients. Netw. Sci. 8(4): 551-573 (2020) - [c24]Jessica Su, Krishna Kamath, Aneesh Sharma, Johan Ugander, Sharad Goel:
An Experimental Study of Structural Diversity in Social Networks. ICWSM 2020: 661-670 - [c23]Amel Awadelkarim, Johan Ugander:
Prioritized Restreaming Algorithms for Balanced Graph Partitioning. KDD 2020: 1877-1887 - [c22]Jan Overgoor, George Pakapol Supaniratisai, Johan Ugander:
Scaling Choice Models of Relational Social Data. KDD 2020: 1990-1998 - [c21]Arjun Seshadri, Stephen Ragain, Johan Ugander:
Learning Rich Rankings. NeurIPS 2020 - [i22]Jan Overgoor, George Pakapol Supaniratisai, Johan Ugander:
Scaling Choice Models of Relational Social Data. CoRR abs/2006.10003 (2020) - [i21]Amel Awadelkarim, Johan Ugander:
Prioritized Restreaming Algorithms for Balanced Graph Partitioning. CoRR abs/2007.03131 (2020) - [i20]Johan Ugander, Hao Yin:
Randomized Graph Cluster Randomization. CoRR abs/2009.02297 (2020)
2010 – 2019
- 2019
- [c20]Arjun Seshadri, Johan Ugander:
Fundamental Limits of Testing the Independence of Irrelevant Alternatives in Discrete Choice. EC 2019: 65-66 - [c19]Arjun Seshadri, Alex Peysakhovich, Johan Ugander:
Discovering Context Effects from Raw Choice Data. ICML 2019: 5660-5669 - [c18]Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander:
Decoupled Smoothing on Graphs. WWW 2019: 263-272 - [c17]Jan Overgoor, Austin R. Benson, Johan Ugander:
Choosing to Grow a Graph: Modeling Network Formation as Discrete Choice. WWW 2019: 1409-1420 - [c16]Rahul Makhijani, Johan Ugander:
Parametric Models for Intransitivity in Pairwise Rankings. WWW 2019: 3056-3062 - [i19]Arjun Seshadri, Alexander Peysakhovich, Johan Ugander:
Discovering Context Effects from Raw Choice Data. CoRR abs/1902.03266 (2019) - [i18]Hao Yin, Austin R. Benson, Johan Ugander:
Measuring Directed Triadic Closure with Closure Coefficients. CoRR abs/1905.10683 (2019) - [i17]Jessica Su, Krishna Kamath, Aneesh Sharma, Johan Ugander, Sharad Goel:
An Experimental Study of Structural Diversity in Social Networks. CoRR abs/1909.03543 (2019) - 2018
- [j3]Bailey K. Fosdick, Daniel B. Larremore, Joel Nishimura, Johan Ugander:
Configuring Random Graph Models with Fixed Degree Sequences. SIAM Rev. 60(2): 315-355 (2018) - [c15]Imanol Arrieta Ibarra, Johan Ugander:
A Personalized BDM Mechanism for Efficient Market Intervention Experiments. EC 2018: 463-480 - [i16]Stephen Ragain, Alexander Peysakhovich, Johan Ugander:
Improving pairwise comparison models using Empirical Bayes shrinkage. CoRR abs/1807.09236 (2018) - [i15]Stephen Ragain, Johan Ugander:
Choosing to Rank. CoRR abs/1809.05139 (2018) - [i14]Alex Chin, Dean Eckles, Johan Ugander:
Evaluating stochastic seeding strategies in networks. CoRR abs/1809.09561 (2018) - [i13]Jan Overgoor, Austin R. Benson, Johan Ugander:
Choosing to grow a graph: Modeling network formation as discrete choice. CoRR abs/1811.05008 (2018) - 2017
- [j2]Isabel M. Kloumann, Johan Ugander, Jon M. Kleinberg:
Block models and personalized PageRank. Proc. Natl. Acad. Sci. USA 114(1): 33-38 (2017) - [c14]Alexander Peysakhovich, Johan Ugander:
Learning context-dependent preferences from raw data. NetEcon@EC 2017: 8:1 - [c13]Jon M. Kleinberg, Sendhil Mullainathan, Johan Ugander:
Comparison-based Choices. EC 2017: 127-144 - [i12]Kristen M. Altenburger, Johan Ugander:
Bias and variance in the social structure of gender. CoRR abs/1705.04774 (2017) - [i11]Jon M. Kleinberg, Sendhil Mullainathan, Johan Ugander:
Comparison-Based Choices. CoRR abs/1705.05735 (2017) - 2016
- [c12]Stephen Ragain, Johan Ugander:
Pairwise Choice Markov Chains. NIPS 2016: 3198-3206 - [i10]Stephen Ragain, Johan Ugander:
Pairwise Choice Markov Chains. CoRR abs/1603.02740 (2016) - [i9]Isabel M. Kloumann, Johan Ugander, Jon M. Kleinberg:
Block Models and Personalized PageRank. CoRR abs/1607.03483 (2016) - [i8]Bailey K. Fosdick, Daniel B. Larremore, Joel Nishimura, Johan Ugander:
Configuring Random Graph Models with Fixed Degree Sequences. CoRR abs/1608.00607 (2016) - 2015
- [c11]Johan Ugander, Ryan Drapeau, Carlos Guestrin:
The Wisdom of Multiple Guesses. EC 2015: 643-660 - [c10]Abigail Z. Jacobs, Samuel F. Way, Johan Ugander, Aaron Clauset:
Assembling thefacebook: Using Heterogeneity to Understand Online Social Network Assembly. WebSci 2015: 18:1-18:10 - [i7]Abigail Z. Jacobs, Samuel F. Way, Johan Ugander, Aaron Clauset:
Assembling thefacebook: Using heterogeneity to understand online social network assembly. CoRR abs/1503.06772 (2015) - 2014
- [i6]Dean Eckles, Brian Karrer, Johan Ugander:
Design and analysis of experiments in networks: Reducing bias from interference. CoRR abs/1404.7530 (2014) - 2013
- [c9]Daniel M. Romero, Chenhao Tan, Johan Ugander:
On the Interplay between Social and Topical Structure. ICWSM 2013 - [c8]Johan Ugander, Brian Karrer, Lars Backstrom, Jon M. Kleinberg:
Graph cluster randomization: network exposure to multiple universes. KDD 2013: 329-337 - [c7]Joel Nishimura, Johan Ugander:
Restreaming graph partitioning: simple versatile algorithms for advanced balancing. KDD 2013: 1106-1114 - [c6]Johan Ugander, Lars Backstrom:
Balanced label propagation for partitioning massive graphs. WSDM 2013: 507-516 - [c5]Johan Ugander:
Scaling graph computations at facebook. WWW (Companion Volume) 2013: 499-500 - [c4]Johan Ugander, Lars Backstrom, Jon M. Kleinberg:
Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. WWW 2013: 1307-1318 - [i5]Johan Ugander, Lars Backstrom, Jon M. Kleinberg:
Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph Collections. CoRR abs/1304.1548 (2013) - [i4]Johan Ugander, Brian Karrer, Lars Backstrom, Jon M. Kleinberg:
Graph cluster randomization: network exposure to multiple universes. CoRR abs/1305.6979 (2013) - 2012
- [j1]Johan Ugander, Lars Backstrom, Cameron Marlow, Jon M. Kleinberg:
Structural diversity in social contagion. Proc. Natl. Acad. Sci. USA 109(16): 5962-5966 (2012) - [c3]Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna:
Four degrees of separation. WebSci 2012: 33-42 - 2011
- [c2]Martin O. Larsson, Johan Ugander:
A concave regularization technique for sparse mixture models. NIPS 2011: 1890-1898 - [i3]Johan Ugander, Brian Karrer, Lars Backstrom, Cameron Marlow:
The Anatomy of the Facebook Social Graph. CoRR abs/1111.4503 (2011) - [i2]Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna:
Four Degrees of Separation. CoRR abs/1111.4570 (2011) - [i1]Daniel M. Romero, Chenhao Tan, Johan Ugander:
Social-Topical Affiliations: The Interplay between Structure and Popularity. CoRR abs/1112.1115 (2011)
2000 – 2009
- 2007
- [c1]Johan Ugander, Mary J. Dunlop, Richard M. Murray:
Analysis of a Digital Clock for Molecular Computing. ACC 2007: 1595-1599
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
