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

71141212282 · Jun 202019922001200920172026
48 results for Minimal center

This is the second paper of a series of three on the regularity of higher codimension area minimizing integral currents. Here we perform the second main step in the analysis of the singularities, namely the construction of a center manifold, i.e. an approximate average of the sheets of an almost flat area minimizing cu…

2013-06-05abs ↗pdf ↗

We aim at explaining the most basic ideas underlying two fundamental results in the regularity theory of area minimizing oriented surfaces: De Giorgi's celebrated ε\varepsilon-regularity theorem and Almgren's center manifold. Both theorems will be proved in a very simplified situation, which however allows to illustra…

2018-07-17abs ↗pdf ↗

The main goal of the paper is to solve some problems about shadow for the sphere generalized on the case of the ellipsoid. Here, the essence of the problem is to find the the minimal number of non-overlapping balls with centers on the sphere which are not holding the center of the sphere and such that every line passin…

2015-10-07abs ↗pdf ↗

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple cubic, face centered cubic and body centered cubic lattices are determined. Our r…

2012-03-14abs ↗pdf ↗

This is a survey on symplectic birational geometry. In arbitrary dimension, this subject is centered around the notion of uniruledness. In low dimensions, we will also discuss Kodaira dimension and minimality.

2009-06-17abs ↗pdf ↗

Analyzes branch points of area-minimizing currents with non-2 planar frequency.

problem Understanding the structure of area-minimizing currents near branch points.
method Intrinsic frequency function and geometric arguments avoiding center manifolds.
result Establishes higher order asymptotics and topological control near branch points.

CoCP optimizes prediction intervals by jointly learning center and radius, improving efficiency and coverage.

problem Inefficient conformal prediction intervals under heteroscedasticity and skewness.
method Co-optimization framework that learns center and radius through alternating optimization steps.
result CoCP yields consistently shorter intervals and state-of-the-art conditional coverage diagnostics.

We study knots in S3\mathbb{S}^3 obtained by the intersection of a minimal surface in R4\mathbb{R}^4 with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of non-fibered minimal knots. We show that simple minimal knots are either reversible or …

2007-02-09abs ↗pdf ↗

The paper studies isoperimetric inequalities on warped product manifolds.

problem Investigating isoperimetric inequalities on warped product manifolds.
method Exploiting the interplay between isoperimetric inequalities and warped product structures, deriving necessary and sufficient conditions.
result Established a quantitative lower bound for the first nonzero Dirichlet eigenvalue of geodesic balls centered at the pole.

We consider a projection from the center of the unit sphere to a tangent space of it, the central projection, and study two area minimizing problems of the image of a closed subset in the sphere. One of the problems is the uniqueness of the tangent plane that minimizes the area for an arbitrary fixed subset. The other …

2011-03-24abs ↗pdf ↗

A novel k-means method for MNAR data improves clustering accuracy.

problem Improving k-means clustering for data missing not at random.
method A magnitude-decaying MNAR scenario-based k-means method with size constraints.
result The method reduces bias in estimated cluster centers and improves clustering accuracy.

We prove that, among the polygons in a punctured disc with fixed angles, the perimeter is minimized by the polygon with an inscribed horocycle centered at the puncture. We generalize this to a disc with a cone point and to an annulus with a geodesic boundary component and a complete end. Then we apply this result to de…

2016-09-27abs ↗pdf ↗

Almost perimeter-minimizing boundaries in plentiful groups can be approximated by Lipschitz graphs.

problem Regularity of boundaries in plentiful groups.
method Lipschitz approximation of boundaries.
result Boundary of almost minimizers can be approximated by intrinsic Lipschitz graphs.

A centered innovation MA is equivalent to a digamma-link DARMA for bank-asset shares.

problem Predicting bank-asset shares using Bayesian Dirichlet ARMA models.
method Replacing raw additive log-ratio residuals with centered innovations in B--DARMA.
result Centered specification and digamma-link DARMA are predictively equivalent under specified conditions.

