| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Von Neumann's expanding model on random graphs | A De Martino
; C Martelli
; R Monasson
; I Perez Castillo
; | Date: |
13 Mar 2007 | Subject: | Disordered Systems and Neural Networks | Abstract: | 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 oinfinity$), 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. | Source: | arXiv, cond-mat/0703343 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |