Saturation Probabilities of Continuous-Time Sigmoidal Networks

Details Saturation Probabilities of Continuous-Time Sigmoidal Networks Saturation Probabilities of Continuous-Time Sigmoidal Networks

2010-10-08

arxiv.org/abs/1010.1714v1

Biology

Quantitative Biology

Neurons and Cognition

53 pages, 9 Figures

Scientific paper

From genetic regulatory networks to nervous systems, the interactions between elements in biological networks often take a sigmoidal or S-shaped form. This paper develops a probabilistic characterization of the parameter space of continuous-time sigmoidal networks (CTSNs), a simple but dynamically-universal model of such interactions. We describe an efficient and accurate method for calculating the probability of observing effectively M-dimensional dynamics in an N-element CTSN, as well as a closed-form but approximate method. We then study the dependence of this probability on N, M, and the parameter ranges over which sampling occurs. This analysis provides insight into the overall structure of CTSN parameter space.

Affiliated with

Also associated with

No associations

Rating

Saturation Probabilities of Continuous-Time Sigmoidal 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 Saturation Probabilities of Continuous-Time Sigmoidal Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Saturation Probabilities of Continuous-Time Sigmoidal Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486756