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

11233445 · Jun 202019922001200920172026
48 results for cores

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.

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.

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.

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 ↗

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.

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.

Study signatures of torus links and their cores using Neumann's equivariant signatures and Hirzebruch's formula.

problem Computing signatures of torus links and their cores.
method Use Neumann's equivariant signatures and rewrite Hirzebruch's formula for torus links (without cores) in terms of integral points in a parallelogram.
result Rewritten Hirzebruch's formula for torus links with cores using integral points in a parallelogram.

Core groups are link invariants defined by arc or region presentations.

problem Defining link invariants using different presentations of arcs and regions.
method Introducing core groups as link invariants defined by presentations involving arcs or regions, and extending these to virtual link diagrams.
result Properties of core groups and their extensions to virtual link diagrams are discussed.

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 ↗

The study shows portfolios based on core-periphery stock structure outperform traditional strategies.

problem Optimizing stock portfolios using mesoscale structures.
method Constructing portfolios based on the core-periphery profile of stocks from Pearson correlations.
result Portfolios based on the core-periphery profile of stocks outperform traditional strategies.

The main result is that an s-cobordism (topological or smooth) of 4-manifolds has a product structure outside a ``core'' sub s-cobordism. These cores are arranged to have quite a bit of structure, for example they are smooth and abstractly (forgetting boundary structure) diffeomorphic to a standard neighborhood of a 1-…

2004-03-31abs ↗pdf ↗

Totally geodesic submanifolds in convex cores are properly immersed and have finite volume.

problem Characterizing totally geodesic submanifolds in geometrically finite manifolds.
method Analysis of totally geodesic submanifolds in the convex core of geometrically finite rank-one locally symmetric manifolds.
result Every maximal totally geodesic submanifold of dimension at least two in the convex core is properly immersed and has finite volume, and only finitely many such submanifolds can occur.

Word2vec is a widely used algorithm for extracting low-dimensional vector representations of words. State-of-the-art algorithms including those by Mikolov et al. have been parallelized for multi-core CPU architectures, but are based on vector-vector operations with "Hogwild" updates that are memory-bandwidth intensive …

2016-11-18abs ↗pdf ↗

A typical way in which network data is recorded is to measure all the interactions among a specified set of core nodes; this produces a graph containing this core together with a potentially larger set of fringe nodes that have links to the core. Interactions between pairs of nodes in the fringe, however, are not recor…

2018-05-03abs ↗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 ↗

The study identifies core and satellite segments in the cryptocurrency market.

problem Identifying similar cryptocurrencies for strategic asset allocation.
method Segmentation of the cryptocurrency market using image / pattern recognition methods.
result Core and satellite segments identified in the cryptocurrency market.

Study shows infimum of dual volume equals convex core volume for hyperbolic 3-manifolds.

problem Infimum of dual volume of convex co-compact hyperbolic 3-manifolds.
method Varying geometry by quasi-isometric deformations to deduce infimum.
result Linear lower bound on quasi-Fuchsian manifold volume based on bending lamination length.

KCoreMotif clusters large networks efficiently by exploiting k-core decomposition and motifs.

problem Efficiently clustering large networks for trust evaluation.
method Exploits k-core decomposition and motifs to perform motif-based spectral clustering on k-core subgraphs.
result The proposed algorithm is accurate and efficient for large networks.

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.

This paper investigates the relationship between the topology of hyperbolizable 3-manifolds M with incompressible boundary and the volume of hyperbolic convex cores homotopy equivalent to M. Specifically, it proves a conjecture of Bonahon stating that the volume of a convex core is at least half the simplicial volume o…

2004-09-17abs ↗pdf ↗

Core-Halo solves large-scale fixed-point problems by decentralizing updates.

problem Large-scale fixed-point equations with block dependencies.
method Core-Halo decomposition separates write ownership from read-only context, aligning with block-dependence structure.
result Core-Halo achieves near-centralized performance while retaining parallelism.

Paper constructs geometric transitions between hyperbolic and Anti-de Sitter geometries.

problem Transitioning between hyperbolic and Anti-de Sitter geometries.
method Construction via Half-pipe geometry on ΣimesS1Σ imes\mathbb{S}^1 with cone singularities.
result Deformation of convex core structure as bending laminations collapse.

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 ↗

This paper proposes the use of wavelet methods to estimate U.S. core inflation. It explains wavelet methods and suggests they are ideally suited to this task. Comparisons are made with traditional CPI-based and regression-based measures for their performance in following trend inflation and predicting future inflation.…

2011-03-29abs ↗pdf ↗

Plastikstufes and overtwistedness for higher-dimensional contact manifolds are studied in this paper. It is proved that a contact structure is overtwisted if and only if there exists a small plastikstufe with toric core that has trivial rotation.

2016-09-03abs ↗pdf ↗