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

Trend · papers per month

80159239318 · Jun 202019922001200920172026
48 results for random formulas

The Lugannani-Rice formula is a saddlepoint approximation method for estimating the tail probability distribution function, which was originally studied for the sum of independent identically distributed random variables. Because of its tractability, the formula is now widely used in practical financial engineering as …

2013-10-12abs ↗pdf ↗

We study random knots and links in R^3 using the Petaluma model, which is based on the petal projections developed by Adams et al. (2012). In this model we obtain a formula for the distribution of the linking number of a random two-component link. We also obtain formulas for the expectations and the higher moments of t…

2014-11-12abs ↗pdf ↗

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

The study of topological properties of random smooth maps, focusing on Kac-Rice formula and Betti numbers.

problem Topological and geometric properties of random smooth maps.
method Developed a general framework for differential geometric and topological issues of smooth Gaussian Random Fields, generalized Kac-Rice formula, applied to Kostlan random polynomials, and proved an original theorem in Differential Topology.
result The Betti numbers of the solution of a system of regular equations cannot decrease under a C0\mathcal{C}^0-small perturbation of the equations.

Estimates the probability of a random symmetric tensor being close to rank-one.

problem Estimating the probability of a random symmetric tensor being close to rank-one.
method Using Weyl's tube formula and techniques from Random Matrix theory, we study metric invariants of the real Veronese variety.
result Explicit formula for the reach and curvature coefficients of the real Veronese variety with respect to the Bombieri-Weyl metric.

Formula found for probability of random triangles on flat tori being homotopically trivial.

problem Calculating the probability of random triangles on flat tori being homotopically trivial.
method Reduced problem to new invariant of measurable sets in the plane unchanged by area-preserving affine transformations.
result Probability is minimized on rectangular tori and maximized on regular hexagonal tori.

Develops a new model for cross-currency derivatives pricing.

problem Pricing cross-currency derivatives in a complex market model.
method Introduces a random field LIBOR market model to handle uncertainty in forward LIBOR rates.
result Derives exact and approximate pricing formulas for various derivatives.

The paper derives formulas for option pricing and random walk expectations.

problem Calculating the price of barrier and lookback options.
method Inverse Z-transform, Fourier/Laplace inversion, Wiener-Hopf factorization, and numerical methods.
result Efficient numerical methods for option pricing are developed.

Study on spin random fields using chaos decomposition for cosmic microwave background modeling.

problem Modeling polarization of Cosmic Microwave Background using spin random fields.
method Explicit Wiener-Itô chaos decomposition of area measures of level sets.
result Reveals a clear difference between high frequency regime and zero spin case.

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a knot at random among all knots with bridge index at most 2. Restricted to this c…

2015-05-28abs ↗pdf ↗

This work estimates edge weights of edge-reinforced random walks using observed data.

problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.

Study of random multicurves and square-tiled surfaces on large genus surfaces.

problem Understanding the geometry and combinatorial properties of random multicurves and square-tiled surfaces on surfaces of large genus.
method Combination of combinatorial and geometric analysis, including large genus asymptotic analysis of moduli space volumes and intersection numbers.
result Random multicurves and square-tiled surfaces have well-approximated properties by random permutations, with specific expected values.

We prove a Chern-Lashof type formula computing the expected number of critical points of smooth function on a smooth manifold MM randomly chosen from a finite dimensional subspace VC(M)V\subset C^\infty(M) equipped with a Gaussian probability measure. We then use this formula this formula to find the asymptotics of the e…

2010-08-30abs ↗pdf ↗

The paper develops formulas for hedging and arbitrage in markets with random stopping times.

problem Developing pricing formulas for assets in markets with random stopping times.
method Modeling market with random stopping time, analyzing conditional essential supremum, and describing super-hedging prices.
result Explicit formulas for super-hedging prices and Immediate-Profit arbitrage are derived.

Paper offers a simple CDS approximation formula with high accuracy.

problem Lack of CDS levels for market appreciation of companies' default risk.
method Developed a global and transparent Equity-to-Credit (E2C) formula using random forest regression.
result Random forest regression with E2C formula achieves 87.3% out-of-sample accuracy in CDS approximations.

Study on random hyperbolic surfaces with many cusps, focusing on tight geodesics.

