• Publications
  • Influence
Decreasing energy functions as a tool for studying threshold networks
TLDR
Block sequential iterations of threshold networks are studied through the use of a monotonic operator, analogous to the spin glass energy. Expand
  • 247
  • 11
Games on Line Graphs and Sand Piles
TLDR
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
  • 91
  • 10
  • PDF
Comportement periodique des fonctions a seuil binaires et applications
TLDR
We show that the repeated application of a function from {0, 1} n to itself leads either to a fixed point or to a cycle of length two. Expand
  • 80
  • 8
Positive and negative circuits in discrete neural networks
TLDR
We study the relationships between the positive and negative circuits of the connection graph and the fixed points of discrete neural networks (DNNs). Expand
  • 71
  • 7
On the robustness of update schedules in Boolean networks
TLDR
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
  • 86
  • 6
  • PDF
Sandpiles and order structure of integer partitions
TLDR
We show that these orders are suborders of L B , lattice of integer partitions introduced in Brylawski (Discrete Math. Expand
  • 52
  • 6
  • PDF
Periodic behaviour of generalized threshold functions
TLDR
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
  • 97
  • 3
Comportement oscillatoire d'une famille d'automates cellulaires non uniformes
TLDR
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. Expand
  • 17
  • 3
On limit cycles of monotone functions with symmetric connection graph
TLDR
We study the length of the limit cycles of networks with monotone discrete updating functions and symmetric connection graph. Expand
  • 49
  • 2
  • PDF