%0 Journal Article
%T Infinite paths and cliques in random graphs
%A A. Berarducci
%A P. Majer
%A M. Novaga
%J Mathematics
%D 2008
%I arXiv
%X We study some percolation problems on the complete graph over $\mathbf N$. 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, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
%U http://arxiv.org/abs/0809.2335v5