Merging percolation and classical random graphs: Phase transition in dimension 1

Details Merging percolation and classical random graphs: Phase transition in dimension 1 Merging percolation and classical random graphs: Phase transition in dimension 1

2006-09-21

arxiv.org/abs/math/0609594v1

Mathematics

Probability

24 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Merging percolation and classical random graphs: Phase transition in dimension 1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Merging percolation and classical random graphs: Phase transition in dimension 1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Merging percolation and classical random graphs: Phase transition in dimension 1 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-135426