vix.ing · top · new · best · stats · spec

Growing random networks under constraints

2001/07/18 by Amit Puniyani, Puniyani, Amit, Rajan Lukose +2
Biochemistry, Genetics and Molecular Biology · Physics and Astronomy · Social Sciences · #Bioinformatics and Genomic Networks #Complex Network Analysis Techniques #Disordered Systems and Neural Networks (cond-mat.dis-nn) #Evolutionary Game Theory and Cooperation #FOS: Biological sciences #FOS: Physical sciences #Quantitative Biology (q-bio) #Soft Condensed Matter (cond-mat.soft) #Statistical Mechanics (cond-mat.stat-mech) #cond-mat.dis-nn #cond-mat.soft #cond-mat.stat-mech #q-bio

paper · pdf · doi:10.48550/arxiv.cond-mat/0107391

4 pages 3 figures Revtex, parts to be submitted to the International Conference in Systems Biology Caltech 2001

openalex publication_date 2001/07/18 · arxiv created 2001/07/21 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related