Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

20416181 · Jun 202019922001200920172026
48 results for Binomial Trees

The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…

2014-10-22abs ↗pdf ↗

We extend the classical Cox-Ross-Rubinstein binomial model in two ways. We first develop a binomial model with time-dependent parameters that equate all moments of the pricing tree increments with the corresponding moments of the increments of the limiting Itô price process. Second, we introduce a new trinomial model i…

2017-12-10abs ↗pdf ↗

A new tree model, GRST, improves option pricing without log-normality assumptions.

problem Limitations of CRR binomial trees in valuing securities with early exercise characteristics.
method Gaussian Recombining Split Tree (GRST) that generates a discrete probability mass function approximating a Gaussian distribution.
result Option prices from GRST align closely with market prices.

The study models credit risk using Merton's framework and binomial trees.

problem Credit risk pricing and implied volatility estimation.
method Calibrated using Merton's structural model, with asset volatility derived from Black-Scholes-Merton. Implied mean return and probability surfaces constructed using a recombining binomial tree.
result Established a practical method for constructing implied credit surfaces.

New MC-Tree method combines Monte Carlo and binomial tree for option pricing and CVA.

problem Combining Monte Carlo and binomial tree methods for accurate and efficient option pricing and CVA calculations.
method MC-Tree method that mixes Monte Carlo and binomial tree parameters, using maximum entropy distributions for compound densities.
result MC-Tree method provides accurate and efficient option pricing and CVA calculations.

Enhances binomial model with machine learning for microstructure effects.

problem Traditional binomial models ignore market microstructure effects like bid-ask spreads.
method Augments binomial tree with Random Forest classifiers trained on market data.
result Achieves 88.25% AUC in forecasting price movements using real-world data.

Study on stock price formation on trees with multi-population and non-rational agents.

problem Equilibrium price formation for risky stock with multi-population and non-rational agents.
method Combining mean-field game theory with binomial tree framework, proving existence of unique equilibrium, deriving explicit formula for transition probabilities.
result Existence of unique mean-field market-clearing equilibrium with explicit analytic formula for stock price transition probabilities.

We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial coefficients. We discuss which polynomials can be realized as plucking polynomial…

2016-01-14abs ↗pdf ↗

The paper presents a practical method for evaluating investment projects using real options.

problem Evaluating investment projects under uncertainty and strategic risk management.
method Binomial trees and real options techniques for evaluating investment projects.
result The method can be used for most real options and introduces Project Value at Risk for feasibility.

This paper studies how relative performance concerns affect stock prices in a tree-like market model.

problem The impact of relative performance concerns on stock prices in a tree-like market model.
method Mean-field equilibrium analysis in a binomial tree framework with exponential utility.
result Existence and uniqueness of market-clearing mean-field equilibrium in both single- and multi-population settings.

Derivative pricing is about cash flow discounting at the riskfree rate. This teaching has lost its meaning post the financial crisis, due to the addition of extra value adjustments (XVA), which also made derivatives pricing and valuation a very difficult task for investors. This article recovers a properly defined disc…

2020-02-20abs ↗pdf ↗

A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov process. The first two components are related to the stock and volatility processe…

2012-05-16abs ↗pdf ↗

Study on predictable forward processes in trading without frequent evaluations.

problem Trading performance evaluation times not matching trading times.
method Solving a linear functional equation to construct predictable forward processes.
result Predictable forward processes are inherently myopic and optimal strategies do not use future information.

The study tightens bounds on binomial probabilities and minimums using KL-divergence.

problem Tightening bounds on binomial probabilities and minimums of i.i.d. Binomials.
method Applied Sanov's theorem to derive upper and lower bounds on binomial tail probabilities and minimums, expressed in terms of KL-divergence.
result High probability upper and lower bounds on the minimum of i.i.d. Binomial random variables, finite sample, asymptotically tight.

We develop and study stability properties of a hybrid approximation of functionals of the Bates jump model with stochastic interest rate that uses a tree method in the direction of the volatility and the interest rate and a finite-difference approach in order to handle the underlying asset price process. We also propos…

2016-03-23abs ↗pdf ↗

Bayesian CART models improve insurance claims frequency prediction and interpretation.

problem Improving accuracy and interpretability in insurance pricing models.
method Introducing Bayesian CART models for claims frequency, implementing MCMC algorithm for posterior tree exploration, and using DIC for model selection.
result Bayesian CART models can better classify policy-holders into risk groups.

We discuss - in what is intended to be a pedagogical fashion - a criterion, which is a lower bound on a certain ratio, for when a stock (or a similar instrument) is not a good investment in the long term, which can happen even if the expected return is positive. The root cause is that prices are positive and have skewe…

2016-10-12abs ↗pdf ↗

In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding bound is an immediate consequence of the theory. Moreover, we propose a rigorous and…

2019-08-19abs ↗pdf ↗

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

The paper resolves a counterexample showing convergence of expected utility in binomial models.

problem The convergence of expected utility under binomial models was previously shown to fail in certain cases.
method The paper provides a positive result on convergence using fine estimates from the Central Limit Theorem.
result A general positive result of convergence of expected utility is provided in symmetric binomial models.

We consider learning parameters of Binomial Hidden Markov Models, which may be used to model DNA methylation data. The standard algorithm for the problem is EM, which is computationally expensive for sequences of the scale of the mammalian genome. Recently developed spectral algorithms can learn parameters of latent va…

2018-02-07abs ↗pdf ↗

Global models outperform local models in forecasting intermittent time series.

problem Forecasting intermittent time series with zeros in supply chains.
method Comparison of state-of-the-art probabilistic local and global models on five datasets.
result TiDE, a simple neural network architecture, achieves the best accuracy among global models.

A new LDA model with covariates for mixed-membership clusters.

problem Modeling mixed-membership clusters in discrete data with covariates.
method Negative binomial regression embedded within LDA, slice sampling within Gibbs sampling.
result Model successfully retrieves true parameter values and predicts cluster abundances using covariates.

The pricing of financial derivatives, which requires massive calculations and close-to-real-time operations under many trading and arbitrage scenarios, were largely infeasible in the past. However, with the advancement of modern computing, the efficiency has substantially improved. In this work, we propose and design a…

2019-06-15abs ↗pdf ↗

We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…

2013-12-31abs ↗pdf ↗