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

124247371494 · May 202619922001200920172026
48 results for asymptotic bound

Defines renormalized volume for bounded regions in asymptotically hyperbolic Einstein spaces.

problem Calculating the volume of bounded regions in complex geometries.
method Defines renormalized volume, proves Gauss-Bonnet theorem, computes derivative under variations.
result Derives a Gauss-Bonnet theorem for the renormalized volume.

The paper establishes bounds on scalar curvature on asymptotically flat manifolds.

problem Establishing scalar curvature bounds on asymptotically flat manifolds.
method Using Ricci-DeTurck flow and distributional scalar curvature, the paper derives bounds on scalar curvature.
result The scalar curvature lower bound under Ricci-DeTurck flow depends on the scalar curvature lower bound in the β-weak sense and time.

Ancient Ricci flows with asymptotic solitons have uniform bounds and inequalities.

problem Bounding and understanding ancient Ricci flows with asymptotic solitons.
method Analyzing asymptotic solitons, proving uniform bounds on Perelman's ν-functional, and showing Nash entropy bounds.
result Uniform bounds on Perelman's ν-functional and logarithmic/Sobolev inequalities for ancient solutions.

Willmore-type inequalities for bounded domains in manifolds with curvature bounds.

problem Establishing inequalities for bounded domains in manifolds with curvature bounds.
method Using asymptotic or integral Ricci curvature bounds to establish inequalities.
result Recovering a recent inequality of Jin-Yin.

We introduce the notion of asymptotic cohomology based on the bounded cohomology and define cohomological asymptotic dimension $\as_{\Z} X$ of metric spaces. We show that it agrees with the asymptotic dimension $\as X$ when the later is finite. Then we use this fact to construct an example of a metric space XX of boun…

2006-08-09abs ↗pdf ↗

Proposes new rule for ranking investment prospects over long horizons.

problem Ranking investment prospects over long horizons considering bounded risk aversion.
method Introduces asymptotic fractional-order stochastic dominance with bounded relative risk aversion.
result Establishes equivalent conditions for the new rule under lognormal returns without mean non-negativity constraint.

New algorithm CROP achieves asymptotic optimality with bounded regret.

problem Optimistic algorithms fail to achieve asymptotic instance-dependent regret optimality.
method CRush Optimism with Pessimism (CROP) algorithm that eliminates optimistic hypotheses.
result CROP achieves constant-factor asymptotic optimality and bounded regret.

Sharp bounds derived for eigenvalues on specific geometric spaces.

problem Eigenvalue problems on asymptotically hyperbolic manifolds and submanifolds.
method Sharp bounds derived for three types of eigenvalue problems: pp-Dirichlet, polyharmonic, and weakly Poincaré-Einstein.
result Sharp bounds and their implications for asymptotic sectional curvatures and mean curvature.

This note provides an error bound for the Hartman-Watson integral's leading term.

problem Bounding the error of the leading term of the Hartman-Watson integral.
method Asymptotic expansion analysis focusing on the regime rt=ρrt=ρ constant.
result The error term is bounded uniformly as ϑ(t,ρ)170t|\vartheta(t,ρ)|\leq \frac{1}{70}t.

Recent works have derived non-asymptotic upper bounds for convergence of underdamped Langevin MCMC. We revisit these bound and consider introducing scaling terms in the underlying underdamped Langevin equation. In particular, we provide conditions under which an appropriate scaling allows to improve the error bounds in…

2019-12-06abs ↗pdf ↗

This paper establishes non-asymptotic learning bounds for the DR covariate shift adaptation.

problem Distribution shift between training and test domains in machine learning.
method Doubly-robust (DR) estimator combining density ratio estimation and pilot regression model.
result First non-asymptotic learning bounds for DR covariate shift adaptation.

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

2011-08-20abs ↗pdf ↗

We construct a universal space for the class of proper metric spaces of bounded geometry and of given asymptotic dimension. As a consequence of this result, we establish coincidence of the asymptotic dimension with the asymptotic inductive dimensions.

2002-11-04abs ↗pdf ↗

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors …

2015-11-19abs ↗pdf ↗

Smooth solutions found for a curvature problem in hyperbolic space.

problem Existence of smooth complete hypersurfaces with prescribed curvature in hyperbolic space.
method Utilized Pogorelov type interior second order estimate.
result Affirmative answers for specific curvature cases in hyperbolic space.

Study non-asymptotic estimation bounds for LTI models with Gaussian noise.

