Permutation Invariant Strong Law of Large Numbers for Exchangeable Sequences

We provide a permutation invariant version of the strong law of large numbers for exchangeable sequences of random variables. The proof consists of a combination of the Komlós–Berkes theorem, the usual strong law of large numbers for exchangeable sequences, and de Finetti’s theorem.

Decomposition of Random Sequences into Mixtures of Simpler Ones and Its Application in Network Analysis

A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti’s Theorem. In its original form, it applies to infinite 0–1 valued sequences with the special property that the distribution is invariant to permutations (called an exchangeable sequence). Later it was extended and generalized in numerous directions. After reviewing this line of development, we present our new decomposition theorem, covering cases that have not been previously considered. We also introduce a novel way of applying these types of results in the analysis of random networks. For self-containment, we provide the introductory exposition in more detail than usual, with the intent of making it also accessible to readers who may not be closely familiar with the subject.