Growing random networks under constraints
Abstract
Description
We study the evolution of a random graph under the constraint that the diameter remain constant as the graph grows. We show that if the graph maintains the form of its link distribution it must be scale-free with exponent between 2 and 3. These uniqueness results may help explain the scale-free nature of graphs, of varying sizes, representing the evolved metabolic pathways in 43 organisms.
4 pages 3 figures Revtex, parts to be submitted to the International Conference in Systems Biology Caltech 2001
4 pages 3 figures Revtex, parts to be submitted to the International Conference in Systems Biology Caltech 2001