ID: cond-mat/0510430

Boolean Dynamics of Kauffman Models with a Scale-Free Network

October 17, 2005

View on ArXiv

Similar papers 2

The dynamics of critical Kauffman networks under asynchronous stochastic update

January 5, 2005

88% Match
Florian Greil, Barbara Drossel
Disordered Systems and Neura...
Statistical Mechanics

We show that the mean number of attractors in a critical Boolean network under asynchronous stochastic update grows like a power law and that the mean size of the attractors increases as a stretched exponential with the system size. This is in strong contrast to the synchronous case, where the number of attractors grows faster than any power law.

Find SimilarView on arXiv

Dynamics of Unperturbed and Noisy Generalized Boolean Networks

September 29, 2009

87% Match
Christian Darabos, Marco Tomassini, Mario Giacobini
Adaptation and Self-Organizi...

For years, we have been building models of gene regulatory networks, where recent advances in molecular biology shed some light on new structural and dynamical properties of such highly complex systems. In this work, we propose a novel timing of updates in Random and Scale-Free Boolean Networks, inspired by recent findings in molecular biology. This update sequence is neither fully synchronous nor asynchronous, but rather takes into account the sequence in which genes affect ...

Find SimilarView on arXiv

On the properties of cycles of simple Boolean networks

October 21, 2004

87% Match
V. Kaufman, B. Drossel
Disordered Systems and Neura...

We study two types of simple Boolean networks, namely two loops with a cross-link and one loop with an additional internal link. Such networks occur as relevant components of critical K=2 Kauffman networks. We determine mostly analytically the numbers and lengths of cycles of these networks and find many of the features that have been observed in Kauffman networks. In particular, the mean number and length of cycles can diverge faster than any power law.

Find SimilarView on arXiv

Circuits, Attractors and Reachability in Mixed-K Kauffman Networks

November 15, 2007

87% Match
K. A. Hawick, H. A. James, C. J. Scogings
Disordered Systems and Neura...

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 number and length distribution of attractors in the NK model. We use a fast direct circuit enumeration algorithm to study the NK model and determine the growth behaviour of structural circuits. This leads to an explanation and lower bound o...

Find SimilarView on arXiv

Dynamical Coarse Graining of Large Scale-Free Boolean networks

March 7, 2006

87% Match
Wen-Xu Wang, Gang Yan, ... , Wang Bing-Hong
Disordered Systems and Neura...

We present a renormalization-grouplike method performed in the state space for detecting the dynamical behaviors of large scale-free Boolean networks, especially for the chaotic regime as well as the edge of chaos. Numerical simulations with different coarse-graining level show that the state space networks of scale-free Boolean networks follow universal power-law distributions of in and out strength, in and out degree, as well as weight. These interesting results indicate sc...

Find SimilarView on arXiv

Mean-Field and Non-Mean-Field Behaviors in Scale-free Networks with Random Boolean Dynamics

October 27, 2009

87% Match
A. Castro e Silva, Silva J. Kamphorst Leal da
Biological Physics
Statistical Mechanics
Computational Physics

We study two types of simplified Boolean dynamics over scale-free networks, both with synchronous update. Assigning only Boolean functions AND and XOR to the nodes with probability $1-p$ and $p$, respectively, we are able to analyze the density of 1's and the Hamming distance on the network by numerical simulations and by a mean-field approximation (annealed approximation). We show that the behavior is quite different if the node always enters in the dynamic as its own input ...

Find SimilarView on arXiv

Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case

March 7, 2012

87% Match
Espanés Pablo Moisset de, Axel Osses, Iván Rapaport
Cell Behavior
Molecular Networks

Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random Boolean networks (RBNs). We start this paper by proving that, if we fix the values of the source nodes (nodes with in-degree 0), the expected number of fixed points of any RBN is one (independently of the topology we choose). For finding su...

Find SimilarView on arXiv

Reversible Boolean Networks I: Distribution of Cycle Lengths

April 25, 2000

87% Match
S. N. Coppersmith, Leo P. Kadanoff, Zhitong Zhang
Disordered Systems and Neura...
Dynamical Systems
Chaotic Dynamics
Cellular Automata and Lattic...
Computational Physics

We consider a class of models describing the dynamics of $N$ Boolean variables, where the time evolution of each depends on the values of $K$ of the other variables. Previous work has considered models with dissipative dynamics. Here we consider time-reversible models, which necessarily have the property that every possible point in the state-space is an element of one and only one cycle. As in the dissipative case, when K is large, typical orbit lengths grow exponentially ...

Find SimilarView on arXiv

Stability of the Kauffman Model

July 2, 2001

86% Match
S. Bilke, F. Sjunnesson
Statistical Mechanics
Disordered Systems and Neura...

Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which reduces the networks to their dynamical cores. The average size of the removed part, the stable core, grows approximately linearly with N, the number of nodes in the original networks. We show that this can be understood as the percolation of the stability signal in the network. The stability of the dynamical core is investigated and it is shown that this core lacks the ...

Find SimilarView on arXiv

On the number of attractors in random Boolean networks

March 21, 2005

86% Match
Barbara Drossel
Statistical Mechanics
Disordered Systems and Neura...

The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update functions. A connection is made between the terms occurring in the calculation and between the more graphic concepts of frozen, nonfrozen and relevant nodes, and relevant components. Based on this understanding, a phenomenological argument...

Find SimilarView on arXiv