derrida: Derrida analysis.

In mar-esther23/boolnet-perturb: Perturb Boolean Networks

Description

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.

Usage

derrida(net, repetitions = 1000)

Arguments

net	BoolNet network to perturb
repetitions	number of repetitions

Value

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

Examples

data(cellcycle)
derrida(cellcycle)

mar-esther23/boolnet-perturb documentation built on April 21, 2020, 9:11 a.m.