By exploiting the property that the RBM log-likelihood function is the difference of convex functions, we formulate a stochastic variant of the difference of convex functions (DC) programming to minimize the negative log-likelihood. Interestingly, the traditional contrastive divergence algorithm is a special case of th…

2017-09-21abs ↗pdf ↗

Center identified in stated skein algebra for quantum traces.

problem Understanding the center of the stated skein algebra.
method Analyzing the algebra as a generalization of Kauffman bracket skein algebra, focusing on the case when the quantum parameter is a root of unity.
result Simple description and dimension calculation of the center over the center module.

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗pdf ↗

We prove that any manifold diffeomorphic to S3S^3 and endowed with a generic metric contains at least two embedded minimal two-spheres. The existence of at least one minimal two-sphere was obtained by Simon-Smith in 1983. Our approach combines ideas from min-max theory and mean curvature flow. We also establish the exi…

2017-08-22abs ↗pdf ↗

In this study, we analyze the general canal surfaces in terms of the features flat, II-flat minimality and II-minimality, namely we study under which conditions the first and second Gauss and mean curvature vanishes, i.e. K=0, H=0, K_{II}=0 and H_{II} =0. We give a non-existence result for general canal surfaces in E^3…

2011-06-16abs ↗pdf ↗

Refines geometric center of mass analysis for Einstein field equations.

problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.

Optimal noise excitation for linear system identification reduces sample complexity.

problem Efficiently identifying linear systems with minimal data.
method Active learning algorithm using ordinary least squares and semidefinite programming.
result The proposed algorithm matches lower bounds on sample complexity for any active learning method.

Let f:M->M be a partially hyperbolic diffeomorphism such that all of its center leaves are compact. We prove that Sullivan's example of a circle foliation that has arbitrary long leaves cannot be the center foliation of f. This is proved by thorough study of the accessible boundaries of the center-stable and the center…

2011-04-28abs ↗pdf ↗

Graph Polish optimizes molecular structures by minimizing changes and maximizing preservation.

problem Error-prone traditional molecular optimization methods.
method Graph Polish transforms optimization into a polishing task, focusing on optimization centers and minimizing changes.
result Significant advantage over state-of-the-art methods on multiple optimization tasks.

Quadratic memory is essential for optimal convex optimization queries.

problem Optimal query complexity for convex optimization and feasibility problems.
method Lower bounds on query complexity for convex optimization and feasibility problems.
result Center-of-mass algorithms are Pareto-optimal for both convex optimization and feasibility problems.

It is proved that the Heisenberg group Nil3\operatorname*{Nil}\nolimits_{3} with a balanced metric, the sum of the left and right invariant metrics, splits as a Riemannian product T×Z\mathbb{T\times Z}, where T\mathbb{T} is a totally geodesic surface and Z\mathbb{Z} the center of Nil\operatorname*{Nil}% \nolimits_{3}. It…

2019-08-12abs ↗pdf ↗

We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…

2016-03-28abs ↗pdf ↗

A new method predicts electron density accurately from atom-centered models.

problem Predicting electron density accurately from atom-centered models.
method Gradient-based approach to minimize loss function in an optimized sparse feature space.
result Extremely accurate predictions of electron density and total energies.

We prove the existence of a center, or continuous selection of a point, in the relative interior of C1C^1 embedded kk-disks in Riemannian nn-manifolds. If k3k\le 3 the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for k=4=nk=4=n. By contrast, for…

2017-06-25abs ↗pdf ↗

The burgeoning need for kidney transplantation mandates immediate attention. Mismatch of deceased donor-recipient kidney leads to post-transplant death. To ensure ideal kidney donor-recipient match and minimize post-transplant deaths, the paper develops a prediction model that identifies factors that determine the prob…

2018-12-11abs ↗pdf ↗