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,695 papers · 148 categories

Trend · papers per month

52104155207 · Jun 202019922001200920172026
48 results for hitting probabilities

In this paper we study the asymptotic decay of finite time ruin probabilities for an insurance company that faces heavy-tailed claims, uses predictable investment strategies and makes investments in risky assets whose prices evolve according to quite general semimartingales. We show that the ruin problem corresponds to…

2008-09-25abs ↗pdf ↗

The paper simulates Lévy processes and their extremum and hitting time.

problem Simulating Lévy processes and their extremum and hitting time accurately and efficiently.
method Using characteristic functions and conditional characteristic functions, with conformal deformations and precalculated values on multi-grids.
result Accurate and fast simulation of Lévy processes and their extremum and hitting time.

Bayesian learning improves reliability of molecular predictions for hit compound discovery.

problem Improving reliability of machine learning predictions for virtual screening.
method Bayesian learning algorithms applied to graph neural networks.
result Bayesian learning leads to well-calibrated predictions and higher hit compound success.

Study bond market making with hit-ratio target using optimal control and HJB equations.

problem Optimizing bond market making with hit-ratio target in OTC markets.
method Stochastic optimal control approach, dualizing hit-ratio target, HJB equation, Riccati equation, linearization.
result Explicit quote decompositions into riskless spread, inventory-risk correction, and hit-ratio correction.

A new metric based on hitting probabilities for directed graphs and Markov chains.

problem Lack of metrics specifically adapted to asymmetric structure of directed graphs and Markov chains.
method Metric based on hitting probabilities, insensitive to shortest and average walk distances.
result New structural theory of directed graphs and utility for various applications.

We analyze the hitting time distributions of stock price returns in different time windows, characterized by different levels of noise present in the market. The study has been performed on two sets of data from US markets. The first one is composed by daily price of 1071 stocks trade for the 12-year period 1987-1998, …

2006-08-19abs ↗pdf ↗

Santaló calculated the measures for all positions of a moving line segment in which it lies inside a fixed circle and intersects this circle in one or two points. From these measures he concluded hitting probabilities for a line segment thrown randomly onto an unbounded lattice of circles. In the present paper these re…

2016-12-06abs ↗pdf ↗

We propose a simpler derivation of the probability density function of Feller Diffusion using the Fourier Transform and solving the resulting equation via the Method of Characteristics. We also discuss simulation algorithms and confirm key properties related to hitting time probabilities via the simulation.

2019-05-26abs ↗pdf ↗

In this paper, we investigate the cooling-off effect (opposite to the magnet effect) from two aspects. Firstly, from the viewpoint of dynamics, we study the existence of the cooling-off effect by following the dynamical evolution of some financial variables over a period of time before the stock price hits its limit. S…

2018-03-26abs ↗pdf ↗

SurvSurf predicts first hitting times for intermittent events without monotonic violations.

problem Predicting first hitting times for intermittent events with monotonicity guarantees.
method Partially monotonic neural network for sequential events, incorporating unobserved events.
result SurvSurf outperforms existing models in MSE and IBS metrics.

Estimates on Einstein manifolds improve Brownian motion behavior and curvature limits.

problem Improving estimates on Einstein manifolds for Brownian motion behavior.
method Generalizing Benjamini-Pemantle-Peres estimate to manifolds with Ricci curvature bounds.
result Sharp estimates for Brownian motion on high curvature parts of Ricci-flat manifolds.

In this work, we attempt to solve the Hit Song Science problem, which aims to predict which songs will become chart-topping hits. We constructed a dataset with approximately 1.8 million hit and non-hit songs and extracted their audio features using the Spotify Web API. We test four models on our dataset. Our best model…

2019-08-22abs ↗pdf ↗

Record companies invest billions of dollars in new talent around the globe each year. Gaining insight into what actually makes a hit song would provide tremendous benefits for the music industry. In this research we tackle this question by focussing on the dance hit song classification problem. A database of dance hit …

2019-05-17abs ↗pdf ↗

This paper improves bond market making by adjusting hit-ratios for client flow quality.

problem Economic misleading of raw hit-ratios in corporate bond market making.
method Stochastic-control framework with residual-quality-adjusted hit-ratio.
result Optimal quotes decompose into various components, improving service/economics frontier.

Paper investigates separating times for general diffusions, providing new insights.

problem Understanding phase transitions between equivalence and singularity in diffusions.
method Representation of separating time as hitting time of a deterministic set, characterized by speed and scale.
result Explicit and easy-to-check conditions for absolute continuity and singularity of diffusions.

