From 60be01d9799b6ebb2b262ee4d93a11b9e6e50470 Mon Sep 17 00:00:00 2001 From: Sergiu Ivanov Date: Thu, 12 Nov 2020 01:11:15 +0100 Subject: [PATCH] networks: Fix and simplify the comment of Inferring interaction graphs. --- networks.rkt | 12 ++---------- 1 file changed, 2 insertions(+), 10 deletions(-) diff --git a/networks.rkt b/networks.rkt index c493e0d..6783f58 100644 --- a/networks.rkt +++ b/networks.rkt @@ -278,19 +278,11 @@ ;;; Inferring interaction graphs ;;; ============================ -;;; I allow any syntactic forms in definitions of Boolean functions. -;;; I can still find out which Boolean variables appear in those -;;; syntactic form, but I have no reliable syntactic means of finding -;;; out what kind of action do they have (inhibition or activation) -;;; since I cannot do Boolean minimisation (e.g., I cannot rely on not -;;; appearing before a variable, since (not (not a)) is equivalent -;;; to a). On the other hand, going through all Boolean states is -;;; quite resource-consuming and thus not always useful. -;;; ;;; In this section I provide inference of both unsigned and signed ;;; interaction graphs, but since the inference of signed interaction ;;; graphs is based on analysing the dynamics of the networks, it may -;;; be quite resource-consuming. +;;; be quite resource-consuming, especially since I allow any +;;; syntactic forms in the definitions of the functions. ;;; Lists the variables of the network form appearing in the update ;;; function form for x.