Von Neumann's expanding model on random graphs

Details Von Neumann's expanding model on random graphs Von Neumann's expanding model on random graphs

2007-03-13

arxiv.org/abs/cond-mat/0703343v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

20 pages

Scientific paper

10.1088/1742-5468/2007/05/P05012

Within the framework of Von Neumann's expanding model, we study the maximum growth rate r achievable by an autocatalytic reaction network in which reactions involve a finite (fixed or fluctuating) number D of reagents. r is calculated numerically using a variant of the Minover algorithm, and analytically via the cavity method for disordered systems. As the ratio between the number of reactions and that of reagents increases the system passes from a contracting (r<1) to an expanding regime (r>1). These results extend the scenario derived in the fully connected model ($D\to\infinity$), with the important difference that, generically, larger growth rates are achievable in the expanding phase for finite D and in more diluted networks. Moreover, the range of attainable values of r shrinks as the connectivity increases.

Affiliated with

Also associated with

No associations

Rating

Von Neumann's expanding model on random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Von Neumann's expanding model on random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Von Neumann's expanding model on random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-438691