ISSN:
0219-3094
Keywords:
Keywords: Random structure, random graph, connectivity, branching process
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract. A random structure, s n , consists of (i) a random contact graph X with vertex set {1, ..., n} and (ii) a multi-set of binary relations over the finite set $ \Cal A $ , associated with the edges of X. The X-edges are the union of the edge sets of two random graphs, X 1 and X 2 . X 1 is a random partial one factor graph over the vertices {l i1 , ..., l i2m } and has edge set {y 1, ...,y m }X 2 has vertex set {1, ..., n} and is obtained by selecting the edges of K n \{y 1, ...,y m } with independent probability p = c 2 /n, c 2 〉 0. This paper provides a probabilistic analysis of the contact graphs of random structures and puts the results into context with the evolutionary optimization of biopolymers.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/PL00001286
Permalink