Related papers: The friendship paradox for sparse random graphs
In Hazra, den Hollander and Parvaneh (2025) we analysed the friendship paradox for sparse random graphs. For four classes of random graphs we characterised the empirical distribution of the friendship biases between vertices and their…
The friendship paradox index is a network summary statistic used to quantify the friendship paradox, which describes the tendency for an individual's friends to have more friends than the individual. In this paper, we utilize Markov's…
We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges…
We show that in an undirected graph under degree biased sampling the expected degree of vertices is equal to the expected degree of their neighbors. In consequence, under the biased sampling the social network result known as the friendship…
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of…
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…
The friendship paradox is the observation that the degrees of the neighbors of a node in any network will, on average, be greater than the degree of the node itself. In common parlance, your friends have more friends than you do. In this…
The Friendship Paradox is a simple and powerful statement about node degrees in a graph (Feld 1991). However, it only applies to undirected graphs with no edge weights, and the only node characteristic it concerns is degree. Since many…
We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…
The friendship paradox refers to the sociological observation that, while the people's assessment of their own popularity is typically self-aggrandizing, in reality they are less popular than their friends. The generalized friendship…
The classical friendship paradox asserts that, on average, an individual's neighbors have a higher degree than the individual. This statement concerns network-level means and does not describe how often a typical node is locally dominated…
In this paper, we study the online nearest neighbor random tree in dimension $d\in \mathbb N$ (called $d$-NN tree for short) defined as follows. We fix the torus $\mathbb T^d_n$ of dimension $d$ and area $n$ and equip it with the metric…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
The friendship paradox -- the observation that, on average, one's friends have more friends than oneself -- admits two common formulations depending on whether averaging is performed over edges or over nodes. These two definitions, the…
One of interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes,…
Our friends have more friends than we do. That is the basis of the friendship paradox. In mathematical terms, the mean number of friends of friends is higher than the mean number of friends. In the present study, we analyzed the…
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…
Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…