Boolean Dynamics of Kauffman Models with a Scale-Free Network

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 8 figures

Scientific paper

We study the Boolean dynamics of the "quenched" Kauffman models with a directed scale-free network, comparing with that of the original directed random Kauffman networks and that of the directed exponential-fluctuation networks. We have numerically investigated the distributions of the state cycle lengths and its changes as the network size $N$ and the average degree $$ of nodes increase. In the relatively small network ($N \sim 150$), the median, the mean value and the standard deviation grow exponentially with $N$ in the directed scale-free and the directed exponential-fluctuation networks with $ =2 $, where the function forms of the distributions are given as an almost exponential. We have found that for the relatively large $N \sim 10^3$ the growth of the median of the distribution over the attractor lengths asymptotically changes from algebraic type to exponential one as the average degree $$ goes to $ =2$. The result supports an existence of the transition at $_c =2$ derived in the annealed model.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Boolean Dynamics of Kauffman Models with a Scale-Free Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boolean Dynamics of Kauffman Models with a Scale-Free Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean Dynamics of Kauffman Models with a Scale-Free Network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-229478

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.