Derives integral representations for a Lévy process and its extremum, hitting time, with fast evaluation.

problem Efficiently evaluating the joint probability density function of a Lévy process, its supremum, and hitting time.
method Integral representations, Laplace-Fourier transforms, summation by parts, conformal deformation, trapezoid rules, Gaver-Wynn-Rho algorithm.
result Explicit calculations and fast evaluation of the joint cpdf for Lévy processes.

Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.

problem Quantifying advantages of Hit-and-Run's coordinate-free property.
method Sharp estimates via coupling methods and mixing time bounds.
result Ballistic and superdiffusive convergence rates in certain settings.

We solve the first-passage problem for the Heston random diffusion model. We obtain exact analytical expressions for the survival and hitting probabilities to a given level of return. We study several asymptotic behaviors and obtain approximate forms of these probabilities which prove, among other interesting propertie…

2009-02-16abs ↗pdf ↗

The hitting measure is singular and has dimension less than 1 for cocompact Fuchsian groups.

problem Analyzing the hitting measure and Hausdorff dimension for cocompact Fuchsian groups.
method Geometric and probabilistic analysis of random walks on cocompact Fuchsian groups.
result The hitting measure is singular with respect to Lebesgue measure and has a Hausdorff dimension strictly less than 1.

We consider a controlled diffusion process (Xt)t0(X_t)_{t\ge 0} where the controller is allowed to choose the drift μtμ_t and the volatility σtσ_t from a set $\K(x) \subset \R\times (0,\infty)$ when Xt=xX_t=x. By choosing the largest μσ2\fracμ{σ^2} at every point in time an extremal process is constructed which is under suita…

2012-10-14abs ↗pdf ↗

This project explores several Machine Learning methods to predict movie genres based on plot summaries. Naive Bayes, Word2Vec+XGBoost and Recurrent Neural Networks are used for text classification, while K-binary transformation, rank method and probabilistic classification with learned probability threshold are employe…

2018-01-15abs ↗pdf ↗

New algorithm for average reward learning with bounded hitting time assumption.

problem Minimizing regret in average reward reinforcement learning with bounded hitting time.
method Optimistic Q-learning with a novel L\overline{L} operator for bounded hitting time.
result Regret bound of ildeO(H5SAT) ilde{O}(H^5 S\sqrt{AT}) for average reward learning.

KANEL combines models for early hit enrichment in virtual screening.

problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the significance of this problem, statistical characterization of the proposed metrics …

2015-11-02abs ↗pdf ↗

Mean field game with defaultable agents and systemic risk quantified.

problem Modeling systemic risk in a financial system with defaultable agents.
method Introduced a mean field game with default, provided an explicit solution, and derived an equation for default probability evolution.
result Systemic risk is described by the evolution of default probability.

Let μμ be a probability measure on Out(FN)\text{Out}(F_N) with finite first logarithmic moment with respect to the word metric, finite entropy, and whose support generates a nonelementary subgroup of Out(FN)\text{Out}(F_N). We show that almost every sample path of the random walk on (Out(FN),μ)(\text{Out}(F_N),μ), when realized in Culle…

2014-05-30abs ↗pdf ↗

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

We show that the family of probability measures on the nn-dimensional unit sphere, having density proportional to: \[ S^n \ni y \mapsto \frac{1}{|y - x|^{n+α}}, \] satisfies the Curvature-Dimension condition CD(n1n+α4,α)CD(n-1-\frac{n+α}{4},-α), for all x<1|x| < 1, αnα\geq -n and n2n\geq 2. The case α=1α= 1 corresponds to the hit…

2015-05-16abs ↗pdf ↗

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities P\mathcal{P}. The maturity is specified as the hitting time to level 00 of some continuous index process at which the payoff process is even allowed to have…

2015-05-28abs ↗pdf ↗

In this study we prove the existence of statistical arbitrage opportunities in the Black-Scholes framework by considering trading strategies that consists of borrowing from the risk free rate and taking a long position in the stock until it hits a deterministic barrier level. We derive analytical formulas for the expec…

2014-06-21abs ↗pdf ↗

This study compares two neural models for financial forecasting, showing their superiority.

problem Improving financial market trend predictions using neural networks.
method Systematic comparison of N-HiTS and N-BEATS with conventional models.
result N-HiTS and N-BEATS enhance forecast accuracy and robustness in financial time series data.

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