Page 1

Displaying 1 – 14 of 14

Showing per page

Inequalities and limit theorems for random allocations

István Fazekas, Alexey Chuprunov, József Túri (2011)

Annales UMCS, Mathematica

Random allocations of balls into boxes are considered. Properties of the number of boxes containing a fixed number of balls are studied. A moment inequality is obtained. A merge theorem with Poissonian accompanying laws is proved. It implies an almost sure limit theorem with a mixture of Poissonian laws as limiting distribution. Almost sure versions of the central limit theorem are obtained when the parameters are in the central domain.

Infinite paths and cliques in random graphs

Alessandro Berarducci, Pietro Majer, Matteo Novaga (2012)

Fundamenta Mathematicae

We study the thresholds for the emergence of various properties in random subgraphs of (ℕ, <). In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.

Currently displaying 1 – 14 of 14

Page 1