We investigate the dynamics of several games on line graphs and provide closed formulas for the transient time lengths they require to reach the steady state.Expand

We study the relationships between the positive and negative circuits of the connection graph and the fixed points of discrete neural networks (DNNs).Expand

We study the robustness of the dynamical behavior of a Boolean network with respect to different update schedules (synchronous, block-sequential, sequential), which can provide modelers with a better understanding of the consequences of changes in this aspect of the model.Expand

It is shown that, for a function @D from {0, 1}^n to a symmetric set of threshold functions the repeated application of @D, leads either to a fixed point or to a cycle of length two.Expand

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.Expand