problem Understanding length statistics of geodesics on random hyperbolic surfaces with cusps.
method Recursion formula for tight Weil-Petersson volumes and generalization of Mirzakhani's integration formula.
result Recovery of Poisson point process in large genus limit for length statistics of tight geodesics.

Two formulae estimate sensitivity of random vectors to distributional parameters.

problem Estimating sensitivity of random vectors to distributional parameters.
method Two analytical formulae and four numerical algorithms.
result Validated numerical algorithms and demonstrated effectiveness.

Study on deep neural networks using branching processes and Mehler's formula.

problem Understanding the mathematical role of activation functions in compositional neural networks.
method Connection between compositional kernels and branching processes via Mehler's formula; new random features algorithm.
result Explicit formulas for eigenvalues of compositional kernels quantify complexity.

We study multiple defaults where the global market information is modelled as progressive enlargement of filtrations. We shall provide a general pricing formula by establishing a relationship between the enlarged filtration and the reference default-free filtration in the random measure framework. On each default scena…

2009-12-16abs ↗pdf ↗

Consider a random smooth Gaussian field G(x):FRG(x):F\to\mathbb{R}, where FF is a compact in Rd\mathbb{R}^d. We derive a formula for average area of a surface generated by the equation G(x)=0G(x)=0 and give some applications. As an auxiliary result we obtain an integral expression for area of a surface induced by zeros of a \e…

2011-02-17abs ↗pdf ↗

A version of indifference valuation of a European call option is proposed that includes statistical regularities of nonstochastic randomness. Classical relations (forward contract value and Black-Scholes formula) are obtained as particular cases. We show that in the general case of nonstochastic randomness the minimal …

2010-06-13abs ↗pdf ↗

We show that integration over a GG-manifold MM can be reduced to integration over a minimal section ΣΣ with respect to an induced weighted measure and integration over a homogeneous space G/NG/N. We relate our formula to integration formulae for polar actions and calculate some weight functions. In case of a compact …

2009-01-16abs ↗pdf ↗

Building on the work of Schweizer (1995) and Cern and Kallseny (2007), we present discrete time formulas minimizing the mean square hedging error for multidimensional assets. In particular, we give explicit formulas when a regime-switching random walk or a GARCH-type process is utilized to model the returns. Monte Carl…

2012-11-21abs ↗pdf ↗

New spectral mixture representation for isotropic kernels simplifies random Fourier features.

problem Applying Random Fourier Features to complex kernels.
method Decompose isotropic kernels into scale mixtures of α-stable random vectors.
result Constructive spectral sampling formula for various kernels.

Study on critical points in random neural networks, revealing three regimes based on activation function.

problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also show that the probability of any given knot appearing in this model decays to ze…

2016-06-01abs ↗pdf ↗

Improves efficiency of random feature approximations for dot product kernels.

problem Efficiency of random feature approximations for dot product kernels.
method Generalization of existing random feature approximations using complex-valued random features, theoretical analysis of variances, data-driven optimization approach.
result Complex-valued random features can significantly reduce the variances of approximations.

The study examines Fisher information matrices and neural tangent kernels for simple ReLU networks with random weights.

problem Understanding the relationship between Fisher information matrices and neural tangent kernels for 2-layer ReLU networks.
method Analyzes Fisher information matrices and neural tangent kernels for 2-layer ReLU networks with random hidden weights, focusing on spectral decomposition and eigenfunctions.
result Obtained an approximation formula for functions represented by 2-layer neural networks.

This paper explores how boolean formulas can be learned by deep neural networks.

problem Understanding the learnability of boolean formulas by deep neural networks.
method Analysis of boolean formulas associated with model-sampling benchmarks, combinatorial optimization problems, and random 3-CNFs.
result Neural networks outperform rule-based systems and pure symbolic approaches in learning boolean formulas.

Study on systole of random hyperbolic 3-manifolds, proving limit exists and calculating it.

problem Understanding the systole of random hyperbolic 3-manifolds.
method Modeling random hyperbolic 3-manifolds using truncated tetrahedra, calculating expected systole limit as volume increases.
result Closed formula and numerical approximation for the limit of the expected systole as volume tends to infinity.

We prove that a Gaussian ensemble of smooth random sections of a real vector bundle over compact manifold canonically defines a metric on the bundle together with a connection compatible with it. Additionally, we prove a refined Gauss-Bonnet-Chern theorem stating that if the bundle and the manifold are oriented, then t…

2014-08-25abs ↗pdf ↗