Paper Info
Title
Measuring the Generalized Friendship Paradox in Networks with Quality-dependent Connectivity.
Abstract
The friendship paradox is a sociological phenomenon stating that most people have fewer friends than their friends do. The generalized friendship paradox refers to the same observation for attributes other than degree, and it has been observed in Twitter and scientific collaboration networks. This paper takes an analytical approach to model this phenomenon. We consider a preferential attachment-like network growth mechanism governed by both node degrees and 'qualities'. We introduce measures to quantify paradoxes, and contrast the results obtained in our model to those obtained for an uncorrelated network, where the degrees and qualities of adjacent nodes are uncorrelated. We shed light on the effect of the distribution of node qualities on the friendship paradox. We consider both the mean and the median to measure paradoxes, and compare the results obtained by using these two statistics.
Year
DOI
Venue
2014
10.1007/978-3-319-16112-9_5
Studies in Computational Intelligence
Field
DocType
Volume
Social psychology,Sociology,Uncorrelated,Cognitive psychology,Artificial intelligence,Phenomenon,Friendship paradox,Machine learning
Journal
597.0
ISSN
Citations 
PageRank 
1860-949X
1
0.38
References 
Authors
7
2
Name
Order
Citations
PageRank
Naghmeh Momeni143.87
Michael G. Rabbat21631111.76