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

68135203270 · Jun 202019922001200920172026
48 results for random cut-points

We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.

2009-05-15abs ↗pdf ↗

The study identifies conjugate and cut points in ideal fluid motion configurations.

problem Understanding stability and re-convergence of fluid configurations.
method Existence and non-existence of conjugate points in specific fluid configurations, using geometric and physical analysis.
result Existence of conjugate points in Kolmogorov flows and non-existence in Arnold steady states.

Groups with semistable peripheral subgroups are semistable.

problem Semistability of fundamental groups in relatively hyperbolic groups.
method Generalization of semistability from 1-ended subgroups to finitely generated subgroups with semistable fundamental groups.
result Semistability of fundamental groups in more general relatively hyperbolic groups.

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique asymptotic cones. Modulo the Continuum Hypothesis, we show that if an asymptotic c…

2010-10-18abs ↗pdf ↗

ABM automates feature engineering and variable selection for loss-based models.

problem Improving model performance through better feature engineering and variable selection.
method ABM uses group and fused lasso regularization to automatically select cutting points and variables.
result ABM integrates feature engineering, variable selection, and model training.

We prove that ideal boundary of a 7-systolic group is strongly hereditarily aspherical. For some class of 7-systolic groups we show their boundaries are connected and without local cut points, thus getting some results concerning splittings of those groups.

2007-11-26abs ↗pdf ↗

In this paper we show that the existence of a non-parabolic local cut point in the Bowditch boundary (G,P)\partial(G,\mathbb{P}) of a relatively hyperbolic group (G,P)(G,\mathbb{P}) implies that GG splits over a 22-ended subgroup. This theorem generalizes a theorem of Bowditch from the setting of hyperbolic groups to relat…

2017-08-09abs ↗pdf ↗

In this paper we prove that if a point pp in a complete Riemannian manifold is not a cut point of any point whose distance to pp is rr, then the injectivity radius of pp is strictly large than rr. As a corollary we give a positive answer to a problem raised by Z. Sun and J. Wan.

2015-01-30abs ↗pdf ↗

FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.

problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.

We study the bilipschitz equivalence type of tree-graded spaces, showing that asymptotic cones of relatively hyperbolic groups (resp. asymptotic cones of groups containing a cut-point) only depend on the bilipschitz equivalence types of the pieces in the standard (resp. minimal) tree-graded structure. In particular, th…

2012-04-03abs ↗pdf ↗

We give a group theoretic characterization of geodesics with superlinear divergence in the Cayley graph of a right-angled Artin group A(G) with connected defining graph G. We use this to determine when two points in an asymptotic cone of A(G) are separated by a cut-point. As an application, we show that if G does not d…

2010-01-20abs ↗pdf ↗

A method is given for calculating the strict minimum message length (SMML) estimator for 1-dimensional exponential families with continuous sufficient statistics. A set of nn equations are found that the nn cut-points of the SMML estimator must satisfy. These equations can be solved using Newton's method and this app…

2012-12-20abs ↗pdf ↗

Proves convergence groups on a 2-sphere are Kleinian groups.

problem Proving convergence groups on a 2-sphere are Kleinian groups.
method Analyzing relatively hyperbolic groups with planar boundaries and applying to various versions of the Cannon conjecture.
result Proves relatively hyperbolic groups with planar boundaries are virtually Kleinian.

These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian and semi-Riemannian structures on manifolds. Affine connections, geodesics, tors…

2013-03-20abs ↗pdf ↗

Under the definition of Ricci curvature bounded below for Alexandrov spaces introduced by Zhang-Zhu, we generalize a result by Colding that an n dimentional manifold with Ricci curvature greater or equal to n minus 1 and volume close to that of the unit n sphere is close (in the Gromov-Hausdorff distance) to the sphere…

2015-03-03abs ↗pdf ↗

Let G be a one-ended group acting discretely and co-compactly on a CAT(0) space X. We show that the boundary of X has no cut points and that one can detect splittings of GG over two-ended groups and recover its JSJ decomposition from the boundary. We show that any discrete action of a group G on a CAT(0) space X satis…

2007-01-22abs ↗pdf ↗

In this paper we provide a classification theorem for 1-dimensional boundaries of groups with isolated flats. Given a group ΓΓ acting geometrically on a CAT(0)CAT(0) space XX with isolated flats and 1-dimensional boundary, we show that if ΓΓ does not split over a virtually cyclic subgroup, then X\partial X is homeomorp…

2017-04-26abs ↗pdf ↗

We call a finitely generated group lacunary hyperbolic if one of its asymptotic cones is an R-tree. We characterize lacunary hyperbolic groups as direct limits of Gromov hyperbolic groups satisfying certain restrictions on the hyperbolicity constants and injectivity radii. Using central extensions of lacunary hyperboli…

2007-01-15abs ↗pdf ↗

Given a Lorentzian manifold, the light ray transform of a function is its integrals along null geodesics. This paper is concerned with the injectivity of the light ray transform on functions and tensors, up to the natural gauge for the problem. First, we study the injectivity of the light ray transform of a scalar func…

2019-11-12abs ↗pdf ↗

Study examines how discretization affects anomaly detection in datasets.

problem Detecting six types of anomalies in datasets using different discretization methods.
method Conducted experiments with SECODA, a general-purpose algorithm for unsupervised anomaly detection.
result Different discretization methods favor the discovery of certain anomaly types.

Study on focal locus of submanifolds in Finsler manifolds, showing regularity and smoothness.

problem Investigating the focal locus of submanifolds in Finsler manifolds.
method Using the normal exponential map and extending Warner's ideas, studying connected components and smoothness of focal time maps.
result Identified an open and dense subset where focal time maps are smooth, provided they are finite.

Recent results on the maximization of the charged-particle action I in a globally hyperbolic spacetime are discussed and generalized. We focus on the maximization of I over a given causal homotopy class C of curves connecting two causally related events x_0 <= x_1. Action I is proved to admit a maximum on C, and also o…

2005-05-05abs ↗pdf ↗

In this note, we study the cut locus of the free, step two Carnot groups Gk\mathbb{G}_k with kk generators, equipped with their left-invariant Carnot-Carathéodory metric. In particular, we disprove the conjectures on the shape of the cut loci proposed in [Myasnichenko - 2002] and [Montanari, Morbidelli - 2016], by exh…

2016-10-05abs ↗pdf ↗

Divergence functions of a metric space estimate the length of a path connecting two points AA, BB at distance n\le n avoiding a large enough ball around a third point CC. We characterize groups with non-linear divergence functions as groups having cut-points in their asymptotic cones. By Olshanskii-Osin-Sapir, that…

2008-01-27abs ↗pdf ↗

This paper surveys various methods for dimensionality reduction and nearest neighbor search.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving essential information.
method Linear and nonlinear random projections, including sparse random projections, random Fourier Features, and Random Kitchen Sinks.
result Various methods for dimensionality reduction and nearest neighbor search are explained and compared.

The paper studies how norms of random vectors are preserved by random projections.

problem Understanding how random matrix affects norms of random vectors.
method Proved the distribution of the norm of random vector is preserved by random projection.
result Random matrix preserves the distribution of the norm of random vectors with i.i.d. entries.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

New methods improve prediction performance and reduce computation time in boosting and random forest models.

problem Improving prediction performance and reducing computation time in boosting and random forest models.
method Random tree depth injection approach for Boosting and Random Forests.
result The new methods can improve prediction performance and reduce computation time by up to 40%.