- Source: Friendship paradox
- Kepopuleran
- Spiral keheningan
- Vladimir Putin
- Aristoteles
- Marco Steffiano
- Penerbangan antariksa
- Beograd
- Edward Elgar
- Anne Rice
- Friendship paradox
- List of paradoxes
- Friendship
- Illusory superiority
- Scale-free network
- Sampling bias
- List of statistics articles
- Friend of a friend
- Social network analysis
- Nicholas Christakis
The friendship paradox is the phenomenon first observed by the sociologist Scott L. Feld in 1991 that on average, an individual's friends have more friends than that individual. It can be explained as a form of sampling bias in which people with more friends are more likely to be in one's own friend group. In other words, one is less likely to be friends with someone who has very few friends. In contradiction to this, most people believe that they have more friends than their friends have.
The same observation can be applied more generally to social networks defined by other relations than friendship: for instance, most people's sexual partners have had (on the average) a greater number of sexual partners than they have.
The friendship paradox is an example of how network structure can significantly distort an individual's local observations.
Mathematical explanation
In spite of its apparently paradoxical nature, the phenomenon is real, and can be explained as a consequence of the general mathematical properties of social networks. The mathematics behind this are directly related to the arithmetic-geometric mean inequality and the Cauchy–Schwarz inequality.
Formally, Feld assumes that a social network is represented by an undirected graph G = (V, E), where the set V of vertices corresponds to the people in the social network, and the set E of edges corresponds to the friendship relation between pairs of people. That is, he assumes that friendship is a symmetric relation: if x is a friend of y, then y is a friend of x. The friendship between x and y is therefore modeled by the edge {x, y}, and the number of friends an individual has corresponds to a vertex's degree. The average number of friends of a person in the social network is therefore given by the average of the degrees of the vertices in the graph. That is, if vertex v has d(v) edges touching it (representing a person who has d(v) friends), then the average number μ of friends of a random person in the graph is
μ
=
∑
v
∈
V
d
(
v
)
|
V
|
=
2
|
E
|
|
V
|
.
{\displaystyle \mu ={\frac {\sum _{v\in V}d(v)}{|V|}}={\frac {2|E|}{|V|}}.}
The average number of friends that a typical friend has can be modeled by choosing a random person (who has at least one friend), and then calculating how many friends their friends have on average. This amounts to choosing, uniformly at random, an edge of the graph (representing a pair of friends) and an endpoint of that edge (one of the friends), and again calculating the degree of the selected endpoint. The probability of a certain vertex
v
{\displaystyle v}
to be chosen is
d
(
v
)
|
E
|
1
2
.
{\displaystyle {\frac {d(v)}{|E|}}{\frac {1}{2}}.}
The first factor corresponds to how likely it is that the chosen edge contains the vertex, which increases when the vertex has more friends. The halving factor simply comes from the fact that each edge has two vertices. So the expected value of the number of friends of a (randomly chosen) friend is
∑
v
(
d
(
v
)
|
E
|
1
2
)
d
(
v
)
=
∑
v
d
(
v
)
2
2
|
E
|
.
{\displaystyle \sum _{v}\left({\frac {d(v)}{|E|}}{\frac {1}{2}}\right)d(v)={\frac {\sum _{v}d(v)^{2}}{2|E|}}.}
We know from the definition of variance that
∑
v
d
(
v
)
2
|
V
|
=
μ
2
+
σ
2
,
{\displaystyle {\frac {\sum _{v}d(v)^{2}}{|V|}}=\mu ^{2}+\sigma ^{2},}
where
σ
2
{\displaystyle \sigma ^{2}}
is the variance of the degrees in the graph. This allows us to compute the desired expected value as
∑
v
d
(
v
)
2
2
|
E
|
=
|
V
|
2
|
E
|
(
μ
2
+
σ
2
)
=
μ
2
+
σ
2
μ
=
μ
+
σ
2
μ
.
{\displaystyle {\frac {\sum _{v}d(v)^{2}}{2|E|}}={\frac {|V|}{2|E|}}(\mu ^{2}+\sigma ^{2})={\frac {\mu ^{2}+\sigma ^{2}}{\mu }}=\mu +{\frac {\sigma ^{2}}{\mu }}.}
For a graph that has vertices of varying degrees (as is typical for social networks),
σ
2
{\displaystyle {\sigma }^{2}}
is strictly positive, which implies that the average degree of a friend is strictly greater than the average degree of a random node.
Another way of understanding how the first term came is as follows. For each friendship (u, v), a node u mentions that v is a friend and v has d(v) friends. There are d(v) such friends who mention this. Hence the square of d(v) term. We add this for all such friendships in the network from both the u's and v's perspective, which gives the numerator. The denominator is the number of total such friendships, which is twice the total edges in the network (one from the u's perspective and the other from the v's).
After this analysis, Feld goes on to make some more qualitative assumptions about the statistical correlation between the number of friends that two friends have, based on theories of social networks such as assortative mixing, and he analyzes what these assumptions imply about the number of people whose friends have more friends than they do. Based on this analysis, he concludes that in real social networks, most people are likely to have fewer friends than the average of their friends' numbers of friends. However, this conclusion is not a mathematical certainty; there exist undirected graphs (such as the graph formed by removing a single edge from a large complete graph) that are unlikely to arise as social networks but in which most vertices have higher degree than the average of their neighbors' degrees.
The Friendship Paradox may be restated in graph theory terms as "the average degree of a randomly selected node in a network is less than the average degree of neighbors of a randomly selected node", but this leaves unspecified the exact mechanism of averaging (i.e., macro vs micro averaging). Let
G
=
(
V
,
E
)
{\displaystyle G=(V,E)}
be an undirected graph with
|
V
|
=
N
{\displaystyle |V|=N}
and
|
E
|
=
M
{\displaystyle |E|=M}
, having no isolated nodes. Let the set of neighbors of node
u
{\displaystyle u}
be denoted
nbr
(
u
)
{\displaystyle \operatorname {nbr} (u)}
. The average degree is then
μ
=
1
N
∑
u
∈
V
|
nbr
(
u
)
|
=
2
M
N
≥
1
{\displaystyle \mu ={\frac {1}{N}}\sum _{u\in V}|\operatorname {nbr} (u)|={\frac {2M}{N}}\geq 1}
. Let the number of "friends of friends" of node
u
{\displaystyle u}
be denoted
FF
(
u
)
=
∑
v
∈
nbr
(
u
)
|
nbr
(
v
)
|
{\displaystyle \operatorname {FF} (u)=\sum _{v\in \operatorname {nbr} (u)}|\operatorname {nbr} (v)|}
. Note that this can count 2-hop neighbors multiple times, but so does Feld's analysis. We have
FF
(
u
)
≥
|
nbr
(
u
)
|
≥
1
{\displaystyle \operatorname {FF} (u)\geq |\operatorname {nbr} (u)|\geq 1}
. Feld considered the following "micro average" quantity.
MicroAvg
=
∑
u
∈
V
FF
(
u
)
∑
u
∈
V
|
nbr
(
u
)
|
{\displaystyle {\text{MicroAvg}}={\frac {\sum _{u\in V}\operatorname {FF} (u)}{\sum _{u\in V}|\operatorname {nbr} (u)|}}}
However, there is also the (equally legitimate) "macro average" quantity, given by
MacroAvg
=
1
N
∑
u
∈
V
FF
(
u
)
|
nbr
(
u
)
|
{\displaystyle {\text{MacroAvg}}={\frac {1}{N}}\sum _{u\in V}{\frac {\operatorname {FF} (u)}{|\operatorname {nbr} (u)|}}}
The computation of MacroAvg can be expressed as the following pseudocode.
Each edge
{
u
,
v
}
{\displaystyle \{u,v\}}
contributes to MacroAvg the quantity
|
nbr
(
v
)
|
|
nbr
(
u
)
|
+
|
nbr
(
u
)
|
|
nbr
(
v
)
|
≥
2
{\displaystyle {\frac {|\operatorname {nbr} (v)|}{|\operatorname {nbr} (u)|}}+{\frac {|\operatorname {nbr} (u)|}{|\operatorname {nbr} (v)|}}\geq 2}
, because
min
a
,
b
>
0
a
b
+
b
a
=
2
{\displaystyle \min _{a,b>0}{\frac {a}{b}}+{\frac {b}{a}}=2}
. We thus get
MacroAvg
=
1
N
∑
u
∈
V
Q
(
u
)
≥
1
N
⋅
M
⋅
2
=
2
M
N
=
μ
{\displaystyle {\text{MacroAvg}}={\frac {1}{N}}\sum _{u\in V}Q(u)\geq {\frac {1}{N}}\cdot M\cdot 2={\frac {2M}{N}}=\mu }
.
Thus, we have both
MicroAvg
≥
μ
{\displaystyle {\text{MicroAvg}}\geq \mu }
and
MacroAvg
≥
μ
{\displaystyle {\text{MacroAvg}}\geq \mu }
, but no inequality holds between them.
In a 2023 paper, a parallel paradox, but for negative, antagonistic, or animosity ties, termed the "enmity paradox," was defined and demonstrated by Ghasemian and Christakis. In brief, one's enemies have more enemies than one does, too. This paper also documented diverse phenomena is "mixed worlds" of both hostile and friendly ties.
Applications
The analysis of the friendship paradox implies that the friends of randomly selected individuals are likely to have higher than average centrality. This observation has been used as a way to forecast and slow the course of epidemics, by using this random selection process to choose individuals to immunize or monitor for infection while avoiding the need for a complex computation of the centrality of all nodes in the network. In a similar manner, in polling and election forecasting, friendship paradox has been exploited in order to reach and query well-connected individuals who may have knowledge about how numerous other individuals are going to vote. However, when utilized in such contexts, the friendship paradox inevitably introduces bias by over-representing individuals with many friends, potentially skewing resulting estimates.
A study in 2010 by Christakis and Fowler showed that flu outbreaks can be detected almost two weeks before traditional surveillance measures would do so by using the friendship paradox in monitoring the infection in a social network. They found that using the friendship paradox to analyze the health of central friends is "an ideal way to predict outbreaks, but detailed information doesn't exist for most groups, and to produce it would be time-consuming and costly." This extends to the spread of ideas as well, with evidence that the friendship paradox can be used to track and predict the spread of ideas and misinformation through networks. This observation has been explained with the argument that individuals with more social connections may be the driving forces behind the spread of these ideas and beliefs, and as such can be used as early-warning signals.
Friendship paradox based sampling (i.e., sampling random friends) has been theoretically and empirically shown to outperform classical uniform sampling for the purpose of estimating the power-law degree distributions of scale-free networks. The reason is that sampling the network uniformly will not collect enough samples from the characteristic heavy tail part of the power-law degree distribution to properly estimate it. However, sampling random friends incorporates more nodes from the tail of the degree distribution (i.e., more high degree nodes) into the sample. Hence, friendship paradox based sampling captures the characteristic heavy tail of a power-law degree distribution more accurately and reduces the bias and variance of the estimation.
The "generalized friendship paradox" states that the friendship paradox applies to other characteristics as well. For example, one's co-authors are on average likely to be more prominent, with more publications, more citations and more collaborators, or one's followers on Twitter have more followers. The same effect has also been demonstrated for Subjective Well-Being by Bollen et al. (2017), who used a large-scale Twitter network and longitudinal data on subjective well-being for each individual in the network to demonstrate that both a Friendship and a "happiness" paradox can occur in online social networks.
The friendship paradox has also been used as a means to identify structurally influential nodes within social networks, so as to magnify social contagion of diverse practices relevant to human welfare and public health. This has been shown to be possible in several large-scale randomized controlled field trials conducted by Christakis et al., with respect to the adoption of multivitamins or maternal and child health practices in Honduras, or of iron-fortified salt in India. This technique is valuable because, by exploiting the friendship paradox, one can identify such influential nodes without the expense and delay of actually mapping the whole network.
See also
List of paradoxes#Mathematics – List of statements that appear to contradict themselves
Second neighborhood problem – Unsolved problem about oriented graphs
Self-evaluation maintenance theory – Concept in social psychology
References
External links
Strogatz, Steven (September 17, 2012). "Friends You Can Count On". New York Times. Retrieved 17 January 2013.