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

Trend · papers per month

4794140187 · Jun 202019922001200920182026
48 results for convexity radius

The paper establishes estimates for convexity and injectivity radii in Riemannian manifolds.

problem Estimating convexity and injectivity radii in Riemannian manifolds.
method Pointwise and curvature-free estimates on convexity radius, injectivity radius, and local behavior of geodesics.
result Established estimates for convexity and injectivity radii in Riemannian manifolds.

The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with focal points but no conjugate points. The approach is suggested by a characteriz…

2014-12-01abs ↗pdf ↗

The paper proves an area inequality for metric balls in Riemannian manifolds.

problem Proving an area inequality for metric balls in Riemannian manifolds.
method Analyzing metric balls B(p,R)B(p,R) in two-dimensional Riemannian manifolds.
result Proves an area inequality Area(B(p,R))8πR2Area(B(p,R)) \geq \frac{8}πR^2 for RR less than half the convexity radius.

Sharp upper bounds on inscribed radius for metric spaces with convex boundary.

problem Bounding inscribed radius in metric measure spaces with convex boundary.
method Proves sharp upper bounds on inscribed radius for subsets with convex boundary.
result Sharp upper bounds on inscribed radius for subsets with convex boundary.

The paper proves bounds on curvature and injectivity radius for convex sums of Riemannian metrics.

problem Understanding the geometry of convex sums of Riemannian metrics.
method Quantitative inverse function theorem and Riemannian geometry techniques.
result Injectivity radii of convex sums have uniform lower bounds.

The paper bounds bandwidth and focal radius for manifolds with positive isotropic curvature.

problem Bounding bandwidth and focal radius for manifolds with positive isotropic curvature.
method Using spectral properties of a twisted de Rham-Hodge operator.
result Upper bounds on bandwidth and focal radius are derived for hypersurfaces in PIC manifolds.

A version of a conjecture of McMullen is as follows: Given a hyperbolizable 3-manifold M with incompressible boundary, there exists a uniform constant K such that if N is a hyperbolic 3-manifold homeomorphic to the interior of M, then the injectivity radius based at points in the convex core of N is bounded above by K.…

1999-07-08abs ↗pdf ↗

A version of a conjecture of McMullen is as follows: Given a hyperbolizable 3-manifold M with incompressible boundary, there exists a uniform constant K such that if N is a hyperbolic 3-manifold homeomorphic to the interior of M, then the injectivity radius based at points in the convex core of N is bounded above by K.…

1999-07-09abs ↗pdf ↗

Through using the semidiameter (in connection to: the mean radius and surface radius) of a convex closed hypersurface in Rn2\mathbb R^{n\ge 2} as an sharp upper bound of the variational (1,n)p(1,n)\ni p-capacity radius, this paper settles a restriction/variant of S.-T. Yau's \cite[Problem 59]{Yau} from the surface area to t…

2013-02-20abs ↗pdf ↗

Paper introduces robust market making using Wasserstein distance and entropy regularization.

problem Market making robustness under uncertainty.
method Wasserstein distance, entropy regularization, convex optimization, optimal radius selection.
result The robust market making problem can be reformulated as a convex optimization problem.

Polynomial-time algorithm learns latent-state systems without spectral radius assumptions.

problem Learning latent-state linear dynamical systems without spectral radius assumptions.
method Spectral filtering technique with a novel convex relaxation.
result Efficient identification of phases for general transition matrices.

This paper explores rigid properties of Alexandrov spaces with maximal radius.

problem Rigidity of Alexandrov spaces with maximal radius and specific curvature conditions.
method Analyzes Alexandrov spaces with \curv\geq1, nonempty boundary, and maximal radius \fracπ{2}. Uses rigidity theorems and geometric/topological constraints.
result Shows flexibility and rigidity in Alexandrov spaces with maximal radius under different conditions.

In this paper, we mainly establish a Cheeger type finiteness theorem for Berwald manifolds. In order to do this, we study the injectivity radius and the convex radius of a Finsler manifold. A Cheeger type estimate on injectivity radii for Finsler manifolds is given and the existence of the center of mass of a Berwald m…

2015-04-20abs ↗pdf ↗

We consider a family of embedded, mean convex hypersurfaces which evolve by the mean curvature flow. It follows from general results of White that the inscribed radius at each point on the surface is at least cH\frac{c}{H}, where cc is a constant that depends only on the initial data. Andrews recently gave a new proof…

2013-09-05abs ↗pdf ↗

We obtain upper and lower bounds on the difference between the renormalized volume and the volume of the convex core of a convex cocompact hyperbolic 3-manifold which depend on the injectivity radius of the boundary of the universal cover of the convex core and the Euler characteristic of the boundary of the convex cor…

2015-02-17abs ↗pdf ↗

The paper establishes lower bounds on injectivity radius and constructs metrics with bounded geometry.

problem Establishing lower bounds on the normal injectivity radius of hypersurfaces and constructing metrics with bounded geometry on manifolds with boundary.
method Pointwise lower estimates and constructions of metrics with bounded geometry.
result The construction of metrics with bounded geometry on arbitrary manifolds with boundary.

