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

61122182243 · Jun 202019922001200920172026
48 results for core metrics

The study allows for connected sums in manifolds with positive intermediate Ricci curvature.

problem Performing connected sums in manifolds with positive intermediate Ricci curvature.
method Introducing and utilizing kk-core metrics to show the possibility of connected sums.
result Connected sums are possible under certain conditions involving kk-core metrics.

The study preserves positive Ricci curvature on connected sums of fibre bundles.

problem Preserving positive Ricci curvature on connected sums of fibre bundles.
method Lifting core metrics along general fibre bundles and applying to specific spaces.
result All classes in the torsion-free oriented bordism ring can be represented by connected manifolds of positive Ricci curvature.

The Hessian of the renormalized volume of geometrically finite hyperbolic 33-manifolds without rank-11 cusps, computed at the hyperbolic metric gg with totally geodesic boundary of the convex core, is shown to be a strictly positive bilinear form on the tangent space to Teichmüller space. The metric gg is known fro…

2015-03-27abs ↗pdf ↗

We show that in any triangulation of a solid torus, there is a pre-core curve that lies in the 2-skeleton and that intersects the interior of each face in at most 10 straight arcs. By definition, a pre-core curve is a simple closed curve that becomes a core curve when a collar is attached to the boundary of the solid t…

2011-06-15abs ↗pdf ↗

In 3-dimensional hyperbolic geometry, the classical Schlafli formula expresses the variation of the volume of a hyperbolic polyhedron in terms of the length of its edges and of the variation of its dihedral angles. We prove a similar formula for the variation of the volume of the convex core of a geometrically finite h…

1997-04-30abs ↗pdf ↗

We consider the space of all quasifuchsian metrics on the product of a surface with the real line. We show that, in a neighborhood of the submanifold consisting of fuchsian metrics, every non-fuchsian metric is completely determined by the bending data of its convex core.

2002-10-16abs ↗pdf ↗

Using PL-methods, we prove the Marden's conjecture that a hyperbolic 3-manifold MM with finitely generated fundamental group and with no parabolics are topologically tame. Our approach is to form an exhaustion MiM_i of MM and modify the boundary to make them 2-convex. We use the induced path-metric, which makes the s…

2006-02-23abs ↗pdf ↗

We supply a proof of the fact that a hyperbolic 3-manifold MM with finitely generated fundamental group and with no parabolics is topologically tame. This proves the Marden's conjecture. Our approach is to form an exhaustion MiM_i of MM and modify the boundary to make them 2-convex. We use the induced path-metric, wh…

2004-10-18abs ↗pdf ↗

New examples of manifolds in tangent cones of non-collapsed Ricci limit spaces.

problem Uncertainty in homeomorphism types of tangent cones of non-collapsed Ricci limit spaces.
method Construction of limit spaces in all dimensions at least 5.
result Any finite collection of manifolds can appear as cross sections of tangent cones of the same point.

Study convex hyperbolic cone-metrics on 3-manifold boundaries, proving unique bent realizations.

problem Convex hyperbolic cone-metrics on 3-manifold boundaries and their bent realizations.
method Alexandrov-Weyl-type problem, bent metrics, controllably polyhedral, Lipschitz topology.
result Unique bent realizations for convex hyperbolic cone-metrics on 3-manifold boundaries.

We consider quasifuchsian manifolds with "particles", i.e., cone singularities of fixed angle less than ππ going from one connected component of the boundary at infinity to the other. Each connected component of the boundary at infinity is then endowed with a conformal structure marked by the endpoints of the particle…

2009-09-23abs ↗pdf ↗

The first part of this paper discusses general procedures for finding numerical approximations to distinguished Kahler metrics, such as Calabi-Yau metrics, on complex projective manifolds. These procedures are closely related to ideas from Geometric Invariant Theory, and to the asymptotics of high powers of positive li…

2005-12-28abs ↗pdf ↗

