some models of reproducing graphs i pure reproduction一些我纯复制繁殖的模型图.pdf

Applied Mathematics , 2010, 1, 137-145 doi:10.4236/am.2010.13018 Published Online September 2010 (http://www.SciRP.org/journal/am) Some Models of Reproducing Graphs: I Pure Reproduction Richard Southwell, Chris Cannings School of Mathematics and Statistics, University of Sheffield, Sheffield, UK E-mail : bugzsouthwell@ Received June 26, 2010; revised August 10, 2010; accepted August 15, 2010 Abstract Many real world networks change over time. This may arise due to individuals joining or leaving the net- work or due to links forming or being broken. These events may arise because of interactions between the vertices which occasion payoffs which subsequently determine the fate of the nodes, due to ageing or crowding, or perhaps due to isolation. Such phenomena result in a dynamical system which may lead to complex behaviours, to self-replication, to chaotic or regular patterns, to emergent phenomena from local interactions. They give insight to the nature of the real-world phenomena which the network, and its dynam- ics, may approximate. To a large extent the models considered here are motivated by biological and social phenomena, where the vertices may be genes, proteins, genomes or organisms, and the links interactions of various kinds. In this, the first paper of a series, we consider the dynamics of pure reproduction models where networks grow relentlessly in a deterministic way. Keywords: Reproduction, Graph, Network, Adaptive, Evolution 1. Introduction of course, the preferential attachment model where a new