Paper optimizes hyperparameters for high-dimensional regression models.

problem Optimizing robustness radius in high-dimensional linear regression.
method Distributionally robust optimization (DRO) with high-dimensional asymptotic statistics.
result Optimal hyperparameter selection minimizes estimation error efficiently.

The paper studies area-preserving and length-preserving inverse curvature flow for planar curves with singularities.

problem Investigating the evolution of planar curves with singularities under area-preserving and length-preserving inverse curvature flow.
method Area-preserving and length-preserving inverse curvature flow for \ell-convex Legendre curves.
result The flow results in a circle for \ell-convex Legendre curves, providing geometric inequalities.

New algorithm reduces regret in stochastic bandit convex optimization.

problem Optimizing decisions in uncertain environments with convex losses.
method Introduces a second-order method for zeroth-order stochastic convex bandits.
result Regret bound of (1+r/d)[d1.5n+d3]polylog(n,d,r)(1 + r/d)[d^{1.5} \sqrt{n} + d^3] polylog(n, d, r).

Sharp inequalities on Riemannian manifolds for domain areas and volumes.

problem Finding sharp isoperimetric inequalities for domains on Riemannian manifolds.
method Generalized convexity, cut distance, mean curvature, extrinsic radius, Hausdorff measure.
result Geodesic balls maximize area-to-volume ratios under certain curvature conditions.

BMM algorithm improves convergence for nonconvex optimization problems.

problem Constrained nonsmooth nonconvex optimization problems.
method Block majorization-minimization with diminishing radius.
result Improved convergence rate for nonconvex optimization problems.

Study on spherical bodies of constant width on the unit sphere, proving bounds on their relative effective radius.

problem Understanding the smallest spherical bodies of constant width on the unit sphere.
method Analyzing spherical bodies of constant width on the unit sphere, constructing examples and applying geometric arguments.
result Proved non-trivial bounds on the relative effective radius of spherical bodies of constant width.

We present a novel, log-radius profile representation for convex curves and define a new operation for combining the shape features of curves. Unlike the standard, angle profile-based methods, this operation accurately combines the shape features in a visually intuitive manner. This method have implications in shape an…

2015-06-24abs ↗pdf ↗

Convex hypersurfaces evolve to spheres under a specific flow.

problem Volume preserving nonhomogeneous mean curvature flow of convex hypersurfaces.
method Monotonicity of isoperimetric ratio, inner and outer radius control, maximum principle arguments.
result Closed convex hypersurfaces converge to round spheres.

We consider a family of embedded, mean convex hypersurfaces in a Riemannian manifold which evolve by the mean curvature flow. We show that, given any number T>0T>0 and any δ>0δ>0, we can find a constant C0C_0 with the following property: if t[0,T)t \in [0,T) and pp is a point on MtM_t where the curvature is greater than $C_…

2013-10-13abs ↗pdf ↗

In a Riemannian manifold a regular convex domain is said to be λλ-convex if its normal curvature at each point is greater than or equal to λλ. In a Hadamard manifold, the asymptotic behaviour of the quotient $\vol(Ω(t))/\vol(\partialΩ(t))$ for a family of λλ-convex domains Ω(t)Ω(t) expanding over the whole space has b…

2010-03-24abs ↗pdf ↗

Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect, then there exists a conformally natural quasiconformal map which admits a bounde…

2011-10-10abs ↗pdf ↗

The paper studies how certain spacelike surfaces evolve over time in a specific space.

problem Evolution of spacelike graphic hypersurfaces in Lorentz-Minkowski space.
method Inverse mean curvature flow with vanishing Neumann boundary condition.
result The evolving surfaces converge to a hyperbolic plane as time goes to infinity.

Polyak step size GD reaches final radius of convergence after log iterations.

problem Statistical and computational complexities of Polyak step size GD.
method Generalized smoothness and Lojasiewicz conditions, stability of gradients.
result Polyak step size GD reaches final statistical radius of convergence after logarithmic number of iterations.

Study bounds changes in hyperbolic 3-manifold structures after drilling short geodesics.

problem Bounding changes in complex projective structures after drilling short geodesics.
method Analyzes L2L^2-bounds on changes in conformally compact hyperbolic 3-manifolds.
result Change is bounded by a universal constant times the square root of the length of the drilled geodesics.

We accelerate min-max optimization and apply it to minimal bounding sphere problems.

problem Min-max optimization and minimal bounding sphere problems.
method Smoothing the max operator and applying it to the minimal bounding sphere problem.
result Achieve (1+ε)(1+\varepsilon)-approximation of minimal bounding sphere in ildeO(nd/ε) ilde{O}(n d /\sqrt{\varepsilon}) time.

Let B be a thick spherical building equipped with its natural CAT(1) metric and let M be a proper, convex subset of B. If M is open or if M is a closed ball of radius pi/2, then the maximal subcomplex supported by the complement of M is spherical and non contractible.

2010-07-14abs ↗pdf ↗