### Abstract

An organism persists only if it satisfies internal and external constraints. Within the organism networks of processes meet the constraints. In such networks a principle of matching often obtains: the pattern of coupling among processes matches the correlation among constraints. That is, a module-a cluster of coupled processes-meets a constraint. Dissociable modules meet dissociàble constraints. A hierarchy of modules meets a hierarchy of constraints. We have inquired whether such matching is predicted by an optimality criterion in a simple example. We find that in an ensemble of networks with unreliable processes, the networks that meet the constraints with highest reliability obey the principle of matching. The difference in reliability between modular and nonmodular networks that meet the same constraints is a function of the probability of success per process. Our results suggest that this difference is maximal at a probability of success that increases monotonically with the number of processes in the network.

Original language | English (US) |
---|---|

Pages (from-to) | 1-20 |

Number of pages | 20 |

Journal | Bulletin of Mathematical Biology |

Volume | 54 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 1992 |

### Fingerprint

### ASJC Scopus subject areas

- Neuroscience(all)
- Immunology
- Mathematics(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Environmental Science(all)
- Pharmacology
- Agricultural and Biological Sciences(all)
- Computational Theory and Mathematics

### Cite this

*Bulletin of Mathematical Biology*,

*54*(1), 1-20. https://doi.org/10.1007/BF02458617