Related papers: Random sampling vs. exact enumeration of attractor…
Identification of attractors, that is, stable states and sustained oscillations, is an important step in the analysis of Boolean models and exploration of potential variants. We describe an approach to the search for asynchronous cyclic…
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
It has been shown \citep{broeck90:physicalreview,patarnello87:europhys} that feedforward Boolean networks can learn to perform specific simple tasks and generalize well if only a subset of the learning examples is provided for learning.…
Discrete dynamical systems in which model components take on categorical values have been successfully applied to biological networks to study their global dynamic behavior. Boolean models in particular have been used extensively. However,…
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains $N$ Boolean elements each with $K$ inputs. A directed state space network (SSN) is constructed by linking each dynamical state,…
We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of…
The growth in number and nature of dynamical attractors in Kauffman NK network models are still not well understood properties of these important random boolean networks. Structural circuits in the underpinning graph give insights into the…
Chaotic dynamical systems with two or more attractors lying on invariant subspaces may, provided certain mathematical conditions are fulfilled, exhibit intermingled basins of attraction: Each basin is riddled with holes belonging to basins…
We consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…
Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from a state s in any attractor As in A to any attractor At in A…
The Newton-Raphson basins of attraction, associated with the libration points (attractors), are revealed in the generalized Hill problem. The parametric variation of the position and the linear stability of the equilibrium points is…
Are biological networks different from other large complex networks? Both large biological and non-biological networks exhibit power-law graphs (number of nodes with degree k, N(k) ~ k-b) yet the exponents, b, fall into different ranges.…
In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-\gamma}$ under a boolean dynamic, where the boolean rule that each node obeys is a function of its connectivity $k$. This is done by using only two…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
The Strong Law of Large Numbers (SLLN) for random variables or random vectors with different mathematical expectations easily reduces by means of shifts to SLLN for random variables or random vectors whose mathematical expectations are…
We consider a boolean network whose interaction graph has no circuit of length >1. Under this hypothesis, we establish an upper bound on the length of the attractors of the network which only depends on its interaction graph.
We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…
The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen…
It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the necklaces must be without some forbidden factors. This problem…