Circuits, Attractors and Reachability in Mixed-K Kauffman Networks

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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 on the growth properties and the number of attractor loops and a possible K-relationship for circuit number growth with network size N. We also introduce a mixed-K model that allows us to explore between pairs of integer K values in Kauffman-like systems. We find that the circuits' behaviour is a useful metric in identifying phase transitional behaviour around the critical connectivity in that model too. We identify an intermediate phase transition in circuit growth behaviour at K_S approximately 1.5, that is distinct from both the percolation transition at K_P = 1 and the Kauffman transition at K_C = 2. We relate this transition to mutual node reachability within the giant component of nodes.

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

Circuits, Attractors and Reachability in Mixed-K Kauffman Networks 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 Circuits, Attractors and Reachability in Mixed-K Kauffman Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuits, Attractors and Reachability in Mixed-K Kauffman Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-215135

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