Infinite paths and cliques in random graphs

Alessandro Berarducci, Pietro Majer, and Matteo Novaga. "Infinite paths and cliques in random graphs." Fundamenta Mathematicae 216.2 (2012): 163-191. <http://eudml.org/doc/282941>.

@article{AlessandroBerarducci2012,
abstract = {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.},
author = {Alessandro Berarducci, Pietro Majer, Matteo Novaga},
journal = {Fundamenta Mathematicae},
keywords = {random graphs; Ramsey theory; percolation threshold; probability},
language = {eng},
number = {2},
pages = {163-191},
title = {Infinite paths and cliques in random graphs},
url = {http://eudml.org/doc/282941},
volume = {216},
year = {2012},
}

TY - JOUR
AU - Alessandro Berarducci
AU - Pietro Majer
AU - Matteo Novaga
TI - Infinite paths and cliques in random graphs
JO - Fundamenta Mathematicae
PY - 2012
VL - 216
IS - 2
SP - 163
EP - 191
AB - 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.
LA - eng
KW - random graphs; Ramsey theory; percolation threshold; probability
UR - http://eudml.org/doc/282941
ER -