One of the well-known phenomena of the sociological experience is the friendship paradox
which states that your friends are more popular than you, on average. The friendship …

Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree
greater than that of the graph. Instead of naïvely sampling a vertex from a graph and …

It is often of interest to sample vertices from a graph with a bias towards higher-degree
vertices. One well-known method, which we call random neighbor or RN, involves taking a …

Many empirical studies have shown that in social, citation, collaboration, and other types of
networks in real world, the degree of almost every node is less than the average degree of …

In this paper, we consider the friendship paradox in the context of random walks and paths.
Among our results, we give an equality connecting long-range degree correlation, degree …

We study the evolution of the friendship index in complex social networks over time. The
elements of the networks are the users, and the connections correspond to the interactions …

Football is a “money game” and this feature of football is evident in the transfer markets.
Network science, which has a wide range of applications from the brain to social networks …

Let $ G_n $ be an undirected finite graph on $ n\in\mathbb {N} $ vertices labelled by
$[n]=\{1,\ldots, n\} $. For $ i\in [n] $, let $\Delta_ {i, n} $ be the friendship bias of vertex $ i …

The friendship index measures a node's popularity relative to its friends on a social network.
The friendship index is calculated by dividing the average degree of a node's friends by its …

Random neighbor sampling, or RN, is a method for sampling vertices with an average
degree greater than the mean degree of the graph. It samples a vertex, then exchanges it for …