相关论文: Critical Kauffman networks under deterministic asy…

A chaotic network of size $N$ with delayed interactions which resembles a pseudo-inverse associative memory neural network is investigated. For a load $\alpha=P/N<1$, where $P$ stands for the number of stored patterns, the chaotic network…

We investigate the dynamics of network minority games on Kauffman's NK networks (Kauffman nets), growing directed networks (GDNets), as well as growing directed networks with a small fraction of link reversals (GDRNets). We show that the…

There are three main aims of this paper. 1- I explain reasons why I await life to lie significantly deeper in chaos than Kauffman approach does, however still in boundary area near `the edge of chaos and order'. The role of negative…

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…

Boolean networks have been the object of much attention, especially since S. Kauffman proposed them in the 1960's as models for gene regulatory networks. These systems are characterized by being defined on a Boolean state space and by…

How do update rules affect the dynamical and steady state properties of a flock? In this study, we have explored the active Ising spins (s = +-1) in one dimension, where spin updates its orientation according to the Metropolis algorithm…

We investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and modifications of it. We show that even small Random Boolean Networks agree well with the predictions of the annealed approximation, but…

Observing the internal state of the whole system using a small number of sensor nodes is important in analysis of complex networks. Here, we study the problem of determining the minimum number of sensor nodes to discriminate attractors…

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…

We investigate analytically and numerically the dynamical properties of critical Boolean networks with power-law in-degree distributions. When the exponent of the in-degree distribution is larger than 3, we obtain results equivalent to…

Asynchronous Boolean networks are a type of discrete dynamical system in which each variable can take one of two states, and a single variable state is updated in each time step according to pre-selected rules. Boolean networks are popular…

We propose new activity-dependent adaptive Boolean networks inspired by the cis-regulatory mechanism in gene regulatory networks. We analytically show that our model can be solved for stationary in-degree distribution for a wide class of…

Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…

We develop a framework for collective frequency selection and attractor formation by means of delay plasticity. Specifically, we consider adaptive axonal delays (AADs), motivated by activity-dependent myelination in the brain which…

We study the dynamics of networks with coupling delay, from which the connectivity changes over time. The synchronization properties are shown to depend on the interplay of three time scales: the internal time scale of the dynamics, the…

We study the dynamics of discrete-time regulatory networks on random digraphs. For this we define ensembles of deterministic orbits of random regulatory networks, and introduce some statistical indicators related to the long-term dynamics…

We investigate how elimination of variables can affect the asymptotic dynamics and phenotype control of Boolean networks. In particular, we look at the impact on minimal trap spaces, and identify a structural condition that guarantees their…

Automata networks are mappings of the form f : Q Z $\rightarrow$ Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its…

We study the phase time for various quantum mechanical networks having potential barriers in its arms to find the generic presence of Hartman effect. In such systems it is possible to control the `super arrival' time in one of the arms by…

Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the…