Optimal growth trajectories with finite carrying capacity

An extension of the Kelly criterion maximises the growth rate of multiplicative stochastic processes when limited resources are available.

Physical Review E 94, 22315 (2016)

F. Caravelli, L. Sindoni, F. Caccioli, C. Ududec

Optimal growth trajectories with finite carrying capacity

We consider the problem of finding optimal strategies that maximize the average growth rate of multiplicative stochastic processes. For a geometric Brownian motion, the problem is solved through the so-called Kelly criterion, according to which the optimal growth rate is achieved by investing a constant given fraction of resources at any step of the dynamics. We generalize these finding to the case of dynamical equations with finite carrying capacity, which can find applications in biology, mathematical ecology, and finance. We formulate the problem in terms of a stochastic process with multiplicative noise and a nonlinear drift term that is determined by the specific functional form of carrying capacity. We solve the stochastic equation for two classes of carrying capacity functions (power laws and logarithmic), and in both cases we compute the optimal trajectories of the control parameter. We further test the validity of our analytical results using numerical simulations.

More in The fate of real systems

  • Scientific Reports

    Self-organising adaptive networks

    An adaptive network of oscillators in fragmented and incoherent states can re-organise itself into connected and synchronized states.

  • PLOS ONE

    Instability in complex ecosystems

    The community matrix of a complex ecosystem captures the population dynamics of interacting species and transitions to unstable abundances.

  • Philosophical Magazine

    Dynamics of Ising chains

    A transfer operator formalism solves the macroscopic dynamics of disordered Ising chain systems which are relevant for ageing phenomena.