Invariant cycles in the random mapping of N integers onto themselves. Comparison with Kauffman binary network
From MaRDI portal
Publication:2964432
Recommendations
Cited in
(7)- The number of fixed points of the majority rule
- Closing probabilities in the Kauffman model: An annealed computation
- Predictability: a way to characterize complexity
- On the number of \(NK\)-Kauffman networks mapped into a functional graph
- Comment on a genetic application of square-lattice Kauffman models.
- Beyond the binary case in random nets
- Cycles in random k-ary maps and the poor performance of random number generation
This page was built for publication: Invariant cycles in the random mapping of \(N\) integers onto themselves. Comparison with Kauffman binary network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964432)