Search

The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p \in (0, 1)$, independently of other pairs. In this article, we study the influence of allowing different probabilities for each pair of vertices. More specifically, we characterize for which sequences $(p_n)_{n\in \mathbb{N}}$ of values in $[0, 1]$ there exists a bijection f from pairs of vertices in $\mathbb{N}$ to $\mathbb{N}$ such that if we put an edge between $v$ and $w$ with probability $p_{f(\{v,w\})}$, independently of other pairs, then the Random Graph arises almost surely.

We define a $\sigma$-centered notion of forcing that forces the existence of a Boolean algebra with the Grothendieck property and without the Nikodym property. In particular the existence of such an algebra is consistent with the negation of the continuum hypothesis. The algebra we construct consists of Borel subsets of the Cantor set and has cardinality $\omega_1$. We also show how to apply our method to streamline Talagrand's construction of such an algebra under the continuum hypothesis., Comment: 39 pages

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given arbitrary sequence $(b_n)$ of real numbers there exists a permutation $\sigma\colon \N \to \N$ such that $\sigma(n) = n$ for every $n \notin A$ and $(b_n)$ is $c_0$-equivalent to a subsequence of the sequence of partial sums of the series $\sum\limits_{n=1}^\infty a_{\sigma(n)}$. Moreover, we discuss a connection between our main result with the classical Riemann series theorem.