All issues

We propose a three-component discrete-time model of the phytoplankton-zooplankton community, in which toxic and non-toxic species of phytoplankton compete for resources. The use of the Holling functional response of type II allows us to describe an interaction between zooplankton and phytoplankton. With the Ricker competition model, we describe the restriction of phytoplankton biomass growth by the availability of external resources (mineral nutrition, oxygen, light, etc.). Many phytoplankton species, including diatom algae, are known not to release toxins if they are not damaged. Zooplankton pressure on phytoplankton decreases in the presence of toxic substances. For example, Copepods are selective in their food choices and avoid consuming toxin-producing phytoplankton. Therefore, in our model, zooplankton (predator) consumes only non-toxic phytoplankton species being prey, and toxic species phytoplankton only competes with non-toxic for resources.

We study analytically and numerically the proposed model. Dynamic mode maps allow us to investigate stability domains of fixed points, bifurcations, and the evolution of the community. Stability loss of fixed points is shown to occur only through a cascade of period-doubling bifurcations. The Neimark – Sacker scenario leading to the appearance of quasiperiodic oscillations is found to realize as well. Changes in intrapopulation parameters of phytoplankton or zooplankton can lead to abrupt transitions from regular to quasi-periodic dynamics (according to the Neimark – Sacker scenario) and further to cycles with a short period or even stationary dynamics. In the multistability areas, an initial condition variation with the unchanged values of all model parameters can shift the current dynamic mode or/and community composition.

The proposed discrete-time model of community is quite simple and reveals dynamics of interacting species that coincide with features of experimental dynamics. In particular, the system shows behavior like in prey-predator models without evolution: the predator fluctuations lag behind those of prey by about a quarter of the period. Considering the phytoplankton genetic heterogeneity, in the simplest case of two genetically different forms: toxic and non-toxic ones, allows the model to demonstrate both long-period antiphase oscillations of predator and prey and cryptic cycles. During the cryptic cycle, the prey density remains almost constant with fluctuating predators, which corresponds to the influence of rapid evolution masking the trophic interaction.

Bistability is a fundamental property of nonlinear systems and is found in many applied and theoretical studies of biological systems (populations and communities). In the simplest case it is expressed in the coexistence of diametrically opposed alternative stable equilibrium states of the system, and which of them will be achieved depends on the initial conditions. Bistability in simple models can lead to quad-stability as models become more complex, for example, when adding genetic, age and spatial structure. This occurs in different models from completely different subject area and leads to very interesting, often counterintuitive conclusions. In this article, we review such situations. The paper deals with bifurcations leading to bi- and quad-stability in mathematical models of the following biological objects. The first one is the system of two populations coupled by migration and under the action of natural selection, in which all genetic diversity is associated with a single diallelic locus with a significant difference in fitness for homo- and heterozygotes. The second is the system of two limited populations described by the Bazykin model or the Ricker model and coupled by migration. The third is a population with two age stages and density-dependent regulation of birth rate which is determined either only by population density, or additionally depends on the genetic structure of adjacent generations. We found that all these models have similar scenarios for the birth of equilibrium states that correspond to the formation of spatiotemporal inhomogeneity or to the differentiation by phenotypes of individuals from different age stages. Such inhomogeneity is a consequence of local bistability and appears as a result of a combination of pitchfork bifurcation (period doubling) and saddle-node bifurcation.

We developed a model of honeybee colony foraging based on reaction – diffusion equations. Employed bees transmit information about their food sources using dance, and job seekers in the hive can choose any dance they like and thus join the exploitation of the corresponding source. We consider two strategies of dance selection: a targeted one, when bees analyze information on the dance floor and choose the most energetic and longest dance corresponding to the most profitable source, and a simple random choice of the first dance they encounter. Modelling showed that the greatest profit (food influx into the hive) is provided by the random choice of dance, as paradoxical as it may seem at first glance. Optimization of profit by each agent for itself (targeted choice of dances) is rather a disadvantage for the colony, and “non-optimality” in dance choice can be the result of useful evolutionary adaptation.

Theory of anomalous diffusion, which describe a vast number of transport processes with power law mean squared displacement, is actively advancing in recent years. Diffusion of liquids in porous media, carrier transport in amorphous semiconductors and molecular transport in viscous environments are widely known examples of anomalous deceleration of transport processes compared to the standard model.

