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

Trend · papers per month

3773110146 · Jun 202019922001200920182026
48 results for boundary trees

Improved efficient learning of neighbor representations for large datasets.

problem Efficiently learn neighbor representations for large datasets.
method Differentiable Boundary Sets algorithm that overcomes computational issues and improves accuracy.
result Significant reduction in training time and improved classification accuracy.

We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the …

2012-11-07abs ↗pdf ↗

Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using…

2015-04-14abs ↗pdf ↗

A bijection proves a polynomial volume for genus-0 hyperbolic surfaces with boundaries.

problem Proving the Weil-Petersson volume polynomial in boundary lengths for genus-0 surfaces.
method Generalizing a tree bijection to handle geodesic boundaries, extending spine construction.
result Explicit formula for three-point function in Weil-Petersson random surfaces.

We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of Poisson boundaries by means of a topological compactification as developed by Kaiman…

2009-11-03abs ↗pdf ↗

We show that trees of manifolds, the topological spaces introduced by Jakobsche, appear as boundaries at infinity of various spaces and groups. In particular, they appear as Gromov boundaries of some hyperbolic groups, of arbitrary dimension, obtained by the procedure of strict hyperbolization. We also recognize these …

2013-04-18abs ↗pdf ↗

This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to trees, as developed by Coulbois, Hilion, Lustig and Reynolds, to the context of…

2017-09-17abs ↗pdf ↗

Two trees in the boundary of outer space are said to be \emph{primitive-equivalent} whenever their translation length functions are equal in restriction to the set of primitive elements of FNF_N. We give an explicit description of this equivalence relation, showing in particular that it is nontrivial. This question is …

2014-05-19abs ↗pdf ↗

A behavior of extreme networks under deformations of their boundary sets is investigated. It is shown that analyticity of a deformation of boundary set guarantees preservation of the networks types for minimal spanning trees, minimal fillings and so-called stable shortest trees in the Euclidean space.

2015-06-23abs ↗pdf ↗

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

2010-07-04abs ↗pdf ↗

The paper develops a theory for free boundary minimal surfaces with genus at least one.

problem Finding minimal surfaces with specific genus and boundary conditions.
method Using sweepouts of surfaces of genus g≥1 and m≥1 ideal boundary components, the paper constructs a min-max theory for free boundary minimal surfaces.
result The width for the area functional can be achieved by a bubble tree limit of branched genus g free boundary minimal surfaces with nodes.

Various structural properties are developed for non-orientable surfaces in link spaces. The Möbius band tree is described to represent genus growth of one-sided surfaces in solid tori. The structure of the Tree allows various insights into the change of genus under boundary slope, which are not possible using the exist…

2011-01-13abs ↗pdf ↗

In [9] Kaimanovich introduced the concept of augmented tree on the symbolic space of a self-similar set. It is hyperbolic in the sense of Gromov, and it was shown in [13] that under the open set condition, a self-similar set can be identified with the hyperbolic boundary of the tree. In the paper, we investigate in det…

2012-05-16abs ↗pdf ↗

This paper contains a construction of a finite set X in the boundary of the unit 3-ball in R^3 whose minimal tree is knotted. The example answers Problem 5.17 in ''Problems in Low-dimensional Topology'' by Rob Kirby posed by Michael Freedman: ''Given a finite set of points X in the boundary of B^3, let T be a tree in B…

1998-06-15abs ↗pdf ↗

The paper explores uniform perfectness and centers in Morse boundaries.

problem Detecting κκ-center exhaustivity in uniformly perfect Morse boundaries.
method Analyzes CAT(0) and geodesic spaces, using visual boundary data and metric transforms.
result Fixed-basepoint uniform perfectness is insufficient for κκ-center exhaustivity.

Proposes a method to speed up model selection for classification.

problem Time-consuming model selection process and lack of dataset-specific insights.
method Relaxes decision boundaries of neural decision trees to find equivalent or better models.
result Reduces the scope of exploration needed for model selection.

The paper describes a stratification of a compactified Hurwitz space using combinatorial trees.

problem Describing the boundary stratification of a compactified Hurwitz space.
method Using decorated trees to describe the boundary strata and their containment relations.
result The boundary strata of the compactified Hurwitz space are in bijection with decorated trees, and containment is given by edge contraction.

The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface X(f)X(f). As ff diverges in the moduli space of polynomials, the surface X(f)X(f) collapses along its foliation to yield a metrized simplicial t…

2006-08-30abs ↗pdf ↗

The paper studies actions on Bass-Serre trees and identifies new CC^*-simple groups.

problem Investigating actions of fundamental groups on Bass-Serre trees and their CC^*-algebraic properties.
method Analyzing boundary actions of fundamental groups of graphs of groups on their Bass-Serre trees.
result Identification of new families of CC^*-simple groups, including tubular groups and certain graphs of groups.

The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…

2014-10-22abs ↗pdf ↗

We study very small trees from the point of view of reducing systems of free factors, which are analogues of reducing systems of curves for a surface lamination; a non-trivial, proper free factor $F \leq \FN$ reduces TT if and only if FF acts on some subtree of TT with dense orbits. We characterize those trees, call…

2012-11-14abs ↗pdf ↗

Study the boundary of Riemann surfaces with abelian automorphisms.

problem Characterize the boundary of Riemann surfaces with abelian automorphisms.
method Analyze the moduli space and its Deligne-Mumford compactification, focusing on equisymmetric loci.
result Describe the topological strata at the boundary for hyperelliptic and cyclic pp-gonal actions.

SBAMDT uses adaptive soft splits to model complex decision boundaries.

problem Limited ability of standard decision trees to capture complex decision boundaries.
method Probabilistic additive decision tree model with adaptive soft multivariate splits.
result Demonstrated improved predictive performance on synthetic and real datasets.

We extend the techniques of [CH] to build an inductive procedure for studying actions in the boundary of the Culler-Vogtmann Outer Space, the main novelty being an adaptation of he classical Rauzy-Veech induction for studying actions of surface type. As an application, we prove that a tree in the boundary of Outer spac…

2011-10-16abs ↗pdf ↗

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which characterizes the branching of the space. We also show that, when the ultrametric spac…

2010-02-05abs ↗pdf ↗

We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result for inclusion of vertex (or edge) subgroups in finite graphs of (strongly) relativ…

2007-08-27abs ↗pdf ↗

We describe, under some additional technical assumptions, the Gromov boundary of the free product of several GiG_i's amalgamated wrt. HH, where GiG_i are hyperbolic groups with boundary homeomorphic to a densely punctured nn-sphere, and HH is their common subgroup corresponding to a peripheral sphere in each of the …

2016-01-31abs ↗pdf ↗

We give a description of the boundary of a complex of free factors that is analogous to E. Klarreich's description of the boundary of a curve complex. The argument uses the geometry of folding paths developed by Bestvina and Feighn as well as structural results about very small trees developed by Coulbois, Hilion, Lust…

2012-11-15abs ↗pdf ↗

Study shows saddle connection graph's geometry and quasi-isometry properties.

problem Characterize the geometry and quasi-isometry of saddle connection graphs.
method Proved 4-hyperbolicity and uniform quasi-isometry to a tree, used generalised unicorn paths.
result Saddle connection graph is not quasi-isometrically rigid and its boundary is straight foliations.