Exceptions to the Friendship Paradox

The Friendship Paradox says that your friends are likely to have more friends on average than you do. I was wondering whether there are settings in which the statement of the Friendship Paradox does not hold. Below we think about this question in precise mathematical terminology.

Friendships, social networks, and the like are often modelled using simple graphs. People are represented by vertices, and each edge denotes a pair of friends. The set of friends, or neighbors, of a vertex v is defined to be N(v) = \{w \in V(G) : \{v,w\} \in E(G)\}. The number of friends, or the degree of v\in V(G) is set to be \textrm{deg}(v) = \textrm{card}(N(v) and the average number of the friends of a person’s friends is defined by \textrm{ad}(v) = \textrm{avg}\{\textrm{deg}(w) : w \in N(v)\}.

We say that a person (or vertex) v is proud if \textrm{deg}(v) > 0 and \textrm{deg}(v) > \textrm{ad}(v). One interesting version of the question above is: Do there exist graphs such that more than half of the people are proud?

The following insight is elementary, but it was still a surprise for me: It turns out that the share of proud people can be arbitrarily close to 1.. In order to prove this, take any integer m > 4 and consider the complete graph on m points with one edge removed. It is easy to see that the 2 people adjacent to the sole edge that was removed are the only ones that are not proud. So the share of proud people is \frac{m-2}{m} which converges to 1 as m grows large.

Posted in Uncategorized | Leave a comment

Two-dimensional convergence

Here is something that I was certain would have an easy-to-prove positive answer; but it turns out that there is an exceedingly simple counterexample.

Let \omega be the first infinite ordinal; its successor is \omega + 1 = \omega \cup \{\omega\}.We consider a map M: (\omega+1) \times (\omega+1) \to \mathbb{R}, or put differently, a (\omega+1) \times (\omega+1)-Matrix M of real numbers.

We assume that M has the following properties:
(1) For all k\in \omega we have \lim_{n\to\infty} M(k, n) = M(k,\omega), or more informally, we have “convergence to the right”.
(2) For all k\in \omega we have \lim_{n\to\infty} M(n, k) = M(\omega, k), or more informally, we have “convergence to the bottom”.
(3) \lim_{n\to\infty} M(n,\omega) = M(\omega,\omega), or more informally, the right-hand entries of M converge to the bottom right element M(\omega,\omega).

Question: Does this imply that \lim_{n\to\infty} M(\omega,n) = M(\omega,\omega), that is, do the bottom entries of M also converge to  M(\omega,\omega)?

Answer: There is, surprisingly (to me, at least) an easy example showing that the answer is No. Let M: (\omega+1)^2 \to \mathbb{R} be defined by (\alpha,\beta)\mapsto 0 if \alpha \leq \beta and (\alpha,\beta)\mapsto 1 otherwise. It is easy to verify that (1), (2), (3) above are satisfied. Note that the right-hand entries M(n, \omega) are all 0, and they trivially converge to M(\omega,\omega) = 0; but we have M(\omega, n) = 1 for all n\in\omega therefore \lim_{n\to\infty} M(\omega,n) = 1\neq 0 =M(\omega,\omega).

For the kind of two-dimensional convergence we are looking for we need some form of “simultaneous” convergence (conceptually related to uniform convergence), which I might address in a later post.

Posted in Uncategorized | Leave a comment

A mathematical view on the notion of “median”

These days we hear about medians of all kinds of things: household income, lifetime of items such as lightbulbs, and so on. It’s time to get a rigorous grip on the concept.

Definition. Suppose X\neq \emptyset is a set, (C, \leq) a totally ordered set, and f: X \to C a function. Then m\in C is said to be a median of f if the sets \{x \in X : f(x) \leq m\} and  \{x \in X : f(x) \geq m\} have equal size.

It is a reflex of mathematicians to ask about existence and uniqueness of any concept they stumble upon. (Note that I wrote “a median” and not “the median” above.) Indeed, as much as the definition above seems to make sense: Even for simple example, the median needs not exist. Let X = \{1,2,3\} and let f:X\to \mathbb{R} be defined by f(1) = f(2) = 0 and f(3) = 1. Then f has no median according to the definition above. On the other hand, if X = \{1,2\} and f:X\to \mathbb{R} is the inclusion map, then every element of the open interval ]1,2[ is a median!

There are many common fixes to the problems of existence and uniqueness, but no definition is really elegant. (Most resort to listing the elements in ascending order and to pick the arithmetical middle of the “middle elements” in the list or something similar.)

Other difficulties arise when we want to pick medians of infinite sample sets. Let (C,\leq) be a totally ordered set. We say that m\in C is a median of C if the sets \{c \in C : c \leq m\} and  \{c \in C : c \geq m\} have equal cardinality. Note that in \mathbb{R} every element is a median, but \mathbb{N} has no median at all!

Posted in Uncategorized | Leave a comment

Adventskranz-Rätsel

Beim Anzünden der Kerzen unseres Adventskranzes heute morgen hat es mich gestört, keinen guten Algorithmus zu haben, dass die Kerzen möglichst gleichmässig “belastet” werden. Das hat mich zu folgendem vereinfachten Rätsel inspiriert:

In Adventswoche k (für k = 1,\ldots, 4) werden k Kerzen gewählt, angezündet, und so lange brennen gelassen, bis sie 1cm an ihrer Höhe eingebüsst haben. (Die Kerzen sind initial n cm hoch.)

Woche 4 ist ein No-Brainer – da werden immer alle Kerzen angezündet. Ich muss also auf Anfang der Woche 4 “Gleichstand” erreicht haben.

Für k = 1,2,3 sei m_k die Anzahl Male, die ich die Kerzen in Woche k anzünde und genau 1cm abbrennen lasse. Für welche Tupel (m_1, m_2, m_3) kann ich für den Anfang der Woche 4 Gleichstand erreichen, sodass die Kerzen am Ende der Adventszeit schön gleichzeitig abbrennen?

Posted in Uncategorized | Leave a comment

Math facts with simple proofs that are still (somewhat) surprising

Sometimes it happens to me that I become aware of a mathematical fact that surprises me – and the proof for the fact would even fit in a tweet.

When goofing around with graph homomorphisms, I realised that the following is true:

Fact. If f:G\to H is a graph homomorphism, then \chi(G) \leq \chi(H) — no matter whether the graphs involved are finite or infinite.

Proof. Colorings are homomorphisms to complete graphs. If c: H\to K_{\chi(K)} is a homomorphism, then so is c \circ f : G \to K_{\chi(K)}.

The funny thing is: If I had been told just the statement of the fact “out of the blue”, I would have said that you probably need some condition on the homomorphism f:G\to H, like it being surjective etc. So I find it a bit surprising that the statement holds in this generality — even if there is a tweet-length proof for it.

Posted in Uncategorized | Leave a comment

Sometimes a maximality principle is true even if Zorn’s Lemma fails

A famous and straightforward result in general topology says that any compact T_2 space is

  • maximally compact: any finer topology isn’t compact any more;
  • minimally T_2: any coarser topoology isn’t T_2 any more.

A natural pair of questions that arises from this is the following: Is every compact topology contained in a maximally compact one? (Dually: does every Hausdorff topology contain a minimal Hausdorff topology?).

This short post is only concerned with the former of the two questions. Unfortunately, a direct application of Zorn’s Lemma doesn’t lead us anywhere. Let \mathbb{N} denote the set of positive integers. We define a chain of compact topologies on \mathbb{N} by setting 

\tau_n = \mathcal{P}(\{1,\ldots,n\}) \cup \{\mathbb{N}\} for every n\in \mathbb{N}. (By \mathcal{P}(.) we denote the power set.)

Now every \tau_n is compact, but the topology generated by the union of this chain is the discrete topology on \mathbb{N}, which is not compact. So we cannot apply Zorn’s Lemma for this question.

It turns out that even if we can’t apply ZL, the statement that every compact topology is contained in a maximally compact one is true, which answered an old question. The result can be seen in this paper by Martin Maria Kovar.

Posted in Uncategorized | Leave a comment

On empty Hom-sets between graphs

In many categories such as Set, Group, Top (topological spaces) there is a morphism between any two objects, usually in both directions. (If one object is “empty”, like the empty space, or the empty set, there is the “empty” morphism from \emptyset to the other object, but not the other way round.)

However in the category Graph it is possible that non-empty graphs G,H have no graph homomorphism between them in either direction:

Let K_3 be the complete graph on 3 points and let H be any triangle-free graph with \chi(H) > 3, for instance the Grötzsch graph, which has chromatic number 4.

Since H is triangle-free, there is no graph homomorphism \varphi: K_3 \to H and if there were a homomorphism \eta : H \to K_3, this map would be an n-coloring of H for some n \leq 3.

Posted in Uncategorized | Leave a comment