Direct Monte Carlo simulation is a convenient tool for studying such processes. An efficient stochastic simulation algorithm is developed in the present paper. It is based on simple renewal process with interarrival times that have power law asymptotics. Analytical derivations show a deep connection between this class of random process and equations with fractional derivatives. The algorithm is further generalized by coupling it with chemical reaction simulation. It makes stochastic approach especially useful, because the exact form of integrodifferential evolution equations for reaction — subdiffusion systems is still a matter of debates.

Proposed algorithm relies on non-markovian random processes, hence one should carefully account for qualitatively new effects. The main question is how molecules leave the system during chemical reactions. An exact scheme which tracks all possible molecule combinations for every reaction channel is computationally infeasible because of the huge number of such combinations. It necessitates application of some simple heuristic procedures. Choosing one of these heuristics greatly affects obtained results, as illustrated by a series of numerical experiments.

In this paper, we develop a new first-order method for composite nonconvex minimization problems with simple constraints and inexact oracle. The objective function is given as a sum of «hard», possibly nonconvex part, and «simple» convex part. Informally speaking, oracle inexactness means that, for the «hard» part, at any point we can approximately calculate the value of the function and construct a quadratic function, which approximately bounds this function from above. We give several examples of such inexactness: smooth nonconvex functions with inexact H¨older-continuous gradient, functions given by the auxiliary uniformly concave maximization problem, which can be solved only approximately. For the introduced class of problems, we propose a gradient-type method, which allows one to use a different proximal setup to adapt to the geometry of the feasible set, adaptively chooses controlled oracle error, allows for inexact proximal mapping. We provide a convergence rate for our method in terms of the norm of generalized gradient mapping and show that, in the case of an inexact Hölder-continuous gradient, our method is universal with respect to Hölder parameters of the problem. Finally, in a particular case, we show that the small value of the norm of generalized gradient mapping at a point means that a necessary condition of local minimum approximately holds at that point.

Financial mathematics is one of the most natural applications for the statistical analysis of time series. Financial time series reflect simultaneous activity of a large number of different economic agents. Consequently, one expects that methods of statistical physics and the theory of random processes can be applied to them.

In this paper, we provide a statistical analysis of time series of the FOREX currency market. Of particular interest is the comparison of the time series behavior depending on the way time is measured: physical time versus trading time measured in the number of elementary price changes (ticks). The experimentally observed statistics of the time series under consideration (euro–dollar for the first half of 2007 and for 2009 and British pound – dollar for 2007) radically differs depending on the choice of the method of time measurement. When measuring time in ticks, the distribution of price increments can be well described by the normal distribution already on a scale of the order of ten ticks. At the same time, when price increments are measured in real physical time, the distribution of increments continues to differ radically from the normal up to scales of the order of minutes and even hours.

To explain this phenomenon, we investigate the statistical properties of elementary increments in price and time. In particular, we show that the distribution of time between ticks for all three time series has a long (1-2 orders of magnitude) power-law tails with exponential cutoff at large times. We obtained approximate expressions for the distributions of waiting times for all three cases. Other statistical characteristics of the time series (the distribution of elementary price changes, pair correlation functions for price increments and for waiting times) demonstrate fairly simple behavior. Thus, it is the anomalously wide distribution of the waiting times that plays the most important role in the deviation of the distribution of increments from the normal. As a result, we discuss the possibility of applying a continuous time random walk (CTRW) model to describe the FOREX time series.

