Numerical Methods in Computational Finance. Daniel J. Duffy

Чтение книги онлайн.

Читать онлайн книгу Numerical Methods in Computational Finance - Daniel J. Duffy страница 37

Numerical Methods in Computational Finance - Daniel J. Duffy

Скачать книгу

r left-parenthesis t right-parenthesis = number of rabbits at time t
f left-parenthesis t right-parenthesis = number of foxes at time t
italic b r left-parenthesis t right-parenthesis = birth rate of rabbits
minus italic a r left-parenthesis t right-parenthesis f left-parenthesis t right-parenthesis = death rate of rabbits
b = unit birth rate of rabbits
minus italic p f left-parenthesis t right-parenthesis = death rate of foxes
q f left-parenthesis t right-parenthesis r left-parenthesis t right-parenthesis = birth rate of foxes
q = unit birth rate of foxes.

      System (3.14) is sometimes called the Lotka–Volterra equations, which are an example of a more general Kolmogorov model to model the dynamics of ecological systems with predator-prey interactions, competition, disease and mutualism (Lotka (1956)).

      3.3.4 Logistic Function

      (3.15)f left-parenthesis x right-parenthesis equals StartFraction upper L Over 1 plus e Superscript minus k left-parenthesis x minus x 0 right-parenthesis Baseline EndFraction comma

      where

x 0 equals x-value of sigmoid's midpoint
upper L equals curve's maximum value
k equals steepness of the curve.

      A special case is when k equals 1 comma x 0 equals 0 comma upper L equals 1, resulting in the standard logistic function defined by the equation:

f left-parenthesis x right-parenthesis equals StartFraction 1 Over 1 plus e Superscript negative x Baseline EndFraction period

      We can verify from this equation that the logistic function satisfies the non-linear initial value problem:

      (3.16)StartLayout 1st Row 1st Column StartFraction italic d f Over italic d x EndFraction equals f left-parenthesis 1 minus f right-parenthesis comma 2nd Column f left-parenthesis 0 right-parenthesis equals one half period EndLayout

      The logistic function models processes in a range of fields such as artificial neural networks (learning algorithms, where it is called an activation function), economics, probability and statistics, to name a few.

      A random process is a family of random variables defined on some probability space and indexed by the parameter t where t belongs to some index set. A random process is a function of two variables:

StartSet xi left-parenthesis t comma x right-parenthesis colon t element-of upper T comma x element-of upper S EndSet

      where T is the index set and S is the sample space. For a fixed value of t, the random process becomes a random variable, while for a fixed sample point x in S the random process is a real-valued function of t called a sample function or a realisation of the process. It is also sometimes called a path.

      The index set T is called the parameter set, and the values assumed by xi left-parenthesis t comma omega right-parenthesis are called the states; finally, the set of all possible values is called the state space of the random process.

      The index set T can be discrete or continuous; if T is discrete, then the process is called a discrete-parameter or discrete-time process (also known as a random sequence). If T is continuous, then we say that the random process is called continuous-parameter or continuous-time. We can also consider the situation where the state is discrete or continuous. We then say that the random process is called discrete-state (chain) or continuous-state, respectively.

      3.4.1 Stochastic Differential Equations (SDEs)

      We introduce the scalar random processes described by SDEs of the form:

Скачать книгу