problem Estimating parameters of LTI models with non-asymptotic error bounds.
method Sharp non-asymptotic lower bounds using Cramér-Rao and van Trees inequalities, concentration results, and differential geometric constructions.
result Sharp and rate-optimal lower bounds for mean square estimation risk.

Study on potential behavior in special geometric spaces.

problem Understanding potential behavior in specific geometric spaces.
method Analyzing asymptotic behavior of pp-capacitary potentials and weak Inverse Mean Curvature Flow.
result Characterized the behavior of potentials in Asymptotically Conical manifolds.

We show that the asymptotic dimension of box spaces behaves (sub)additively with respect to extensions of groups. As a result, we obtain that for an elementary amenable group, the asymptotic dimension of any of its box spaces is bounded above by its Hirsch length. This bound is shown to be an equality for a large subcl…

2015-08-20abs ↗pdf ↗

Sharp eigenvalue estimates for submanifolds of asymptotically hyperbolic spaces.

problem Estimating eigenvalues of the p-Laplacian on submanifolds of asymptotically hyperbolic manifolds.
method Sharp upper and lower bounds derived using conformal techniques and properties of submanifolds.
result Lower bounds on the first eigenvalue for minimal and bounded mean curvature submanifolds.

The paper finds lower bounds for the first eigenvalue of p-Laplacian in specific manifolds.

problem Finding lower bounds for the first eigenvalue of p-Laplacian in Riemannian manifolds.
method Established and enhanced lower bounds for the eigenvalue under specific conditions.
result Provided an estimation for the first Dirichlet eigenvalue in asymptotically hyperbolic Einstein manifolds.

The paper analyzes methods for estimating linear functionals from observational data, proving upper bounds and showing optimal procedures.

problem Estimating linear functionals from observational data in causal inference and bandit literature.
method Two-stage procedures that first estimate treatment effect function, then use it to estimate the linear functional.
result Proves non-asymptotic upper bounds on mean-squared error for two-stage procedures and shows instance-dependent optimality.

Big mapping class groups of infinite type surfaces have infinite asymptotic dimension.

problem Understanding asymptotic dimension of big mapping class groups of infinite type surfaces.
method Analyzing big mapping class groups with coarsely bounded generating sets and essential shifts.
result Big mapping class groups of infinite type surfaces have infinite asymptotic dimension.

Study on error probability for classification of heavy-tailed renewal processes.

problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.

In previous work, the first author and collaborators showed that the leading asymptotics of the embedded contact homology (ECH) spectrum recovers the contact volume. Our main theorem here is a new bound on the sub-leading asymptotics.

2018-11-01abs ↗pdf ↗

The paper proposes methods to estimate MCMC quality with couplings, bounding Wasserstein distance.

problem Improving MCMC efficiency without sacrificing asymptotic consistency.
method Estimators based on couplings of Markov chains to assess quality of asymptotically biased sampling methods.
result Empirical upper bounds of Wasserstein distance for assessing MCMC quality.

Paper relates asymptotic dimension to cofinal dimension using coarse proximities.

problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.

Study fractional perimeter asymptotics on Riemannian manifolds as ss approaches 0.

problem Asymptotics of fractional perimeter on Riemannian manifolds.
method Analysis of fractional Laplacian and existence of bounded harmonic functions.
result Asymptotics of fractional ss-perimeter on all complete manifolds.

The study of special Lagrangian classes and semistable Mukai vectors on K3 surfaces.

problem Counting special Lagrangian classes and semistable Mukai vectors for K3 surfaces.
method Analyzing flat surfaces and K3 surfaces, using asymptotics and stability conditions.
result Exact leading term in the asymptotics of the number of semistable Mukai vectors.

We provide explicit conditions on the distribution of risk-neutral log-returns which yield sharp asymptotic estimates on the implied volatility smile. We allow for a variety of asymptotic regimes, including both small maturity (with arbitrary strike) and extreme strike (with arbitrary bounded maturity), extending previ…

2014-11-06abs ↗pdf ↗

The paper studies reward concentration in MDPs, covering asymptotic and non-asymptotic settings.

problem Reward concentration in Markov Decision Processes (MDPs).
method Unified approach to reward concentration in MDPs, including asymptotic and non-asymptotic bounds.
result Rate-equivalent definitions of regret for learning policies.

Construct locally minimizing (1,2)(1,2)-clusters with prescribed asymptotic geometry.

problem Minimizing clusters with prescribed asymptotic geometry.
method Develop a refined construction using the Hardt-Simon foliation.
result Produce a countably infinite family of distinct locally minimizing clusters asymptotic to a singular area-minimizing hypercone.