You are here
Homerandom graph (infinite)
Primary tabs
random graph (infinite)
Suppose we have some method $M$ of generating sequences of letters from $\{p,q\}$ so that at each generation the probability of obtaining $p$ is $x$, a real number strictly between $0$ and $1$.
Let $\{a_{{i}}:i<\omega\}$ be a set of vertices. For each $i<\omega$ , $i\geq 1$ we construct a graph $G_{{i}}$ on the vertices $a_{{1}},\ldots,a_{{i}}$ recursively.

$G_{{1}}$ is the unique graph on one vertex.
Now let $\Gamma$ be the graph on $\{a_{{i}}:i<\omega\}$ so that for any $n,m<\omega$, $a_{{n}}$ is joined to $a_{{m}}$ in $\Gamma$ iff it is in some $G_{{i}}$.
Then we call $\Gamma$ a random graph. Consider the following property which we shall call fsaturation:
Given any finite disjoint $U$ and $V$, subsets of $\{a_{{i}}:i<\omega\}$ there is some $a_{{n}}\in\{a_{{i}}:i<\omega\}\setminus(U\cup V)$ so that $a_{{n}}$ is joined to every point of $U$ and no points in $V$.
Proposition 1.
A random graph has fsaturation with probability $1$.
Proof: Let $b_{{1}},b_{{2}},\ldots,b_{{n}},\ldots$ be an enumeration of $\{a_{{i}}:i<\omega\}\setminus(U\cup V)$. We say that $b_{{i}}$ is correctly joined to $(U,V)$ iff it is joined to all the members of $U$ and non of the members of $V$. Then the probability that $b_{{i}}$ is not correctly joined is $(1x^{{U}}(1x)^{{V}})$ which is some real number $y$ strictly between $0$ and $1$. The probability that none of the first $m$ are correctly joined is $y^{{m}}$ and the probability that none of the $b_{{i}}$s are correctly joined is $\textrm{lim}_{{n\to\infty}}y^{{n}}=0$. Thus one of the $b_{{i}}$s is correctly joined.
Proposition 2.
Any two countable graphs with fsaturation are isomorphic.
Proof: This is via a back and forth argument. The property of fsaturation is exactly what is needed.
Thus although the system of generation of a random graph looked as though it could deliver many potentially different graphs, this is not the case. Thus we talk about the random graph.
The random graph can also be constructed as a Fraisse limit of all finite graphs, and in many other ways. It is homogeneous and universal for the class of all countable graphs.
The theorem that almost every two infinite random graphs are isomorphic was first proved in [1].
References
 1 Paul Erdős and Alfréd Rényi. Asymmetric graphs. Acta Math. Acad. Sci. Hung., 14:295–315, 1963.
Mathematics Subject Classification
03C52 no label found03C30 no label found03C15 no label found05C30 no label found Forums
 Planetary Bugs
 HS/Secondary
 University/Tertiary
 Graduate/Advanced
 Industry/Practice
 Research Topics
 LaTeX help
 Math Comptetitions
 Math History
 Math Humor
 PlanetMath Comments
 PlanetMath System Updates and News
 PlanetMath help
 PlanetMath.ORG
 Strategic Communications Development
 The Math Pub
 Testing messages (ignore)
 Other useful stuff
 Corrections
Corrections
Nitpicking by mathwizard ✓
title of article by mps ✓
spelling by Mathprof ✓
synonym "infinite random graph" by akrowne ✘