ABSTRACT
This chapter provides the study of the generic properties of random boolean networks. It describes a large number of examples of generic properties. The chapter introduces a series of tests, corresponding to generic properties, which will enable people to elucidate the differences between the two dynamical regimes. Stuart Kauffman studied the dynamical properties of random boolean networks as early as the late '60's. He constructed networks of boolean automata with an arbitrary input connectivity k. The notion of generic properties is similar to the notion of universality classes, developed for phase transitions. The histogram reveals that the order of magnitude of the period is ten , even though the distribution of the periods is quite large. The scaling laws which relate the period and the number of attractors to the number of automata are generic properties of random boolean networks.
