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

20405979 · Jun 202019922001200920172026
48 results for Steiner tree

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

problem Finding the shortest tour in a symmetric TSP.
method Structural equivalence between symmetric TSP and constrained Group Steiner Tree Problem.
result Maximizing net weight in the cGSTP is equivalent to minimizing the TSP tour length.

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

problem Optimal model structure reconstruction from weighted colored graph adjacency matrix.
method Uses prize-collecting Steiner tree algorithm to reconstruct minimum spanning tree.
result Demonstrates the effectiveness of the prize-collecting Steiner tree algorithm for model structure reconstruction.

In this paper, a new approach of defining Steiner symmetrization of coercive convex functions is proposed and some fundamental properties of the new Steiner symmetrization are proved. Further, using the new Steiner symmetrization, we give a different approach to prove a functional version of the Blaschke-Santalo inequa…

2014-03-03abs ↗pdf ↗

We prove an analogue of the classical Steiner formula for the LpL_p affine surface area of a Minkowski outer parallel body for any real parameters pp. We show that the classical Steiner formula and the Steiner formula of Lutwak's dual Brunn Minkowski theory are special cases of this new Steiner formula. This new Stein…

2018-11-17abs ↗pdf ↗

A Steiner type formula for continuous translation invariant Minkowski valuations is established. In combination with a recent result on the symmetry of rigid motion invariant homogeneous bivaluations, this new Steiner type formula is used to obtain a family of Brunn-Minkowski type inequalities for rigid motion intertwi…

2012-07-31abs ↗pdf ↗

A Steiner chain of length k consists of k circles, tangent to two given non-intersecting circles (the parent circles) and tangent to each other in a cyclic pattern. The Steiner porism states that once a chain of k circles exists, there exists a 1-parameter family of such chains with the same parent circles that can be …

2018-11-20abs ↗pdf ↗

Proves Steiner and tube formulae for 3D contact sub-Riemannian surfaces.

problem Calculating surface properties in complex geometric structures.
method Develops a local Steiner formula for regular surfaces in 3D contact sub-Riemannian manifolds.
result Establishes a formula for surface expansion in arbitrary regions of contact sub-Riemannian manifolds.

We prove the existence of self-similar expanding solutions of the curvature flow on planar networks where the initial configuration is any number of half-lines meeting at the origin. This generalizes recent work by Schnürer and Schulze which treats the case of three half-lines. There are multiple solutions, and these a…

2007-04-24abs ↗pdf ↗

We consider the existence problem for `Steiner networks' (trivalent graphs with 120 degree angles at each junction) in strictly convex domains, with `Neumann' boundary conditions (orthogonal intersection with the domain boundary.) For each of the three possible combinatorial possibilities, sufficient conditions on the …

2008-06-03abs ↗pdf ↗

The paper extends Busemann's inequalities to complex and quaternionic spaces.

problem Extending Busemann's inequalities to complex and quaternionic vector spaces.
method Proof leverages a monotonicity property under symmetrization with respect to complex or quaternionic hyperplanes.
result Standard Steiner symmetrization does not exhibit the monotonicity property in complex or quaternionic spaces.

Given a simple closed plane curve ΓΓ of length LL enclosing a compact convex set KK of area FF, Hurwitz found an upper bound for the isoperimetric deficit, namely L24πFπFeL^2-4πF\leq π|F_{e}|, where FeF_{e} is the algebraic area enclosed by the evolute of ΓΓ. In this note we improve this inequality finding strictly posi…

2017-04-04abs ↗pdf ↗

We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called srs network with quotient the complete graph on four vertices K4K_4. The network…

2017-05-06abs ↗pdf ↗

We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth until the lengths of the three curves stay far from zero. If this is the case for all times, then the evolution exists…

2013-01-15abs ↗pdf ↗

Paper studies weighted Fermat-Frechet problem for simplex edge lengths.

problem Finding optimal edge lengths for simplex deformations.
method Isometric embedding techniques for KK-Space.
result New variational method to solve weighted Fermat-Frechet problem.

The paper studies stability of discrete planar curves using variational methods.

problem Stability of discrete planar curves under area constraints.
method Unified interpretation of discrete curvatures, determination of equilibrium curves, stability analysis.
result Equilibrium curves for the length functional under area-constraint conditions are determined and their stability is studied.

We study circle packings with the combinatorics of a triangulated disk in the plane and parametrize deformations of circle packings in terms of vertex rotation and cross ratios. We show that there is a Weierstrass representation formula relating infinitesimal deformations of circle packings to discrete minimal surfaces…

2017-12-22abs ↗pdf ↗

We use a Riemannnian approximation scheme to define a notion of sub-Riemannian Gaussian curvature\textit{sub-Riemannian Gaussian curvature} for a Euclidean C2C^{2}-smooth surface in the Heisenberg group H\mathbb{H} away from characteristic points, and a notion of sub-Riemannian signed geodesic curvature\textit{sub-Riemannian signed geodesic curvature} for Euclidean C2C^{2}-smooth curve…

2016-04-01abs ↗pdf ↗

There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the arrangement still holds. An application of the theory shows that all minimal cellular …

2002-08-22abs ↗pdf ↗

The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex function…

2014-08-11abs ↗pdf ↗

We let (M^m, g) be a closed smooth Riemannian manifold (m >1) with positive scalar curvature S_g, and prove that the Yamabe constant of (M \times R^n,g+g_E) is achieved by a metric in the conformal class of (g+g_E), where g_E is the Euclidean metric. We also show that the Yamabe quotient of (M \times R^n,g+g_E) is impr…

2009-11-30abs ↗pdf ↗

Higher chromatic numbers χsχ_s of simplicial complexes naturally generalize the chromatic number χ1χ_1 of a graph. In any fixed dimension dd, the ss-chromatic number χsχ_s of dd-complexes can become arbitrarily large for sd/2s\leq\lceil d/2\rceil [6,18]. In contrast, χd+1=1χ_{d+1}=1, and only little is known on χsχ_s for …

2015-03-28abs ↗pdf ↗

Classical integral geometry takes place in Euclidean space, but one can attempt to imitate it in any other metric space. In particular, one can attempt this in R^n equipped with the metric derived from the p-norm. This has, in effect, been investigated intensively for 1<p<\infty, but not for p=1. We show that integral …

2010-12-29abs ↗pdf ↗

New connection found between shape reconstruction methods and persistent homology.

problem Connecting shape reconstruction methods with persistent homology.
method Wrap complexes and lexicographic optimal homologous cycles.
result Lexicographically optimal homologous cycles are supported on Wrap complexes.

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictio…

2013-03-27abs ↗pdf ↗

We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree---"Extremely Fast Decision Tree", a minor modification to the MOA implementat…

2018-02-24abs ↗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 ↗

Paper analyzes soft tree ensembles using NTK, finding only leaf count matters.

problem Understanding impact of various tree architectures in ensemble learning.
method Formulated and analyzed Neural Tangent Kernel (NTK) for soft tree ensembles.
result Only the number of leaves at each depth is relevant for tree architecture in ensemble learning.