SearcharxivSearch

arXiv subjects

Fima Klebaner

Publications and source records attributed to Fima Klebaner.

7 recordsLinked to original sources

Dynamic portfolio optimization with liquidity cost and market impact: a simulation-and-regression approach

We present a simulation-and-regression method for solving dynamic portfolio allocation problems in the presence of general transaction costs, liquidity costs and market impacts. This method extends the classical least squares Monte Carlo algorithm to incorporate switching costs, corresponding to transaction costs and transient liquidity costs, as well as multiple endogenous state variables, namely the portfolio value and the asset prices subject to permanent market impacts. To do so, we improve the accuracy of the control randomization approach in the case of discrete controls, and propose a global iteration procedure to further improve the allocation estimates. We validate our numerical method by solving a realistic cash-and-stock portfolio with a power-law liquidity model. We quantify the certainty equivalent losses associated with ignoring liquidity effects, and illustrate how our dynamic allocation protects the investor's capital under illiquid market conditions. Lastly, we analyze, under different liquidity conditions, the sensitivities of certainty equivalent returns and optimal allocations with respect to trading volume, stock price volatility, initial investment amount, risk-aversion level and investment horizon.

q-fin.PM

Skewed target range strategy for multiperiod portfolio optimization using a two-stage least squares Monte Carlo method

In this paper, we propose a novel investment strategy for portfolio optimization problems. The proposed strategy maximizes the expected portfolio value bounded within a targeted range, composed of a conservative lower target representing a need for capital protection and a desired upper target representing an investment goal. This strategy favorably shapes the entire probability distribution of returns, as it simultaneously seeks a desired expected return, cuts off downside risk and implicitly caps volatility and higher moments. To illustrate the effectiveness of this investment strategy, we study a multiperiod portfolio optimization problem with transaction costs and develop a two-stage regression approach that improves the classical least squares Monte Carlo (LSMC) algorithm when dealing with difficult payoffs, such as highly concave, abruptly changing or discontinuous functions. Our numerical results show substantial improvements over the classical LSMC algorithm for both the constant relative risk-aversion (CRRA) utility approach and the proposed skewed target range strategy (STRS). Our numerical results illustrate the ability of the STRS to contain the portfolio value within the targeted range. When compared with the CRRA utility approach, the STRS achieves a similar mean-variance efficient frontier while delivering a better downside risk-return trade-off.

q-fin.PM

Local Control Regression: Improving the Least Squares Monte Carlo Method for Portfolio Optimization

The least squares Monte Carlo algorithm has become popular for solving portfolio optimization problems. A simple approach is to approximate the value functions on a discrete grid of portfolio weights, then use control regression to generalize the discrete estimates. However, the classical global control regression can be expensive and inaccurate. To overcome this difficulty, we introduce a local control regression technique, combined with adaptive grids. We show that choosing a coarse grid for local regression can produce sufficiently accurate results.

q-fin.PM

What can be observed in real time PCR and when does it show?

Real time, or quantitative, PCR typically starts from a very low concentration of initial DNA strands. During iterations the numbers increase, first essentially by doubling, later predominantly in a linear way. Observation of the number of DNA molecules in the experiment becomes possible only when it is substantially larger than initial numbers, and then possibly affected by the randomness in individual replication. Can the initial copy number still be determined? This is a classical problem and, indeed, a concrete special case of the general problem of determining the number of ancestors, mutants or invaders, of a population observed only later. We approach it through a generalised version of the branching process model introduced by Jagers and Klebaner, 2003 and based on Michaelis-Menten type enzyme kinetical considerations from Schnell and Mendoza, 1997. A crucial role is played by the Michaelis-Menten constant being large, as compared to initial copy numbers. In a strange way, determination of the initial number turns out to be completely possible if the initial rate $v$ is one, i.e all DNA strands replicate, but only partly so when $v<1$, and thus the initial rate or probability of successful replication is lower than one. Then, the starting molecule number becomes hidden behind a "veil of uncertainty". This is a special case, of a hitherto unobserved general phenomenon in population growth processes, which will be addressed elsewhere.

math.PR

Mimicking self-similar processes

We construct a family of self-similar Markov martingales with given marginal distributions. This construction uses the self-similarity and Markov property of a reference process to produce a family of Markov processes that possess the same marginal distributions as the original process. The resulting processes are also self-similar with the same exponent as the original process. They can be chosen to be martingales under certain conditions. In this paper, we present two approaches to this construction, the transition-randomising approach and the time-change approach. We then compute the infinitesimal generators and obtain some path properties of the resulting processes. We also give some examples, including continuous Gaussian martingales as a generalization of Brownian motion, martingales of the squared Bessel process, stable Lévy processes as well as an example of an artificial process having the marginals of $t^κV$ for some symmetric random variable $V$. At the end, we see how we can mimic certain Brownian martingales which are non-Markovian.

math.ST

Escape from the boundary in Markov population processes

Density dependent Markov population processes in large populations of size $N$ were shown by Kurtz (1970, 1971) to be well approximated over finite time intervals by the solution of the differential equations that describe their average drift, and to exhibit stochastic fluctuations about this deterministic solution on the scale $\sqrt N$ that can be approximated by a diffusion process. Here, motivated by an example from evolutionary biology, we are concerned with describing how such a process leaves an absorbing boundary. Initially, one or more of the populations is of size much smaller than $N$, and the length of time taken until all populations have sizes comparable to $N$ then becomes infinite as $N \to \infty$. Under suitable assumptions, we show that in the early stages of development, up to the time when all populations have sizes at least $N^{1-α}$, for $1/3 < α< 1$, the process can be accurately approximated in total variation by a Markov branching process. Thereafter, the process is well approximated by the deterministic solution starting from the original initial point, but with a random time delay. Analogous behaviour is also established for a Markov process approaching an equilibrium on a boundary, where one or more of the populations become extinct.

math.PR

Volatility in options formulae for general stochastic dynamics

It is well-known that the Black-Scholes formula has been derived under the assumption of constant volatility in stocks. In spite of evidence that this parameter is not constant, this formula is widely used by financial markets. This paper addresses the question of whether an alternative model for stock price exists for which the Black-Scholes or similar formulae hold. The results obtained in this paper are very general as no assumptions are made on the dynamics of the model, whether it be the underlying price process, the volatility process or how they relate to each other. We show that if the formula holds for a continuum of strikes and three terminal times, then the volatility must be constant. However, when it only holds for finitely many strikes, and three or more maturity times, we obtain a universal bound on the variation of the volatility. This bound yields that the implied volatility is constant when the sequence of strikes increases to cover the entire half-line. This recovers the result for a continuum of strikes by a different approach.

q-fin.PR