Merging percolation and classical random graphs: Phase transition in dimension 1
From MaRDI portal
Publication:6477903
arXivmath/0609594MaRDI QIDQ6477903FDOQ6477903
Authors: Tatyana S. Turova, Thomas Vallier 
Publication date: 21 September 2006
Abstract: We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1 case" of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe completely the phase diagram in the case d=1. The phase transition is similar to the classical random graph, it is of the second order. We also find the scaled size of the largest connected component above the phase transition.
This page was built for publication: Merging percolation and classical random graphs: Phase transition in dimension 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477903)
