arXiv research

Develops tests for Markowitz stochastic dominance spanning using saddle points.

New methods evaluate stock market anomalies for prospect investors.

Differentiable clustering method using perturbed spanning forests.

This work extends SVM error bounds to weighted SVM and introduces hyperparameter selection methods.

Refines knot defect measurement in 3D and 4D.

The paper identifies the minimum mean-variance spanning set and its importance in asset evaluation.

We use the methods of Hedden, Juhasz, and Sarkar to exhibit a set of arborescent knots that bound large numbers of non-isotopic minimal genus spanning surfaces. In particular, we describe a sequence of prime knots K_{n} which will bound at least 2^{2n-1} non-isotopic minimal spanning surfaces of genus n.

New spanning tree model connects knot homology, s-invariant, and exotic discs.

Plateau's problem is to find a surface with minimal area spanning a given boundary. In 1960, Reifenberg and Adams developed a definition for "span" using Čech homology, and variants of this definition have been used ever sense. However, limitations of Čech homology resulted in the lack of a natural definition for a bou…

This paper improves speech recognition by using raw waveform signals in multi-span CNN acoustic models.

For a given boundary set consisting of arcs and vertices, with two or more arcs meeting at each vertex, we treat the problem of estimating the area density of a soap film-like surface spanning the boundary.

New algorithms find optimal policies without knowing MDP span.

Study Kauffman bracket skein modules of Seifert fibered spaces.

Plateau's soap film problem is to find a surface of least area spanning a given boundary. We begin with a compact orientable $(n-2)$-dimensional submanifold $M$ of $\R^n$. If $M$ is connected, we say a compact set $X$ "spans" $M$ if $X$ intersects every Jordan curve whose linking number with $M$ is 1. Picture a soap fi…

The paper defines a new algebra and provides a basis for it.

Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct product X times Y. This implies that the minimal spanning forest corresponding …

Paper shows a surface with positive genus under a tetrahedron, less than cone's area.

New algorithms reduce reinforcement learning regret in factored MDPs.

New spanning 3-disks found for unlink in 4-sphere.

New dataset and models detect cryptocurrency bubbles using social media data.

New methods show sparse portfolios offer no advantage over mean-variance in diversification.

SPAN learns functions over sets invariant to permutations, outperforming existing methods.

New complexity measure helps in agnostic reinforcement learning with or without access to MDP dynamics.

Sharp bounds for spanning tree entropy in planar lattices.

Totally geodesic surfaces found in knots and links.

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

A new classification method based on Minimum Spanning Trees

Paper extends option spanning results for non-integrable assets.

Spanning attack improves black-box attacks with unlabeled data.

Proves bounds on spanning two-forests and random cut sizes.

Ancient curves span halfplanes via flow.

Alexander polynomial equals spanning tree count at t=1.

We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show that the span of a knot is one if and only if it is non-trivial and alternating, an…

Classifies state functions for framed tangles in a disk.

Study asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.

Non-spanning identification of scheduled event risk in option pricing.

Let $M$ be an $n$-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-κ^2$. Using the cone total curvature $TC(Γ)$ of a graph $Γ$ which was introduced by Gulliver and Yamada Math. Z. 2006, we prove that the density at any point of a soap film-like…

New invariants measure how far spanning surfaces are from being compressible.

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.

This paper proposes a new method to adapt ROMs for new parameter settings.

Study Murasugi sum in 4D for knotted surfaces, defining arborescent surfaces.

Nonorientable spanning surfaces of periodic knots can have arbitrarily high first Betti number.

For a spanning tree T of a connected graph G and for a labelling φ: E(T) \rightarrow {+, -}, φis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph ha…

We investigate the time series of the degree of minimum spanning trees obtained by using a correlation based clustering procedure which is starting from (i) asset return and (ii) volatility time series. The minimum spanning tree is obtained at different times by computing correlation among time series over a time windo…

Estimates tree-based density from random vectors.

Optimizes policies for reinforcement learning with limited data.

Investigates stochastic networks on disordered lattices, converging to Brownian web in 2D.

We define a geometric flow that is designed to change surfaces of cylindrical type spanning two disjoint boundary curves into solutions of the Douglas-Plateau problem of finding minimal surfaces with given boundary curves. We prove that also in this new setting and for arbitrary initial data, solutions of the Teichmüll…