Dominant Vertices in Regulatory Networks Dynamics

Nonlinear Sciences – Adaptation and Self-Organizing Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.physd.2008.04.007

Discrete-time regulatory networks are dynamical systems on directed graphs, with a structure inspired on natural systems of interacting units. There is a natural notion of determination amongst vertices, which we use to classify the nodes of the network, and to determine what we call "sets of dominant vertices". In this paper we prove that in the asymptotic regime, the projection of the dynamics on a dominant set allows us to determine the state of the whole system at all times. We provide an algorithm to find sets of dominant vertices, and we test its accuracy on three families of theoretical examples. Then, by using the same algorithm, we study the relation between the structure of the underlying network and the corresponding dominant set of vertices. We also present a result concerning the inheritability of the dominance between strongly connected networks.

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

Dominant Vertices in Regulatory Networks Dynamics 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 Dominant Vertices in Regulatory Networks Dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dominant Vertices in Regulatory Networks Dynamics will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-499854

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