Not all scale-free networks are born equal: the role of the seed graph in PPI network evolution

F Hormozdiari, P Berenbrink, N Pržulj… - PLoS computational …, 2007 - journals.plos.org
PLoS computational biology, 2007journals.plos.org
The (asymptotic) degree distributions of the best-known “scale-free” network models are all
similar and are independent of the seed graph used; hence, it has been tempting to assume
that networks generated by these models are generally similar. In this paper, we observe
that several key topological features of such networks depend heavily on the specific model
and the seed graph used. Furthermore, we show that starting with the “right” seed graph
(typically a dense subgraph of the protein–protein interaction network analyzed), the …
The (asymptotic) degree distributions of the best-known “scale-free” network models are all similar and are independent of the seed graph used; hence, it has been tempting to assume that networks generated by these models are generally similar. In this paper, we observe that several key topological features of such networks depend heavily on the specific model and the seed graph used. Furthermore, we show that starting with the “right” seed graph (typically a dense subgraph of the protein–protein interaction network analyzed), the duplication model captures many topological features of publicly available protein–protein interaction networks very well.
PLOS