Quasifuchsian hyperbolic manifolds, or more generally convex co-compact hyperbolic manifolds, have infinite volume, but they have a well-defined ``renormalized'' volume. We outline some relations between this renormalized volume and the volume, or more precisely the ``dual volume'', of the convex core. On one hand, the…

2019-03-23abs ↗pdf ↗

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

problem Understanding and characterizing transitive double Lie algebroids.
method Using core diagrams and equivalence of transitive core diagrams with transitive double Lie groupoids.
result Transitive double Lie algebroids are completely determined by their core diagrams.

We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…

2018-10-23abs ↗pdf ↗

In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes. This results in a network dataset containing the core nodes along with a potentially much larger set of fringe nodes that all have at least one interaction with a core node. In many settings, t…

2019-05-14abs ↗pdf ↗

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

We introduce the notion of the visual core of a hyperbolic 3-manifold N and explore its basic properties. The visual core can be thought of as a harmonic analysis analogue of the convex core. We investigate circumstances in which the visual core of a cover N' of N embeds under the covering map from N' to N. We apply th…

1999-03-12abs ↗pdf ↗

Paper introduces a core-periphery model for identifying informative network structures.

problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.

Estimates covariance matrices for matrix-variate data via core covariance geometry.

problem Estimating covariance matrices for matrix-variate data with partial isotropy.
method Fixed-rank core covariance geometry, partial-isotropy rank-r core shrinkage estimator.
result The geometry of the space of rank-r cores is a smooth manifold.

By means of an analogy with Classical Mechanics and Geometrical Optics, we are able to reduce Lagrangians to a kinetic term only. This form enables us to examine the extended solution set of field theories by finding the geodesics of this kinetic term's metric. This new geometrical standpoint sheds light on some founda…

2006-09-26abs ↗pdf ↗

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

Gradient-based meta-learning has proven to be highly effective at learning model initializations, representations, and update rules that allow fast adaptation from a few samples. The core idea behind these approaches is to use fast adaptation and generalization -- two second-order metrics -- as training signals on a me…

2019-10-03abs ↗pdf ↗

The abstract proves spherical surface decompositions with conical singularities.

problem Decomposing surfaces with spherical metrics and conical singularities.
method Geometric triangulations and irreducible components of standard shapes.
result Spherical polygons, including half-spherical concave polygons, can be arbitrarily complicated.

Estimates metric tensor on neuromanifolds using Fisher information and random methods.

problem Computing the metric tensor on high-dimensional neuromanifolds efficiently and accurately.
method Deterministic bounds and unbiased random estimators based on Hutchinson's trace method.
result An efficient random estimator with bounded standard deviation.

The term "CoRE kernel" stands for correlation-resemblance kernel. In many applications (e.g., vision), the data are often high-dimensional, sparse, and non-binary. We propose two types of (nonlinear) CoRE kernels for non-binary sparse data and demonstrate the effectiveness of the new kernels through a classification ex…

2014-04-24abs ↗pdf ↗

Similarity metrics are a core component of many information retrieval and machine learning systems. In this work we propose a method capable of learning a similarity metric from data equipped with a binary relation. By considering only the similarity constraints, and initially ignoring the features, we are able to lear…

2015-11-19abs ↗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 ↗

New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.

problem Understanding and detecting core-periphery structures in graphs with community structure.
method Introduces relative centrality to detect cores in graphs with community and core-periphery structures.
result Relative centrality solves bias issues in core detection, leading to better vertex selection and improved clustering performance.

Deep learning predicts nuclear equation of state from rotating core collapse GW signals.

problem Classifying the nuclear equation of state from rotating core collapse gravitational wave signals.
method Employed deep convolutional neural networks to classify visual and temporal patterns in GW signals.
result Up to 97% correct classifications of nuclear equation of state in the test set.

This study examines cores within superclusters, highlighting their transitional nature and dynamical state.

problem Understanding the morphology and dynamical properties of cores within superclusters.
method Projected and radial velocity distributions of galaxies, morphological analysis, entropy and mass estimates.
result Cores are transitional structures that evolve towards virialisation but remain gravitationally bound.