Connectivity disruption sparks explosive epidemic spreading.

We investigate the spread of an infection or other malfunction of cascading nature when a system component can recover only if it remains reachable from a functioning central component. We consider the susceptible-infected-susceptible model, typical of mathematical epidemiology, on a network. Infection spreads from infected to healthy nodes, with the addition that infected nodes can only recover when they remain connected to a predefined central node, through a path that contains only healthy nodes. In this system, clusters of infected nodes will absorb their noninfected interior because no path exists between the central node and encapsulated nodes. This gives rise to the simultaneous infection of multiple nodes. Interestingly, the system converges to only one of two stationary states: either the whole population is healthy or it becomes completely infected. This simultaneous cluster infection can give rise to discontinuous jumps of different sizes in the number of failed nodes. Larger jumps emerge at lower infection rates. The network topology has an important effect on the nature of the transition: we observed hysteresis for networks with dominating local interactions. Our model shows how local spread can abruptly turn uncontrollable when it disrupts connectivity at a larger spatial scale.

On the robustness of update schedules in Boolean networks.

Deterministic Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states are to be updated. 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. For a given Boolean network, we define equivalence classes of update schedules with the same dynamical behavior, introducing a labeled graph which helps to understand the dependence of the dynamics with respect to the update, and to identify interactions whose timing may be crucial for the presence of a particular attractor of the system. Several other results on the robustness of update schedules and of dynamical cycles with respect to update schedules are presented. Finally, we prove that our equivalence classes generalize those found in sequential dynamical systems.

A discrete mathematical model applied to genetic regulation and metabolic networks.

This paper describes the use of a discrete mathematical model to represent the basic mechanisms of regulation of the bacteria E. coli in batch fermentation. The specific phenomena studied were the changes in metabolism and genetic regulation when the bacteria use three different carbon substrates (glucose, glycerol, and acetate). The model correctly predicts the behavior of E. coli vis-à-vis substrate mixtures. In a mixture of glucose, glycerol, and acetate, it prefers glucose, then glycerol, and finally acetate. The model included 67 nodes; 28 were genes, 20 enzymes, and 19 regulators/biochemical compounds. The model represents both the genetic regulation and metabolic networks in an inrtegrated form, which is how they function biologically. This is one of the first attempts to include both of these networks in one model. Previously, discrete mathematical models were used only to describe genetic regulation networks. The study of the network dynamics generated 8 (2(3)) fixed points, one for each nutrient configuration (substrate mixture) in the medium. The fixed points of the discrete model reflect the phenotypes described. Gene expression and the patterns of the metabolic fluxes generated are described accurately. The activation of the gene regulation network depends basically on the presence of glucose and glycerol. The model predicts the behavior when mixed carbon sources are utilized as well as when there is no carbon source present. Fictitious jokers (Joker1, Joker2, and Repressor SdhC) had to be created to control 12 genes whose regulation mechanism is unknown, since glycerol and glucose do not act directly on the genes. The approach presented in this paper is particularly useful to investigate potential unknown gene regulation mechanisms; such a novel approach can also be used to describe other gene regulation situations such as the comparison between non-recombinant and recombinant yeast strain, producing recombinant proteins, presently under investigation in our group.

Swirling granular solidlike clusters

Experiments and three-dimensional numerical simulations are presented to elucidate the dynamics of granular material in a cylindrical dish driven by a horizontal, periodic motion. The following phenomena are obtained both in the experiments and in the simulations: First, for large particle numbers N the particles describe hypocycloidal trajectories. In this state the particles are embedded in a solidlike cluster ("pancake") which counter-rotates with respect to the external driving (reptation). Self-organization within the cluster occurs such that the probability distribution of the particles consists of concentric rings. Second, the system undergoes phase transitions. These can be identified by changes of the quantity dE(kin)/dN (E(kin) is the mean kinetic energy) between zero (rotation), positive (reptation), and negative values (appearance of the totality of concentric rings).

Intermingled basins due to finite accuracy

We investigate numerically first a chaotic map interrupted by two small neighborhoods, each containing an attracting point, and secondly a periodically tilted box within which disorderly colliding disks can reach different attracting configurations, due to dissipation. For finite, arbitrarily small accuracy, both systems have basins of attraction that are indistinguishable from intermingled basins: any neighborhood of a point in phase space leading to one attractor contains points leading to the other attractor. A bifurcation destabilizing the fixed points or the disk configurations causes on-off intermittency; the disks then alternate between a "frozen" and a gaslike state.

Dynamical properties of min-max networks.

In this paper we study the dynamical behavior of a class of neural networks where the local transition rules are max or min functions. We prove that sequential updates define dynamics which reach the equilibrium in O(n2) steps, where n is the size of the network. For synchronous updates the equilibrium is reached in O(n) steps. It is shown that the number of fixed points of the sequential update is at most n. Moreover, given a set of p < or = n vectors, we show how to build a network of size n such that all these vectors are fixed points.

Shell structures with "magic numbers" of spheres in a swirled dish.

Molecular dynamic simulations of a low number N< or = 54 of spheres in a swirled dish yield solid-like shell structures with stable rings. In contrast to known granular media, solidification occurs only at singular values of N: 7, 8, 12, 14, 19, 21, 30, 37, 40. Otherwise, we obtain intermittent switching of particles between rings -- the average switching time scaling exponentially with a control parameter -- or fluid-like disorder. Stable shell structures can be classified by particular geometrical arrangements (one-centered hexagonal, one-centered "quasicircular," three centered, and four centered).

Dynamical and complexity results for high order neural networks.

We present dynamical results concerning neural networks with high order arguments. More precisely, we study the family of block-sequential iteration of neural networks with polynomial arguments. In this context, we prove that, under a symmetric hypothesis, the sequential iteration is the only one of this family to converge to fixed points. The other iteration modes present a highly complex dynamical behavior: non-bounded cycles and simulation of arbitrary non-symmetric linear neural network. We also study a high order memory iteration scheme which accepts an energy functional and bounded cycles in the size of the memory steps.