Stability of vertices in random boolean cellular automata

Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automaton which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves.     

An expedient route to diaza-spirocycles utilizing a sequential multicomponent α-aminoallylation/ring-closing metathesis strategy

A general method for the preparation of diaza-spirocycles is reported. This method used an olefin metathesis in order to construct the desired spirocyclic framework. Beginning with commercially available protected amino ketones, this strategy ultimately produced pharmacologically relevant diaza-scaffolds in an efficient and high-yielding process.     

Preface

Journal of Statistical Physics -     

Equilibrium statistics of a vortex filament with applications

The thermodynamic functions and scaling exponents (including the Kolmogorov and Flory exponents) of a vortex filament in thermal equilibrium are calculated, giving a quantitative content to earlier qualitative analyses. The numerical results uncover a percolation property of vortex filaments near the maximum entropy state. The implications of the results for the onset of turbulence, for the structure of its inertial range, and for superfluid vortices are discussed. In particular, it is shown that vortex stretching pushes a vortex system to a polymeric state and a Kolmogorov spectrum.This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract DE-AC03-76SF-00098, and in part by the National Science Foundation under grant number DMS89-19074     

Can you feel the double jump?

When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.