Dynamical complexity of discrete time regulatory networks

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages, 4 figures

Scientific paper

Genetic regulatory networks are usually modeled by systems of coupled differential equations and by finite state models, better known as logical networks, are also used. In this paper we consider a class of models of regulatory networks which present both discrete and continuous aspects. Our models consist of a network of units, whose states are quantified by a continuous real variable. The state of each unit in the network evolves according to a contractive transformation chosen from a finite collection of possible transformations, according to a rule which depends on the state of the neighboring units. As a first approximation to the complete description of the dynamics of this networks we focus on a global characteristic, the dynamical complexity, related to the proliferation of distinguishable temporal behaviors. In this work we give explicit conditions under which explicit relations between the topological structure of the regulatory network, and the growth rate of the dynamical complexity can be established. We illustrate our results by means of some biologically motivated examples.

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

Dynamical complexity of discrete time regulatory 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 Dynamical complexity of discrete time regulatory networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamical complexity of discrete time regulatory networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-215911

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