Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Logistic map
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== When there is a time delay === [[File:遅延ロジスティック写像.png|class=skin-invert-image|thumb|The trajectory of the delayed logistic map. The initial values <math>(x_0 , y_0)</math> are the same in both figures, but at the bifurcation point r = 2, the trajectory is attracted to a closed curve (left) and a point (right).]] If we interpret the logistic map as a model of the population of each generation of organisms, it is possible that the population of the next generation will affect not only the population of the current generation, but also the population of the generation before that. <!--[ 341 ]--> An example of such a case is {{NumBlk|:|<math>{\displaystyle x_{n+1}=ax_{n}(1-x_{n-1})}</math>|{{EquationRef|6-4}}}} where the number of individuals in the previous generation, <math>x_{n-1}</math>, is included in the equation as a negative density effect <!--[ 341 ]-->. If <math>x_{n+1} = y_n</math>, then equation ( 6-4 ) can be replaced by the following two-variable difference equation <!--[ 342 ]-->. {{NumBlk|:|<math>{\displaystyle {\begin{cases}x_{n+1}=y_{n}\\y_{n+1}=ay_{n}(1-x_{n})\end{cases}}}</math>|{{EquationRef|6-5}}}} This dynamical system is used to study bifurcation of quasi-periodic attractors and is called the delayed logistic map <!--[ 342 ]--> <!--[ 343 ]-->. The delayed logistic map exhibits a Neimark–Sakher bifurcation at r = 2, where the asymptotically stable fixed point becomes unstable and an asymptotically stable invariant curve forms around the unstable fixed point <!--[ 344 ]-->.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)