Description Usage Arguments Value Examples

View source: R/BNP_PerDerrida.R

Derrida curves are used to determine the dynamic behaviour of Boolean networks. We take two states with Hamming distance h in the time t, and determine the hamming distance in time t+1. This process is repeated multiple times. If the network is chaotic, the curve tends to be over the diagonal. If the network is ordered it will be below the diagonal.

1 | ```
derrida(net, repetitions = 1000)
``` |

`net` |
BoolNet network to perturb |

`repetitions` |
number of repetitions |

vector with average hamming distance in t+1, names are hamming distance in t

1 2 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.