2008
DOI: 10.1103/physreve.78.056214
|View full text |Cite
|
Sign up to set email alerts
|

Periodic-orbit analysis and scaling laws of intermingled basins of attraction in an ecological dynamical system

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
19
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(20 citation statements)
references
References 41 publications
1
19
0
Order By: Relevance
“…In general, networks are useful models for studying systems that have a spatial extension. For instance, insect populations whose interaction between them produces the extinction of one of them 8 , the interaction between proteins 9 and the interaction between gears 10 . These networks can be represented by a multiplex network of coupled complex subnetworks 11 12 13 14 15 16 17 18 .…”
mentioning
confidence: 99%
“…In general, networks are useful models for studying systems that have a spatial extension. For instance, insect populations whose interaction between them produces the extinction of one of them 8 , the interaction between proteins 9 and the interaction between gears 10 . These networks can be represented by a multiplex network of coupled complex subnetworks 11 12 13 14 15 16 17 18 .…”
mentioning
confidence: 99%
“…We return to this in Remark 3.10 after the proof of Theorem 3, where we derive an approximate formula for φ that yields a value twice as large as that used in [22,23,26]. This might explain why not only in [22, Figure 13], but also in [26, Figure 6b (small κ)], the numerically observed values for φ are roughly twice as large as the values suggested by the formula used there.…”
Section: The Uncertainty Exponentmentioning
confidence: 89%
“…We compare the exponent φ with the corresponding one from [22,23] (also called φ in those papers), which is derived there for the case of riddled basins. That formula is taken as a reference in [26], although the authors of that paper study numerically the model from [14], which has intermingled basins. So we take the chance to derive an approximate formula in the style of [22,23] for the model studied in [14,26], although it has the full logistic map as its driving system.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…For hyperbolic chaotic systems the time of shadowing is unlimited [16,17], and most of chaotic systems with homoclinic tangencies also have a reasonably long shadowing time [18]. For systems with UDV the shadowing time can be small which is a serious obstacle for computer modelings [14,12,19]. In [14] the estimates for shadowing time and distance are found to be functions of computer round-off error and variance of the sing-changing FTLE.…”
Section: Introductionmentioning
confidence: 99%