Convergence in homogeneous random graphs

Details Convergence in homogeneous random graphs Convergence in homogeneous random graphs

1995-01-15

arxiv.org/abs/math/9501221v1

Random Structures Algorithms 6 (1995), 371--391

Mathematics

Logic

Scientific paper

For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with
vertex set {1,2, ...,n} in which two vertices i, j are adjacent with
probability p(|i-j|), independently for each pair. We study how the
convergence of probabilities of first order properties of G(n,p), can be
affected by the behaviour of p and the strength of the language we use.

Affiliated with

Also associated with

No associations

Rating

Convergence in homogeneous random graphs 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 Convergence in homogeneous random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence in homogeneous random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643538