Farshad Kooti
Research Subjects
Farshad Kooti has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Esteban Moro
Northeastern University, Boston, USA
1 shared publication Kristina Lerman
USC Information Sciences Institute
1 shared publication- Kristina Lerman
Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292, USA
1 shared publication - Nathan Oken Hodas
USC Information Sciences Institute 4676 Admiralty Way Marina del 90292 Rey CA
1 shared publication
Latest Publications
- 19 October 2016
- Published by Springer Nature
- p. 71-86
Twitter Session Analytics: Profiling Users’ Short-Term Behavioral Changes
- 19 October 2016
- Published by Springer Nature
- p. 71-86
Twitter Session Analytics: Profiling Users’ Short-Term Behavioral Changes
- Open Access
Network Weirdness: Exploring the Origins of Network Paradoxes
Social networks have many counter-intuitive properties, including the "friendship paradox" that states, on average, your friends have more friends than you do. Recently, a variety of other paradoxes were demonstrated in online social networks. This paper explores the origins of these network paradoxes. Specifically, we ask whether they arise from mathematical properties of the networks or whether they have a behavioral origin. We show that sampling from heavy-tailed distributions always gives rise to a paradox in the mean, but not the median. We propose a strong form of network paradoxes, based on utilizing the median, and validate it empirically using data from two online social networks. Specifically, we show that for any user the majority of user's friends and followers have more friends, followers, etc. than the user, and that this cannot be explained by statistical properties of sampling. Next, we explore the behavioral origins of the paradoxes by using the shuffle test to remove correlations between node degrees and attributes. We find that paradoxes for the mean persist in the shuffled network, but not for the median. We demonstrate that strong paradoxes arise due to the assortativity of user attributes, including degree, and correlation between degree and attribute.
Open AccessNetwork Weirdness: Exploring the Origins of Network Paradoxes
Social networks have many counter-intuitive properties, including the "friendship paradox" that states, on average, your friends have more friends than you do. Recently, a variety of other paradoxes were demonstrated in online social networks. This paper explores the origins of these network paradoxes. Specifically, we ask whether they arise from mathematical properties of the networks or whether they have a behavioral origin. We show that sampling from heavy-tailed distributions always gives rise to a paradox in the mean, but not the median. We propose a strong form of network paradoxes, based on utilizing the median, and validate it empirically using data from two online social networks. Specifically, we show that for any user the majority of user's friends and followers have more friends, followers, etc. than the user, and that this cannot be explained by statistical properties of sampling. Next, we explore the behavioral origins of the paradoxes by using the shuffle test to remove correlations between node degrees and attributes. We find that paradoxes for the mean persist in the shuffled network, but not for the median. We demonstrate that strong paradoxes arise due to the assortativity of user attributes, including degree, and correlation between degree and attribute.