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

Trend · papers per month

336698131 · Jun 202019922001200920172026
48 results for Area Calculations

Study reveals how to determine area and curvature from fluid flow resonances.

problem Determining geometric properties from fluid flow data.
method Asymptotic expansion of heat kernel and Steklov spectral invariants.
result Area and total mean curvature can be inferred from Steklov eigenvalues.

We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the Hamiltonian H, the distance either is bounded or behaves asymptotically linear. Moreove…

1999-05-10abs ↗pdf ↗

Study calculates the renormalized area of catenoids in hyperbolic spaces.

problem Calculating the renormalized area of catenoids in hyperbolic spaces.
method Variational characterization and Chern--Gauss--Bonnet formulas for locally conformally flat manifolds.
result Renormalized area of catenoids varies continuously from negative infinity to twice the area of totally geodesic hypersurfaces.

On certain manifolds, the phase which appears in the scalar product of two coherent state vectors is twice the symplectic area of the geodesic triangle determined by the corresponding points on the manifold and the origin of the system of coordinates. This result is proved for compact Hermitian symmetric spaces using t…

1999-03-31abs ↗pdf ↗

Study proposes new methods to calculate probabilistic benchmarks in noisy data.

problem Identifying opportunities for improvement in comparable units with noisy data.
method 2-step methodology involving undersampling and relevance vector machine.
result Higher discrimination power achieved with macro-economic environment variables.

The paper calculates area Siegel--Veech constants for specific submanifolds of REL zero.

problem Calculating area Siegel--Veech constants for affine invariant submanifolds of REL zero.
method Using volumes of the principal boundary strata and intersection theory.
result Proves a conjectural formula for the area Siegel--Veech constant in the case of REL zero.

We establish a link between Archimedes' method of integration for calculating areas, volumes and centers of mass of segments of parabolas and quadrics of revolution by factorization via the moments of a balance and an integration technique for a particular integrable system, namely Bianchi's Bäcklund transformation for…

2007-09-26abs ↗pdf ↗

Three configurations of two perpendicular disks in R^3 are examined, the first in which the disks share centers and the other two in which the disks touch at precisely one point. Volume, surface area and mean width calculations dominate the discussion. Integrated mean curvature also appears as an indirect way to comput…

2012-11-19abs ↗pdf ↗

The setting for this brief paper is R^3. Distance between two spheres is understood as distance delta between spherical centers. For instance, a Reuleaux tetrahedron T is the intersection of four unit balls satisfying delta=1 pairwise. Volume and surface area of T are already well-known; our humble contribution is to c…

2013-01-23abs ↗pdf ↗

The oloid is the convex hull of two circles with equal radius in perpendicular planes so that the center of each circle lies on the other circle. We calculate the mean width of the oloid in two ways, first via the integral of mean curvature, and then directly. Using this result, the surface area and the volume of the p…

2016-04-25abs ↗pdf ↗

Dynamic risk assessment method for WUI fires improves upon static frameworks.

problem Static risk assessment methods fail to capture dynamic changes in WUI fire risks.
method Dynamic evaluation matrix, grey incidence analysis, optimization model.
result The proposed method effectively captures dynamic risk evolution patterns.

In risk management, tail risks are of crucial importance. The assessment of risks should be carried out in accordance with the regulatory authority's requirement at high quantiles. In general, the underlying distribution function is unknown, the database is sparse, and therefore special tail models are used. Very often…

2019-04-27abs ↗pdf ↗

The study examines Euclid's Book I, focusing on area applications and construction methods.

problem Exploring Euclid's geometric constructions and proofs, particularly those involving area calculations.
method Summarizing medieval editions and ancient commentaries, comparing constructions and proofs.
result Medieval editions often avoid Euclid's use of superposition in area proofs, offering alternative constructions.

Deep Neural Networks (DNNs) have become very popular for prediction in many areas. Their strength is in representation with a high number of parameters that are commonly learned via gradient descent or similar optimization methods. However, the representation is non-standardized, and the gradient calculation methods ar…

2016-10-05abs ↗pdf ↗

The study calculates the index distribution of Brownian loops in various geometrical settings.