The work continues research on the ability of a person to improve the productivity of information processing, using parallel work or improving the performance of analyzers. A person receives a series of tasks, the solution of which requires the processing of a certain amount of information. The time and the validity of the decision are recorded. The dependence of the average solution time on the amount of information in the problem is determined by correctly solved problems. In accordance with the proposed method, the problems contain calculations of expressions in two algebras, one of which is associative and the other is nonassociative. To facilitate the work of the subjects in the experiment were used figurative graphic images of elements of algebra. Non-associative calculations were implemented in the form of the game “rock-paper-scissors”. It was necessary to determine the winning symbol in the long line of these figures, considering that they appear sequentially from left to right and play with the previous winner symbol. Associative calculations were based on the recognition of drawings from a finite set of simple images. It was necessary to determine which figure from this set in the line is not enough, or to state that all the pictures are present. In each problem there was no more than one picture. Computation in associative algebra allows the parallel counting, and in the absence of associativity only sequential computations are possible. Therefore, the analysis of the time for solving a series of problems reveals a consistent uniform, sequential accelerated and parallel computing strategy. In the experiments it was found that all subjects used a uniform sequential strategy to solve non-associative problems. For the associative task, all subjects used parallel computing, and some have used parallel computing acceleration of the growth of complexity of the task. A small part of the subjects with a high complexity, judging by the evolution of the solution time, supplemented the parallel account with a sequential stage of calculations (possibly to control the solution). We develop a special method for assessing the rate of processing of input information by a person. It allowed us to estimate the level of parallelism of the calculation in the associative task. Parallelism of level from two to three was registered. The characteristic speed of information processing in the sequential case (about one and a half characters per second) is twice less than the typical speed of human image recognition. Apparently the difference in processing time actually spent on the calculation process. For an associative problem in the case of a minimum amount of information, the solution time is near to the non-associativity case or less than twice. This is probably due to the fact that for a small number of characters recognition almost exhausts the calculations for the used non-associative problem.

In this paper, we consider two variants of the concept of sharp minimum for mathematical programming problems with quasiconvex objective function and inequality constraints. It investigated the problem of describing a variant of a simple subgradient method with switching along productive and non-productive steps, for which, on a class of problems with Lipschitz functions, it would be possible to guarantee convergence with the rate of geometric progression to the set of exact solutions or its vicinity. It is important that to implement the proposed method there is no need to know the sharp minimum parameter, which is usually difficult to estimate in practice. To overcome this problem, the authors propose to use a step adjustment procedure similar to that previously proposed by B. T. Polyak. However, in this case, in comparison with the class of problems without constraints, it arises the problem of knowing the exact minimal value of the objective function. The paper describes the conditions for the inexactness of this information, which make it possible to preserve convergence with the rate of geometric progression in the vicinity of the set of minimum points of the problem. Two analogs of the concept of a sharp minimum for problems with inequality constraints are considered. In the first one, the problem of approximation to the exact solution arises only to a pre-selected level of accuracy, for this, it is considered the case when the minimal value of the objective function is unknown; instead, it is given some approximation of this value. We describe conditions on the inexact minimal value of the objective function, under which convergence to the vicinity of the desired set of points with a rate of geometric progression is still preserved. The second considered variant of the sharp minimum does not depend on the desired accuracy of the problem. For this, we propose a slightly different way of checking whether the step is productive, which allows us to guarantee the convergence of the method to the exact solution with the rate of geometric progression in the case of exact information. Convergence estimates are proved under conditions of weak convexity of the constraints and some restrictions on the choice of the initial point, and a corollary is formulated for the convex case when the need for an additional assumption on the choice of the initial point disappears. For both approaches, it has been proven that the distance from the current point to the set of solutions decreases with increasing number of iterations. This, in particular, makes it possible to limit the requirements for the properties of the used functions (Lipschitz-continuous, sharp minimum) only for a bounded set. Some computational experiments are performed, including for the truss topology design problem.

In this paper we study the rotational oscillations of the nitrous bases forming a central pair in a short DNA fragment consisting of three base pairs. A simple mechanical analog of the fragment where the bases are imitated by pendulums and the interactions between pendulums — by springs, has been constructed. We derived Lagrangian of the model system and the nonlinear equations of motions. We found solutions in the homogeneous case when the fragment considered consists of identical base pairs: Adenine-Thymine (AT- pair) or Guanine-Cytosine (GC-pair). The trajectories of the model system in the configuration space were also constructed.

In the paper we construct the model of phase change. Process of hydriding / dehydriding is taken as an example. A single powder particle is considered under the assumption about its symmetry. A ball, a cylinder, and a flat plate are examples of such symmetrical shapes. The model desribes both the "shrinking core"(when the skin of the new phase appears on the surface of the particle) and the "nucleation and growth"(when the skin does not appear till complete vanishing of the old phase) scenarios. The model is the non-classical boundary-value problem with the free boundary and nonlinear Neumann boundary condition. The symmetry assumptions allow to reduce the problem to the single spatial variable. The model was tested on the series of experimental data. We show that the particle shape’s influence on the kinetics is insignificant. We also show that a set of particles of different shapes with size distribution can be approxomated by the single particle of the "average" size and of a simple shape; this justifies using single particle approximation and simple shapes in mathematical models.