2013
DOI: 10.1063/1.4790833
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing chaotic dynamics from simulations of large strain behavior of a granular material under biaxial compression

Abstract: For a given observed time series, it is still a rather difficult problem to provide a useful and compelling description of the underlying dynamics. The approach we take here, and the general philosophy adopted elsewhere, is to reconstruct the (assumed) attractor from the observed time series. From this attractor, we then use a black-box modelling algorithm to estimate the underlying evolution operator.We assume that what cannot be modeled by this algorithm is best treated as a combination of dynamic and observ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 54 publications
(99 reference statements)
0
7
0
Order By: Relevance
“…Several studies demonstrate that distinct features of a time series can be mapped onto networks with distinct topological characteristics. 17,23,24 In a network the way in which nodes connect with edges is very important. In the literature, several methods for converting time series into a complex network have been proposed.…”
Section: A From Time Series To Complex Networkmentioning
confidence: 99%
“…Several studies demonstrate that distinct features of a time series can be mapped onto networks with distinct topological characteristics. 17,23,24 In a network the way in which nodes connect with edges is very important. In the literature, several methods for converting time series into a complex network have been proposed.…”
Section: A From Time Series To Complex Networkmentioning
confidence: 99%
“…Doing this will preserve the degree distribution of the network, but otherwise generate a random graph. This is fine for comparing the observed network properties (diameter, assortativity, clustering and so-on [9,8]) to an ensemble of random networks with an identical histogram of node degrees 1 . However, it is neither clear what this ensemble is representative of, nor how to generalise to more complicated sampling of families of graphs.…”
Section: Introductionmentioning
confidence: 99%
“…The characterization, in the previous section, of this system as chaotic really just implies that a lowdimensional dynamical system is capable of explaining most of the observed variability in the system ( Table 2 demonstrated that there is still a non-trivial "noise" component) -combined with more detailed forthcoming analysis [12] we conclude that four degrees of freedom are sufficient. Four degrees (d = 4) is the minimum sufficient dimension to produce useful models, and hence implies the minimum number of first order differential equations necessary to describe the system.…”
Section: Discussionmentioning
confidence: 98%