problem Calculating the distribution of the index of Brownian loops in specific geometrical settings.
method Analysis based on the geometry of Hopf and anti-de Sitter fibrations, and the relationship between winding and area forms.
result Explicit formulas and asymptotics for the distribution of the index of the Brownian loop.

We view strict ring spectra as generalized rings. The study of their algebraic K-theory is motivated by its applications to the automorphism groups of compact manifolds. Partial calculations of algebraic K-theory for the sphere spectrum are available at regular primes, but we seek more conceptual answers in terms of lo…

2014-03-24abs ↗pdf ↗

Paper proposes a new combined regression strategy for conditional survival prediction.

problem Improving survival prediction accuracy using conditional survival function.
method Uses regression-based weak learners with area-norm proximity measure to create an ensemble technique.
result The proposed model outperforms Random Survival Forest and selects important variables effectively.

This paper reviews PU learning evaluation methods and provides practical recommendations.

problem Evaluating PU learning methods when only positive and unlabelled data are available.
method Critical review of 51 articles proposing PU classifiers and alternative predictive accuracy measures.
result Practical recommendations for improving PU learning evaluation.

For simple Lie groups, the only homogeneous manifolds G/KG/K, where KK is maximal compact subgroup,for which the phase of the scalar product of two coherent state vectors is twice the symplectic area of a geodesic triangle are the hermitian symmetric spaces. An explicit calculation of the multiplicative factor on the c…

2004-08-18abs ↗pdf ↗

We calculate the Masur-Veech volume of the gothic locus G\mathcal{G} in the stratum H(23)\mathcal{H}(2^{3}) of genus four. Our method is based on the use of the formulae for the Euler characteristics of gothic Teichmüller curves to determine the number of lattice points of given area. We also use this method to recalcula…

2019-06-18abs ↗pdf ↗

When calculating the index of a minimal surface, the set of smooth functions on a domain with compact support is the standard setting to describe admissible variations. We show that the set of admissible variations can be widened in a geometrically meaningful manner by considering the difference of area functional, lea…

2018-01-08abs ↗pdf ↗

For a given bounded domain ΩRnΩ\subset {\Bbb R}^n with smooth boundary, we explicitly calculate the first two coefficients of the asymptotic expansion of the heat trace associated with the Stokes operator as t0+t\to 0^+. These coefficients (i.e., heat invariants) provide precise information for the volume of the domain $…

2014-10-16abs ↗pdf ↗

Method estimates uncertainty in spatial predictions by defining an 'area of applicability'.

problem Uncertainty in predictions for new geographic locations far from training data.
method Proposes a dissimilarity index (DI) based on minimum distance to training data, and defines the 'area of applicability' (AOA) using a threshold on DI.
result Prediction error within the AOA is comparable to the cross-validation error of the model, while cross-validation error does not apply outside the AOA.

Non-linear image reconstruction and signal analysis deal with complex inverse problems. To tackle such problems in a systematic way, I present information field theory (IFT) as a means of Bayesian, data based inference on spatially distributed signal fields. IFT is a statistical field theory, which permits the construc…

2013-01-11abs ↗pdf ↗

Regularized zeta function for polyhedra calculated from Riemann surface invariants.

problem Calculating a spectral invariant for polyhedra using zeta function regularization.
method Holomorphic invariants and conical points of the metric, sewing two polyhedra, self-adjoint extensions.
result Explicit expression for spectral invariant through Riemann surface invariants.

For a bounded domain ΩRnΩ\subset {\Bbb R}^n with smooth boundary, we explicitly calculate the first two coefficients of the asymptotic expansion of the trace of the strongly continuous semigroup associated with the Navier-Lamé operator on ΩΩ as t0+t\to 0^+. These coefficients (i.e., spectral invariants) provide precise …

2015-12-23abs ↗pdf ↗

The moduli space of lattices of C\mathbb{C} is a Riemann surface of finite hyperbolic area with the square lattice as an origin. We select a lattice from the induced uniform distribution and calculate the statistics of the Teichmüller distance to the origin. This in turn identifies distribution of the distance in Teic…

2018-07-29abs ↗pdf ↗

DCDC calculates convergence rates for Markov chains using neural networks.

problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.