Network Science

Dynamics of complex systems: scaling laws for the period of boolean networks

Boolean networks serve as models for complex systems, such as social or genetic networks, where each vertex, based on inputs received from selected vertices, makes its own decision about its state. Despite their simplicity, little is known about the dynamical properties of these systems. Here we propose a method to calculate the period of a finite Boolean system, by identifying the mechanisms determining its value. The proposed method can be applied to systems of arbitrary topology, and can serve as a roadmap for understanding the dynamics of large interacting systems in general.


More publications
S. Lee, I. Daruka, C.S. Kim, A.-L. Barabási, J.L. Merz, J.K. Furdyna

Physical Review Letters 81, 3479-3482 (1998)

U. Frey, M. Silverman, A.-L. Barabási, B. Suki

Journal of Applied Physiology 85, 789–797 (1998)

A.-L. Barabási, R. Albert, P. Schiffer

Physica A 266, 366-371 (1999)