Schmal, Christoph ; Peixoto, Tiago P. ; Drossel, Barbara (2024)
Boolean networks with robust and reliable trajectories.
In: New Journal of Physics, 2010, 12 (11)
doi: 10.26083/tuprints-00020561
Artikel, Zweitveröffentlichung, Verlagsversion
 | Es ist eine neuere Version dieses Eintrags verfügbar. |
Kurzbeschreibung (Abstract)
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2024 |
| Autor(en): | Schmal, Christoph ; Peixoto, Tiago P. ; Drossel, Barbara |
| Art des Eintrags: | Zweitveröffentlichung |
| Titel: | Boolean networks with robust and reliable trajectories |
| Sprache: | Englisch |
| Publikationsjahr: | 5 März 2024 |
| Ort: | Darmstadt |
| Publikationsdatum der Erstveröffentlichung: | 30 November 2010 |
| Ort der Erstveröffentlichung: | London |
| Verlag: | IOP Publishing |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | New Journal of Physics |
| Jahrgang/Volume einer Zeitschrift: | 12 |
| (Heft-)Nummer: | 11 |
| Kollation: | 13 Seiten |
| DOI: | 10.26083/tuprints-00020561 |
| URL / URN: | https://tuprints.ulb.tu-darmstadt.de/20561 |
| Zugehörige Links: | |
| Herkunft: | Zweitveröffentlichung DeepGreen |
| Kurzbeschreibung (Abstract): | We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory. |
| ID-Nummer: | Artikel-ID: 113054 |
| Status: | Verlagsversion |
| URN: | urn:nbn:de:tuda-tuprints-205610 |
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 500 Naturwissenschaften und Mathematik > 530 Physik |
| Fachbereich(e)/-gebiet(e): | 05 Fachbereich Physik 05 Fachbereich Physik > Institut für Physik Kondensierter Materie (IPKM) |
| Hinterlegungsdatum: | 05 Mär 2024 10:13 |
| Letzte Änderung: | 07 Mär 2024 10:21 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
Verfügbare Versionen dieses Eintrags
- Boolean networks with robust and reliable trajectories. (deposited 05 Mär 2024 10:13) [Gegenwärtig angezeigt]
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum