<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Mathematical Models of Pseudorandom Processes Behavior for Nonlinear Dynamical Systems</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">George</forename><surname>Vostrov</surname></persName>
							<email>vostrov@gmail.com</email>
						</author>
						<author>
							<persName><forename type="first">Andrii</forename><surname>Khrinenko</surname></persName>
							<email>khrinenko@stud.opu.ua</email>
						</author>
						<author>
							<affiliation key="aff0">
								<orgName type="institution" key="instit1">Odessa</orgName>
								<orgName type="institution" key="instit2">National Polytechnic University</orgName>
								<address>
									<addrLine>Shevchenko av., 1</addrLine>
									<postCode>65044</postCode>
									<settlement>Odessa</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="department">IT&amp;I-2020 Information Technology and Interactions</orgName>
								<orgName type="institution">KNU Taras Shevchenko</orgName>
								<address>
									<addrLine>December 02-03</addrLine>
									<postCode>2020</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Mathematical Models of Pseudorandom Processes Behavior for Nonlinear Dynamical Systems</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">858E08CB8ED96A923F01CC09614AACE1</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T09:05+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Chaos</term>
					<term>randomness</term>
					<term>nonlinear maps</term>
					<term>financial analysis</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This paper considers the processes in maps, which are examples of nonlinear dynamical systems. Analysing dynamical systems, it is necessary to take into account and analyze properties of iterative functions that determine the length of nonrepetitive iterative process. It is shown that not only properties of functions, but also properties of numbers from the considered functions domain influence the nonlinear maps behavior. Also this work consider nonlinear maps as a background in the analysis of financial data and complex dynamical systems, such as stock exchange and economics.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Modeling of random and pseudorandom processes in nonlinear dynamical systems based on randomized algorithms of cyclic trajectories of fixed points requires formation of information technologies that would include a wide range of mathematical methods for predicting occurrences of such trajectories and pattern recognition for their behavior that depends on previous states. It is necessary to take into account the random nature of the depth of transition from one state or sequence of states to another state. An effective solution to this problem is provided that there are semantic databases that allow to take into account the experience of preliminary analysis of nonlinear dynamic systems behavior under different conditions. Estimation methods are required to define true randomness or pseudorandomness if so-called chaotic behavior observed during number sequence generations. Algorithms for analyzing such behavior increase the range of approaches that can be used to effectively solve various problems in areas such as modeling of dynamical systems, functional analysis, function theory, cryptography and others. The obtained sequences are widely used in the Monte-Carlo method where sequences of pseudorandom points are used to calculate multidimensional integrals <ref type="bibr" target="#b0">[1]</ref>, in the theory of machine learning to obtain training and test sequences <ref type="bibr" target="#b1">[2]</ref> and others. Various methods of number sequence generation are based on chaotic processes and the next question arises: "What processes can be considered as chaotic?" There is no precise and constructive axiomatic definition of the concept of randomness at this moment. In Kolmogorov axioms, random sequences were left outside the theory and only general approaches to the definition of randomness were proposed, such as von Mises's approach. In this case, even if a method of sequence generation is used, there is a problem of uncertainty of the degree of approximation to the real randomness, because a truly random sequence is infinite and cannot be generated for real-world problems. Numerical sequence generators provide pseudorandomness with a certain degree of approximation to a given distribution law. Thus, the construction of random number generators is a way to define the formal concept of randomness, which is important and necessary in modern probability theory, stochastic process theory and others. Since a truly random sequence is a mathematical model that is a completely unpredictable and therefore non-periodic infinite sequence, the problem of generating a pseudorandom sequence (PRS) is formulated <ref type="bibr" target="#b2">[3]</ref>. Separate branch of science, which is called deterministic dynamical systems also refers to the problem of chaos. The basis of this branch is the analysis of the dynamics of iterative fixed points using recursive functions. In this case, iterative cycles or orbits are considered as deterministic chaos <ref type="bibr" target="#b6">[7]</ref>, because they depend on the initial conditions, and also show irregularity <ref type="bibr" target="#b3">[4]</ref>. Deterministic dynamical systems arise as a result of approximation of complex processes from the physical and mental world and can be used as generators of pseudorandom sequences. Another advantage of dynamical systems is that the required level of approximation to randomness can be achieved by a combination of several algebraic equations. In the case of PRS generators and dynamical systems, it is necessary to take into account and analyze properties of iterative functions that determine the length of nonrepetitive iterative process, which is one of the main properties of generators. In this case, the properties of the set of numbers on which these iterative functions are defined draw much less attention. There is a direct connection with number theory and above-stated problem. Prime numbers are of considerable interest because factorization can not be applied to them while usage of large compound numbers does not provide required cycle length. In many practical problems, the initial value is determined by random selection of a prime number of large dimension, but some prime numbers also do not allow obtaining of desired cycle length and approaching truly random sequence. The numbers of this class include of Fermat, Mersenne, Wagstaff numbers and their generalizations <ref type="bibr" target="#b0">[1]</ref>. In this case, neighboring prime numbers provide a cycle length corresponding to the dimensionality of the number and meet the requirements to the resulting sequence. Thus, insufficient analysis of the selected numbers can lead to significant errors in the obtained sequences and incorrect conclusions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Analysis of iteration processes in nonlinear maps</head><p>To analyze above-formulated problem, this paper considers the processes in maps, which are examples of nonlinear dynamical systems. By process it is meant a function F, that present the final sequences (words) in words such that if for the word x ) (x F is defined and , x y  then ) ( y F also defined and F(x) F(y) . Let  -some sequence. The process F will be reapplied as long as possible. As a result, it will be obtained fragments of some new sequence P -the result of application</p><formula xml:id="formula_0">F to  , ie ). (  F P</formula><p>Nonlinear maps of the following classes are considered: "Tent", "Asymmetric tent", "Sawtooth" and multiplicative order map. It is important to note that maps (1,2,3) are continuous functions, while maps (4) are defined only on the set of integers. The choice of these maps allows us to consider and analyze the chaotic processes that are also observed in complex dynamical systems.</p><formula xml:id="formula_1">           4 1 x x 2 1 4 1 x x 2 x x t n n n n 1 n n 1 , , ) (<label>(1)</label></formula><formula xml:id="formula_2">           2 1 x x 1 2 1 x x 2 x x t n n n n 1 n n 2 , , ) ( (2)            2 1 x 1 x 2 2 1 x x 2 x x t n n n n 1 n n 3 , , ) (<label>(3)</label></formula><p>It should be noted that computer systems in calculations operate with numbers in binary form and of limited length, while mathematics operates with numbers of infinite length and these circumstances lead to errors during operations with fractional numbers, which ultimately creates a problem of reliability and gives false conclusions about the processes in dynamic systems due to the fact that one of the properties of any dynamic system is the sensitivity to initial conditions <ref type="bibr" target="#b3">[4]</ref>. In order to minimize this circumstance, the transition to integer maps is performed, which are presented as follows:</p><formula xml:id="formula_3">        p x 4 x 2 p p x 4 x 2 x n n n n 1 n , ,<label>(1)</label></formula><formula xml:id="formula_4">        p x 2 x p p x 2 x 2 x n n n n 1 n , ,<label>(2)</label></formula><formula xml:id="formula_5">        p x 2 p x 2 p x 2 x 2 x n n n n 1 n , ,<label>(3)</label></formula><p>), (mod</p><formula xml:id="formula_6">p x 4 x n 1 n   (4)</formula><p>where pprime number. The graphs representing maps <ref type="bibr" target="#b0">(1,</ref><ref type="bibr" target="#b1">2,</ref><ref type="bibr" target="#b2">3)</ref> in the interval [0,1] are shown in Figures <ref type="figure" target="#fig_2">1, 2, 3</ref>, respectively, and the graph 4 gives the definition of the map (4) on the set of integers. In the presented figures, the graphs of the maps intersect the diagonal x y  at some points, which are fixed periodic points. It should also be noted that the map ( <ref type="formula" target="#formula_1">1</ref>) is algebraically congruent to the map (4) on the set of integers, i.e. the cycle lengths for all prime numbers coincide. And map (2) does not satisfy in the general case to Fermat's little theorem.</p><p>Despite the simplicity of the above maps, their iterative cycles have properties that confirm the above statements. According to them, the structure of iterative cycles is determined not only by the properties of the maps themselves, but also by the properties of the numbers on which these maps are based and which have a significant impact on the structure and can significantly change it. The presented nonlinear maps allow to divide the set of primes p into a system of classes based on the length of the iterative process for given prime numbers <ref type="bibr" target="#b4">[5]</ref>. Since such an internal structure is an exception, the question of introducing a certain degree of similarity of internal structures arises. For example, for the prime number 649657, Figures <ref type="figure">5 and 6</ref> show the internal structure of iterative processes for maps, where the dotted line shows the resulting sequences and the solid line shows the internal parts within the sequences that give the maximum value of the correlation coefficient.</p><p>It is worth noting that the choice of a prime number of large dimension does not allow to avoid sequences with a simple internal structure and internal exponential and periodic components, which are indicated by the green region on the Figure <ref type="figure">7</ref>. At the same time, the previous and next prime numbers generate sequences for which the length of the period corresponds to the dimension of the number and may indicate a better approximation to the conditions for pseudorandom sequences, but also have periodic components observed in places of compaction on the Figure <ref type="figure">7</ref>.    for which the number</p><formula xml:id="formula_7">) ) )(( (( 1 i 1 1 i) 1 p p    </formula><p>and p are also prime numbers. It is possible to identify sequences that have a simple structure with exponential components that are repeated with a certain frequency and slightly different in amplitude. These numbers completely violate the conditions of randomness, which are essential for PRS. It is proved that such an internal regular structure is characteristic to Mersenne, Wagstaff numbers and their various generalizations. Thus, Figure <ref type="figure">8</ref> shows the structure of PRS for the generalized Gaussian Mersenne number.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Synergetic behavior of nonlinear dynamical systems of stock exchanges a. Wave fluctuations in nonlinear processes of stock exchanges</head><p>The processes of investing financial resources in the world economy for the purposes of specific countries or their regions are multidimensional random processes</p><formula xml:id="formula_8">)) ( , ), ( ( ) ( t t t n 1     </formula><p>that are a dynamical system. Each component</p><formula xml:id="formula_9">) (t i  in ) (t  is a multidimensional random process ) ), ( , ), ( ( ) (   t t g t im 1 i i i    </formula><p>of different dimensions. In all cases of examination of a certain random process of formation of security quotations it is not possible to build a mathematical stochastic model of a random vector ) (t  and its individual components. In real life, stock market processes are registered using modern computer information technologies, which allow to calculate various parameters, such as prices of stocks, options and other securities at the opening and closing of the stock exchange and the number of their sales.  ), ( , ), (</p><formula xml:id="formula_10">n 1 t X t X</formula><p>for each company is essentially a statistical model of a random process ) (t  . The main mathematical tools for studying self-organized nonlinear dynamic processes of stock markets are the analysis, processing and forecasting of dynamic processes for all market participants on the basis of time series. Next, it needs to explore some mathematical features of each onedimensional time series. It is proved that the dynamics of price fluctuations is cyclical <ref type="bibr" target="#b0">[1]</ref>. The study of the structure of cycles of price fluctuations is an important and very complex problem of statistical analysis of time series <ref type="bibr" target="#b2">[3]</ref>.</p><p>It is established that the one-dimensional time series of share quotations and options on the stock markets X(t) is a mixture of at least three random processes. The term "mixture" emphasizes that the components of the mixture are not independent random variables at all, but the relationship between them is nonlinear, and they can be uncorrelated in individual time intervals, where nonlinear dependence has a significant meaning of behavior with a particular strategy. The three underlined components X(t) are related to three random processes with different evolutional mechanisms. Computer analysis of time series of stock prices allows to establish that the dynamics of time series is largely determined by the following factors:</p><p>1) Economic fluctuations of chaotic deterministic nature are due to regular fixed points, which can asymptotically approach the general limit <ref type="bibr" target="#b5">[6]</ref>; 2) Fluctuations of X(t) are in the nature of random processes with increments due to the large number of market participants' interests, which are constantly changing when buying and selling securities <ref type="bibr" target="#b1">[2]</ref>;</p><p>3) The structure of wave fluctuations is due to the ongoing Elliott wave generation process in which fluctuation trend always consists of five growth fluctuations associated with price increases and three decreasing fluctuations due to opposite corrective actions. In the first case, at any time i t , the time series</p><formula xml:id="formula_11">) ( i t X</formula><p>have a form that corresponds to the logistic equation</p><formula xml:id="formula_12">)) ( )( ( ) ( n n 1 n t X 1 t aX t X   </formula><p>, which has the following graphical representation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 9. Graphical representation of Logistic map</head><p>This process describes the acquisition of stocks in the interval ) , ( 1 n n t t  , which leads to the exhaustion to some extent of this resource at the time k n t  (this may be the end of the trading day). As proposed in <ref type="bibr" target="#b5">[6]</ref> for the chaotic nature of logistic map it is proved that it connects with the map "Tent" which allows to consider in detail the dynamic nature of processes and to investigate the iterative process of fixed point formation <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b7">8]</ref>.</p><p>In the second case, based on the fact that the continuous flow of orders on the stock exchange contains unrelated orders, the model "Geometric Brownian motion" can be used to simplify the description of the buying and selling process. This approach to stock markets was first proposed by M. F. M.Osborne <ref type="bibr" target="#b4">[5]</ref>. This model, in contrast to the Brownian motion, is everywhere positive and has a log-normal law of price distribution. Figure <ref type="figure" target="#fig_0">10</ref> shows a representation of the Brownian motion trajectory for a particle on the 2D plane and a simulation of the geometric Brownian motion process. Processes of this kind lead to constant fluctuations during one trading day.</p><p>However, it follows by randomness that it is impossible to predict the rise or fall of any particular stock, but due to the law of large numbers it is possible to obtain information about the behavior of markets in the long run.</p><p>In the third case, it is possible to observe the basic law of nature <ref type="bibr" target="#b3">[4]</ref>, according to which the development of the price of any stock (option) consists of five fluctuations with increasing and decreasing its values, but close to a certain value and with the next three stages of price adjustment of the financial instrument. A graphical representation of the process is shown in Figure <ref type="figure" target="#fig_0">11</ref>: The number of development waves can be more than five, but the number of waves of correction is always smaller. The construction of the mathematical theory of Elliott waves is associated with the development of mathematical methods for modeling human decision-making processes in a sociodynamic environment. An analysis of the decision-making processes of people (brokers) in the stock markets confirms that the desire to sell a financial asset at a higher price always requires greater fluctuations in decisions than decisions related to adjusting prices at some acceptable level. The structure of Elliott waves agrees with the wave lengths of individual waves at the stage of development and at the stage of correction. It is established that the number of waves at the development stage always exceeds the number of waves at the correction stage. This is due to the fact that the adjustment phase is always associated with minimization of financial losses and maximization of the possible rate of return. Analysis of the observed Elliott waves confirms the view that these waves are the result of the collective intellectual activity of a large number of people with agreed strategies for success, and also confirms the Keynesian business cycle model <ref type="bibr" target="#b1">[2]</ref>. It has been proven that the use of Elliott waves, the theory of fixed iteration points and random walk processes create a basis for stabilization and improvement of the efficiency of stock markets as a regulator of financial assets investing in the developing world economy.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>b. Nonlinear dynamical processes in synergetic economics</head><p>Analysis of developed and emerging economies of the world suggests that they all function as synergetic systems. There is still no exact mathematical definition of the synergetic nature of such processes. The model of synergetic dynamics of interaction of various components of nonlinear maps describing processes of development and realization of innovative projects is considered.</p><p>The processes of innovative projects consist of two components. The first stage is the creation of a new technology for studying the management of economic systems and the introduction of an innovative development process based on investment in the business plan. This process is systematically repeated in high-tech companies:</p><p>1) new development process; 2) investment in a business plan;</p><p>3) implementation of development in the markets And again, this sequence of stages of innovation is repeated at a new level. The stability of these processes must be accurately explained from a mathematical point of view. Research papers <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b8">9,</ref><ref type="bibr" target="#b9">10]</ref> contain the results of research aimed at explaining the synergistic nature of economic development associated with the development of high technology (Microsoft, Google, IBM, Tesla, etc.). The considerations presented in these works do not always give a full justification of their synergetic nature.</p><p>The authors of <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12]</ref> first drew attention to the Levy factor, when investment in a project is sharply reduced, and very quickly allocated to the implementation of a new investment (promising) project in the same field and the same companies. This is especially evident in projects related to electric vehicles, solar power plants, system software, smartphones, information technology and more.</p><p>Analysis of nonlinear dynamic processes in such areas allows us to formulate and prove that such synergetic processes in these companies and the economy as a whole always contain several nonlinear components of such processes, close to the logistic model of resource consumption, with moments of restructuring in the form of Levy flight <ref type="bibr" target="#b11">[12 ]</ref>, ie periodic changes in investment strategy. Levy's flight is one of the forms of random wandering, the graphic image of which is shown in Figure <ref type="figure" target="#fig_7">12</ref>. are the process of transferring funding from one project to a completely new one. The process ) (t S 2 is implemented when at some point the implemented innovation project receives corrective funding, which leads to a decrease in the level of innovation and its gradual decline. Maps ) (t S 3 and ) (t S 4 describes the single processes of investing financial resources and their depletion. A graphical representation of these processes is shown in Figure <ref type="figure" target="#fig_2">13</ref>.</p><p>Undoubtedly, the number of components of these types can be much larger. Analysis of the S function using its computer modeling and mathematical analysis with the right choice of weight functions always provides the necessary level of stability for these types of investment management processes in all areas of developed economies and much less in developing countries. A more complete mathematical analysis of this approach and the results of computer modeling will be the subject of a separate publication.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>c. Fourier analysis in finance: price formation and Fourier transform</head><p>A wide range of real systems demonstrates the properties of randomness, including finance and stock markets in particular. The question arises: "Does a system like the stock market develop by accident?". The hypothesis of random wandering as the basis of the market was formalized and popularized in <ref type="bibr" target="#b2">[3]</ref>. In order to test the correctness of this hypothesis, it is necessary to determine whether the results formed in the market are stochastic or deterministic.</p><p>To solve this problem, a statistical approach was used, using a set of NIST tests and other cryptographic tests for randomness. It has been shown that markets are not random because financial data do not satisfy the properties of randomness, such as chaos, frequency stability and unpredictability.</p><p>Accordingly, it is possible to build methods for forecasting financial data on historical changes in stock prices and a wide range of financial derivatives. Among the various mathematical tools that can be applied to finance, the Fourier transform is of particular interest because it makes it possible to identify patterns or loops in time series data and also provides a real-time pricing method for a financial instrument such as the option that was considered in the work of <ref type="bibr">Carr and Madan [19]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 14. Representation of investment processes</head><p>The very first option pricing model used a geometric Brownian process to model the basic pricing process. But due to some known shortcomings of this approach, it was proposed to move to the options of pricing models based on Levy processes.</p><p>Therefore, the Fourier transform technique is an effective approach to estimating the option according to the Levy model, because the Levy process t X can be fully described by its characteristic , then the FT is defined as:</p><formula xml:id="formula_13">     dy y f e u F iuy f ) ( ) (<label>(1)</label></formula><p>If we consider a sequence of numerical values } { k x as a result of a discrete Fourier transform (DFT) for another sequence } { j y and is defined as follows:</p><formula xml:id="formula_14">     1 N 0 k n jk 2 i k j e x y</formula><p>(2)</p><p>Here, the Fourier transform can be considered as a projection of the sequence } { k x on the vector space, because each product is a projection on a single basis vector. Next it is necessary to describe the Levy process.</p><p>An actual process is called a Levy process if it exhibits certain properties: independent increments, stationary increments, and almost certainly a continuous right map with a limit on the left. The Levy process can be represented as a combination of linear drift, Brownian process and jump process.</p><p>Turning to the application of PF for option pricing, we can describe an alternative formulation of option pricing, which uses an analytical expression of the characteristic function of the basic process of asset price using fast Fourier transform (FFT).</p><p>To obtain a quadratic-integral function, it was proposed to consider the Fourier transform of the </p><formula xml:id="formula_15">               u 1 a 2 i u a a i 1 a u e dk k c e u 2 2 T rT iuk T ) ( ) ) ( ( ) ( ) (<label>(3)</label></formula><p>The transaction price ) (k C can be restored by the inverse Fourier transform, where </p><formula xml:id="formula_16">               </formula><p>The above integral can be calculated using FFT. And it is important to note that a should be such that the denominator has only imaginary roots in u , because the integration is performed on the real value u . Next, it is necessary to describe the evaluation process for the integral (4). Let's start with choosing the number of intervals N and bandwidth u  . Therefore, the numerical approximation for ) (k C is given by the formula:  <ref type="formula" target="#formula_17">4</ref>) is approximated by a finite integral domain, where the upper limit for in numerical integration is represented as u N . Also, the Fourier variable u is selected at discrete points instead of a continuous representation. From one set of FFT calculations it is possible to get the price of the transaction (call) for the option for a set of strike prices.</p><formula xml:id="formula_18">       </formula><p>This gives market analysts the opportunity to record the price sensitivity of the transaction with different execution prices.</p><p>The transaction price is multiplied by the corresponding exponential attenuation coefficient, converted into a square-integral function, and the Fourier transform of the modified transaction price is converted into an analytical function of the characteristic function of the registration price (log price). However, the short maturity causes significant numerical errors, so the time component of the option should be considered to obtain smaller pricing errors for all execution price levels.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Conclusion</head><p>Summarizing the above information, it should be noted that Fourier transform methods provide an approach to pricing for financial instruments based on Levy processes, because the analytical representation of the characteristic function is more accessible and can be obtained using the previously described approach with high accuracy and efficiency. It is possible to get option prices for the full range of exercise prices in one set of FFT calculations. And this approach can be further developed for other derivatives on the Levy model, where the payout function depends on the volatility of the underlying process.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. 1st and 2nd iteration for the map 1</figDesc><graphic coords="3,141.80,577.11,311.33,173.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. 1st and 2nd iteration for the map 2</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 .</head><label>3</label><figDesc>Figure 3. -1st and 2nd iteration for the map 3</figDesc><graphic coords="4,130.40,72.00,334.15,177.90" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 .</head><label>4</label><figDesc>Figure 4. -1st and 2nd iteration for the map 4</figDesc><graphic coords="4,131.30,263.33,332.40,173.10" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 .Figure 6 .</head><label>56</label><figDesc>Figure 5. Sequence structure generated by prime number 649657</figDesc><graphic coords="5,156.80,405.30,281.40,328.05" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 7 .Figure 8 .</head><label>78</label><figDesc>Figure 7. Nonlinear dynamics by prime 160465519 for map 1</figDesc><graphic coords="7,73.50,72.00,453.75,137.25" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 10 .Figure 11 .</head><label>1011</label><figDesc>Figure 10. Brownian motion simulation</figDesc><graphic coords="9,86.90,72.00,421.07,135.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 12 .</head><label>12</label><figDesc>Figure 12. Representation of Levy Flight process</figDesc><graphic coords="10,80.90,375.57,433.09,128.35" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head></head><label></label><figDesc>defined as the Fourier transform of the density function t X . To describe the application of the Fourier transform (FT) in the option pricing model, it is important to establish a definition of the transformation. If we analyze the piecewise-smooth function )</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="1,0.00,191.09,594.96,459.74" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="6,152.00,72.00,290.98,317.70" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="6,156.20,402.35,282.58,320.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="8,136.40,261.44,322.19,213.85" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Prime numbers: cryptographic and computational aspects</title>
		<author>
			<persName><forename type="first">R</forename><surname>Crandall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Pomerance</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2005">2005</date>
			<publisher>Springer</publisher>
		</imprint>
	</monogr>
	<note>2nd ed</note>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">Conformal Prediction for Reliable Machine Learning: Theory, Adaptations and Applications</title>
		<author>
			<persName><forename type="first">V</forename><surname>Balasubramanian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vovk</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2014">2014</date>
			<publisher>Elsevier</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><surname>Shiryayev</surname></persName>
		</author>
		<title level="m">Probability and the concept of chance: to the 75th anniversary of the publication of the monograph by A. Kolmogorov &quot;Basic concepts of probability theory</title>
				<meeting><address><addrLine>Moscow, MIAN</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
	<note>Materialy seminara &quot;Matematika i yeye primeneniye. In Russian</note>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">Differential equations, dynamical systems, and an introduction to chaos</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hirsch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Smale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Devaney</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2013">2013</date>
			<publisher>Elsevier</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">Effective computability of dynamic system structure of prime number formation</title>
		<author>
			<persName><forename type="first">G</forename><surname>Vostrov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Opiata</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>ELTECS</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><surname>Sharkovsky</surname></persName>
		</author>
		<title level="m">Attraktory trayektoriy i ikh basseyny [Trajectory attractors and their pools</title>
				<meeting><address><addrLine>Kyiv</addrLine></address></meeting>
		<imprint>
			<publisher>Naukova Dumka</publisher>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
	<note>In Russian</note>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<title level="m" type="main">Determinirovannyy khaos: Vvedeniye [Deterministic chaos: Introduction</title>
		<author>
			<persName><forename type="first">G</forename><surname>Shuster</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1988">1988</date>
			<publisher>Mir</publisher>
		</imprint>
	</monogr>
	<note>In Russian</note>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Chetyre algoritmicheskikh litsa sluchaynosti [Four algorithmic faces of randomness</title>
		<author>
			<persName><forename type="first">V</forename><surname>Uspenskiy</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2006">2006</date>
			<pubPlace>Moscow, MTSNMO</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Synergetic Economics: Time and Change in Nonlinear Economics</title>
		<author>
			<persName><forename type="first">W</forename><surname>Zhang</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1991">1991</date>
			<publisher>Springer</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Econophysics: An Introduction, Printing house</title>
		<author>
			<persName><forename type="first">A</forename><surname>Panchenkov</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Povolzh&apos;ye</title>
				<imprint>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Hull</surname></persName>
		</author>
		<title level="m">Options, Futures and Other Derivatives</title>
				<imprint>
			<publisher>Prentice Hall</publisher>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Peters</surname></persName>
		</author>
		<title level="m">Fractal Market Analysis: Applying Chaos Theory to Investment and Economics</title>
				<imprint>
			<publisher>Wiley</publisher>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Osborne</surname></persName>
		</author>
		<title level="m">Motion in the Stock Market</title>
				<imprint>
			<publisher>Operations Research</publisher>
			<date type="published" when="1959">1959</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Computer modeling of the chaos formation processes in nonlinear dynamic maps</title>
		<author>
			<persName><forename type="first">G</forename><surname>Vostrov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Khrinenko</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>ELTECS</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Peters</surname></persName>
		</author>
		<title level="m">Chaos and Order in the Capital Markets: A New View of Cycles, Prices, and Market Volatility</title>
				<imprint>
			<publisher>Wiley</publisher>
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<author>
			<persName><forename type="first">H</forename><surname>Haken</surname></persName>
		</author>
		<title level="m">Synergetics: An Introduction</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<author>
			<persName><forename type="first">R</forename><surname>Mantegna</surname></persName>
		</author>
		<title level="m">Introduction to Econophysics: Correlations and Complexity in Finance</title>
				<imprint>
			<publisher>Cambridge University Press</publisher>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Option valuation using the fast Fourier transform</title>
		<author>
			<persName><forename type="first">P</forename><surname>Carr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">B</forename><surname>Madan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Computational Finance</title>
		<imprint>
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
