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.

169,291 papers · 148 categories

Trend · papers per month

18355370 · May 202619922001200920182026
48 results for binomial coefficients

The paper derives statistics of multi-factor functions from their Fourier transforms.

problem Deriving statistics of multi-factor functions from Fourier transforms.
method Developed an m-Coefficient/Index Annihilation Theorem to analyze the moments of a function from its Fourier transform.
result The mth moment of a function becomes a series of terms, each with precisely m Fourier coefficients, and the indices sum to zero.

A new control chart detects shifts in binary data streams quickly and reliably.

problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.

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 ↗

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.

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.

Two models incorporate market microstructure noise into asset pricing and option valuation.

problem Effect of market microstructure noise on asset pricing and option valuation.
method Developed two models: a continuous-time Black-Scholes-Merton model and a discrete binomial tree model.
result Extracted coefficients to quantify noise impact on volatility and drift.

Study on vanishing cohomology groups in random simplicial complexes.

problem Determining when cohomology groups vanish in random simplicial complexes.
method Analysis of binomial random (k+1)(k+1)-uniform hypergraphs and their downward-closure.
result Vanishing of cohomology groups with coefficients in F2\mathbb{F}_2 has a sharp threshold.

Improved binomial model for American put prices with error analysis.

problem Improving the accuracy of American put price approximations.
method Binomial approximation in the Black-Scholes model with consideration of continuous dividend yield.
result Error in approximation is O((lnn)α/n)O((ln n) ^{α} /n), where α depends on interest rate and dividend yield.

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 ↗

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.

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.

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 ↗

Improved concentration inequalities for sub-Weibull variables enhance statistical and machine learning applications.

problem Improving concentration inequalities for sub-Weibull random variables.
method Developed new concentration inequalities for sums of independent sub-Weibull random variables, including a new sub-Weibull parameter.
result New concentration inequalities with sharper constants and a mixture of sub-Gaussian and sub-Weibull tails.

We justify and give error estimates for binomial approximations of game (Israeli) options in the Black--Scholes market with Lipschitz continuous path dependent payoffs which are new also for usual American style options. We show also that rational (optimal) exercise times and hedging self-financing portfolios of binomi…

2006-07-05abs ↗pdf ↗

This paper provides formulas for minimum cost super-hedging in a multi-asset binomial market.

problem Finding minimum cost super-hedging strategies in a multi-asset, incomplete market model.
method Explicit formulas for minimum cost super-hedging strategies for various European type multi-asset contingent claims.
result Explicit formulas for non-negative local residuals of super-hedging strategies.

Toehold purchase, defined here as purchase of one share in a firm by an investor preparing a tender offer to acquire majority of shares in it, reduces by one the number of shares this investor needs for majority. In the paper we construct mathematical models for the toehold and no-toehold strategies and compare the exp…

2012-04-10abs ↗pdf ↗

Detecting and recovering labels in binomial logistic mixtures is challenging due to an information gap.

problem Detecting and recovering labels in binomial logistic mixtures
method Propose two feasibility-aware inference procedures
result Avoid misleading component selections and improve label probability calibration

PSO optimizes model parameters in nonstandard distributions.

problem Estimating model parameters in nonstandard distributions using existing algorithms.
method Particle Swarm Optimization (PSO) as an alternative optimization routine.
result PSO produces more optimal or convergent results than existing algorithms.

New framework for portfolio management using binomial markets and game theory.

problem Investment behavior in competitive and incomplete markets.
method Introduces PRFPP framework, constructs and analyzes for both finite and mean field games.
result Relative performance concerns do not always lead to more risky asset investment.