اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymbolic dynamics techniques for complex systems: Application to share price dynamics
57
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The symbolic dynamics technique is well-known for low-dimensional dynamical systems and chaotic maps, and lies at the roots of the thermodynamic formalism of dynamical systems. Here we show that this technique can also be successfully applied to time series generated by complex systems of much higher dimensionality. Our main example is the investigation of share price returns in a coarse-grained way. A nontrivial spectrum of Renyi entropies is found. We study how the spectrum depends on the time scale of returns, the sector of stocks considered, as well as the number of symbols used for the symbolic description. Overall our analysis confirms that in the symbol space transition probabilities of observed share price returns depend on the entire history of previous symbols, thus emphasizing the need for a modelling based on non-Markovian stochastic processes. Our method allows for quantitative comparisons of entirely different complex systems, for example the statistics of symbol sequences generated by share price returns using 4 symbols can be compared with that of genomic sequences.
قيم البحث
اقرأ أيضاً
We statistically investigate the distribution of share price and the distributions of three common financial indicators using data from approximately 8,000 companies publicly listed worldwide for the period 2004-2013. We find that the distribution of
share price follows Zipfs law; that is, it can be approximated by a power law distribution with exponent equal to 1. An examination of the distributions of dividends per share, cash flow per share, and book value per share - three financial indicators that can be assumed to influence corporate value (i.e. share price) - shows that these distributions can also be approximated by a power law distribution with power-law exponent equal to 1. We estimate a panel regression model in which share price is the dependent variable and the three financial indicators are explanatory variables. The two-way fixed effects model that was selected as the best model has quite high power for explaining the actual data. From these results, we can surmise that the reason why share price follows Zipfs law is that corporate value, i.e. company fundamentals, follows Zipfs law.
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to often inherit in its topology non-trivial properties of the series stru
cture, and can thus be seen as a combinatorial representation of a dynamical system. Here we explore in some detail the relation between visibility graphs and symbolic dynamics. To do that, we consider the degree sequence of horizontal visibility graphs generated by the one-parameter logistic map, for a range of values of the parameter for which the map shows chaotic behaviour. Numerically, we observe that in the chaotic region the block entropies of these sequences systematically converge to the Lyapunov exponent of the system. Via Pesin identity, this in turn suggests that these block entropies are converging to the Kolmogorov- Sinai entropy of the map, which ultimately suggests that the algorithm is implicitly and adaptively constructing phase space partitions which might have the generating property. To give analytical insight, we explore the relation k(x), x in[0,1] that, for a given datum with value x, assigns in graph space a node with degree k. In the case of the out-degree sequence, such relation is indeed a piece-wise constant function. By making use of explicit methods and tools from symbolic dynamics we are able to analytically show that the algorithm indeed performs an effective partition of the phase space and that such partition is naturally expressed as a countable union of subintervals, where the endpoints of each subinterval are related to the fixed point structure of the iterates of the map and the subinterval enumeration is associated with particular ordering structures that we called motifs.
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as i.i.d. random
variables. The dependence was found by analysis of empirical histograms for the stochastic process of a single share price on a market within the high frequency time scale, and justified theoretically by considering bid-ask bounce mechanism containing some delay characteristic for any double-auction market. Our model turns out to be exactly analytically solvable, which enables a direct comparison of its predictions with their empirical counterparts, for instance, with empirical velocity autocorrelation function. Thus this paper significantly extends the capabilities of the CTRW formalism.
This survey describes the recent advances in the construction of Markov partitions for nonuniformly hyperbolic systems. One important feature of this development comes from a finer theory of nonuniformly hyperbolic systems, which we also describe. Th
e Markov partition defines a symbolic extension that is finite-to-one and onto a non-uniformly hyperbolic locus, and this provides dynamical and statistical consequences such as estimates on the number of closed orbits and properties of equilibrium measures. The class of systems includes diffeomorphisms, flows, and maps with singularities.
In this paper we apply the techniques of symbolic dynamics to the analysis of a labor market which shows large volatility in employment flows. In a recent paper, Bhattacharya and Bunzel cite{BB} have found that the discrete time version of the Pissar
ides-Mortensen matching model can easily lead to chaotic dynamics under standard sets of parameter values. To conclude about the existence of chaotic dynamics in the numerical examples presented in the paper, the Li-Yorke theorem or the Mitra sufficient condition were applied which seems questionable because they may lead to misleading conclusions. Moreover, in a more recent version of the paper, Bhattacharya and Bunzel cite{BB1} present new results in which chaos is completely removed from the dynamics of the model. Our paper explores the matching model so interestingly developed by the authors with the following objectives in mind: (i) to show that chaotic dynamics may still be present in the model for standard parameter values; (ii) to clarify some open questions raised by the authors in cite{BB}, by providing a rigorous proof of the existence of chaotic dynamics in the model through the computation of topological entropy in a symbolic dynamics setting.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
