Calculus of Variations and Geometric Measure Theory
home | mail | papers | authors | news | seminars | events | open positions | login

A. Berarducci - P. Majer - M. Novaga

Percolation-type problems on infinite random graphs

created by novaga on 16 Sep 2008
modified on 24 Nov 2008


Submitted Paper

Inserted: 16 sep 2008
Last Updated: 24 nov 2008

Year: 2008


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.


Credits | Cookie policy | HTML 4.0.1 strict | CSS 2.1