Spectral methods for testing membership in certain post classes and the class of forcing functions

Forcing functions represent an important class of Boolean functions that have been extensively studied in the analysis of the dynamics of random Boolean networks as models of genetic regulatory systems. Several other so-called Post classes of Boolean functions are closely related to forcing functions and have been used in learning theory as well as in control systems. We develop novel spectral algorithms to test membership of a Boolean function in these classes. These algorithms are highly efficient and are essential in learning problems, especially in the context of genetic regulatory networks, where the same learning procedures are applied repeatedly.

[1]  James F. Lynch.  On the Threshold of Chaos in Random Boolean Cellular Automata , 1995, Random Struct. Algorithms.

[2]  Stuart A. Kauffman,et al.  Requirements for evolvability in complex systems: orderly dynamics and frozen components , 1990 .

[3]  S Bornholdt,et al.  Robustness as an evolutionary principle , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[4]  Pao-Ta Yu,et al.  Convergence behavior and root signal sets of stack filters , 1992 .

[5]  Pao-Ta Yu,et al.  On the existence and design of the best stack filter based associative memory , 1990, IEEE International Symposium on Circuits and Systems.

[6]  J. Astola,et al.  Fundamentals of Nonlinear Digital Filtering , 1997 .

[7]  Andrew Wuensche,et al.  A model of transcriptional regulatory networks based on biases in the observed regulation rules , 2002, Complex..

[8]  Pao-Ta Yu,et al.  The classification and associative memory capability of stack filters , 1992, IEEE Trans. Signal Process..

[9]  Liang,et al.  Power-Law Distributions in Some Random Boolean Networks. , 1996, Physical review letters.

[10]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[11]  Jaakko Astola,et al.  The role of certain Post classes in Boolean network models of genetic networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Dietrich Stauffer.  On forcing functions in Kauffman's random Boolean networks , 1987 .

[13]  J. Urry.  Complexity , 2006, Interpreting Art.

[14]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[15]  Edward J. Coyle,et al.  Stack filters , 1986, IEEE Trans. Acoust. Speech Signal Process..

[16]  Pao-Ta Yu,et al.  On the existence and design of the best stack filter based associative memory , 1992 .

[17]  J. Astola,et al.  Binary polynomial transforms and nonlinear digital filters , 1995 .

[18]  M. Stern,et al.  Emergence of homeostasis and "noise imprinting" in an evolution model. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Jaakko Astola,et al.  Complexity of the consistency problem for certain Post classes , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[20]  Pao-Ta Yu,et al.  Convergence behavior and N-roots of stack filters , 1990, IEEE Trans. Acoust. Speech Signal Process..

[21]  L. Glass,et al.  Ordered and disordered dynamics in random networks , 1998 .