We propose the application of information content to analyze the time and space evolution of some boolean networks, and to give a classification of their state as either solid, jelly, liquid, or gaseous, following the ideas of Kauffman. To these aims both individual nodes and the global network are studied by means of data compression. Some experiments are presented using the compression algorithm CASToRe, developed along Lempel-Ziv algorithms.
Computable information content and boolean networks dynamics
BONANNO, CLAUDIO;BENCI, VIERI;CERRAI, PAOLA
2005
Abstract
We propose the application of information content to analyze the time and space evolution of some boolean networks, and to give a classification of their state as either solid, jelly, liquid, or gaseous, following the ideas of Kauffman. To these aims both individual nodes and the global network are studied by means of data compression. Some experiments are presented using the compression algorithm CASToRe, developed along Lempel-Ziv algorithms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
