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

72145217289 · Jun 202019922001200920172026
48 results for disjoint dynamics

Study Schrödinger evolution on surfaces in 3D contact sub-Riemannian manifolds.

problem Analyzing the Schrödinger evolution on surfaces embedded in 3D contact sub-Riemannian manifolds.
method Relating self-adjointness of the Schrödinger operator to geometric invariants of the foliation.
result Classification of self-adjoint extensions yielding disjoint dynamics.

A Heegaard splitting of a closed, orientable three-manifold satisfies the disjoint curve property if the splitting surface contains an essential simple closed curve and each handlebody contains an essential disk disjoint from this curve [Thompson, 1999]. A splitting is full if it does not have the disjoint curve proper…

2004-01-28abs ↗pdf ↗

We present a new property, the Disjoint Path Concordances Property, of an ENR homology manifold X which precisely characterizes when X times R has the Disjoint Disks Property. As a consequence, X times R is a manifold if and only if X is resolvable and it possesses this Disjoint Path Concordances Property.

2009-03-17abs ↗pdf ↗

We link disjoint longitudinal data for rare disease patients using latent representations and mixed-effects regression.

problem Analyzing treatment switches in rare diseases with limited data and changing measurement instruments.
method We embed item values into a shared latent space using variational autoencoders and apply mixed-effects regression to quantify treatment effects.
result Our approach allows for statistical inference and quantifies the impact of treatment switches in spinal muscular atrophy.

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

2019-08-11abs ↗pdf ↗

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number of circles meeting in a given cyclic order given 6 disjoint smooth closed curves…

2005-11-21abs ↗pdf ↗

The paper introduces MU for NMF with ββ-divergences and disjoint constraints.

problem Nonnegative matrix factorization with constraints.
method Design multiplicative updates for NMF based on ββ-divergences with disjoint constraints.
result Multiplicative updates satisfy constraints and decrease the objective function.

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

2008-07-23abs ↗pdf ↗

New theorem on embedding Moebius bands in 3D space.

problem Proving the impossibility of placing uncountably many disjoint Moebius bands in 3D space.
method Generalization of Grushin and Palamodov's result to tame subsets in R^N and arbitrary topological embeddings in R^3.
result The impossibility of embedding uncountably many pairwise disjoint Moebius bands in 3D space, even for arbitrary topological embeddings.

The study bounds the excess of disjoint nonorientable surfaces in a 4-manifold.

problem Bounding the excess of disjoint nonorientable surfaces in a 4-manifold.
method Combining tubing construction with signature and Euler-characteristic formulas for 2-fold branched covers.
result The normal-Euler excess is bounded by a constant depending only on the ambient 4-manifold.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

The following problem was proposed in 2010 by S. Lando. Let MM and NN be two unions of the same number of disjoint circles in a sphere. Do there always exist two spheres in 3-space such that their intersection is transversal and is a union of disjoint circles that is situated as MM in one sphere and as NN in the ot…

2012-10-27abs ↗pdf ↗

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

2018-07-19abs ↗pdf ↗

A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.

problem Finding dense disjoint bicliques in a weighted bipartite graph.
method Semidefinite programming-based branch-and-cut algorithm with upper and lower bounds.
result The algorithm can solve much larger instances than general-purpose solvers.

We study the structure of finite quandles in terms of subquandles. Every finite quandle QQ decomposes in a natural way as a union of disjoint QQ-complemented subquandles; this decomposition coincides with the usual orbit decomposition of QQ. Conversely, the structure of a finite quandle with a given orbit decomposit…

2005-08-14abs ↗pdf ↗

Let Y be a compact, oriented 3-manifold with a contact form a. For any Dirac operator D, we study the asymptotic behavior of the spectral flow between D and D+cl(-ira) as r very large. If a is the Thurston-Winkelnkemper contact form whose monodromy is the product of Dehn twists along disjoint circles, we prove that the…

2011-04-26abs ↗pdf ↗

This paper uses entropy to derive stock price dynamics and option valuation.

problem Deriving stock price dynamics and option valuation from information constraints.
method Develops an entropic inference framework to derive stochastic processes from information constraints, representing price changes through two channels: continuous and jump.
result The derived dynamics is the Merton jump diffusion, with Geometric Brownian Motion as the no jump limit.

Improved defense against data poisoning attacks by aggregating smaller subsets.

problem Mitigating the impact of poisoned data on model robustness.
method Finite Aggregation method that combines duplicates of smaller disjoint subsets for training.
result Consistent improvement in certified robustness bounds, up to 4.77% on GTSRB.

The study examines how bias affects hypothesis formation in neural networks.

problem Characterizing the impact of bias on hypothesis formation in neural networks.
method An automated data-driven projection pursuit neural network to extract and select features for binary classification.
result The refinement of a working hypothesis converges to a robust multivariate perception of data.

PGNs dynamically infer and use graph structures to improve model generalization.

problem Static graph structures inferred by machine learning practitioners are often suboptimal for tasks.
method PGNs augment graphs with dynamically inferred pointers for improved model generalization.
result PGNs outperform unrestricted GNNs and Deep Sets on dynamic graph connectivity tasks.

BWFlow improves graph generation by smoothly interpolating graph components.

problem Disjoint modeling of graph nodes and edges leads to irregular and non-smooth probability paths.
method Modeling graphs as MRFs and using optimal transport displacement for a smooth probability path.
result BWFlow achieves better training convergence and efficient sampling in graph generation.

Improved Gaussian process inference for spatio-temporal data.

problem Cubic computational costs in Gaussian process inference, especially in spatio-temporal settings.
method Proposes the Vanilla-SPDE Exchange, leveraging an equivalence between standard and SPDE formulations to achieve improved computational cost.
result Demonstrates improved computational efficiency through complexity analysis and numerical experiments.

In this paper we study how to distinguish two embeddings of a finite collection of disjoint circles into the plane up to planar isotopy. We adopt the spirit of the approach by V. Turaev, Operator Invariants of Tangles, Math. USSR-Izv. 35 (1990), 411--444, by considering a category of planar tangles and representing it …

2005-04-17abs ↗pdf ↗

We provide a self-contained treatment of set-theoretic subsolutions to flow by mean curvature, or, more generally, to flow by mean curvature plus an ambient vector field. The ambient space can be any smooth Riemannian manifold. Most importantly, we show that if two such set-theoretic subsolutions are initially disjoint…

2018-09-09abs ↗pdf ↗

Reducing volatility proxy improves apparent market correlation dynamics.

problem Attributing apparent slow collective market dynamics to intrinsic or driver inheritance.
method Coupled Ornstein-Uhlenbeck model with VIX proxy, decomposing and controlling for autocorrelation.
result VIX-coupled model reduces effective relaxation time from 298 to 61 trading days, improving fit over bare mean reversion.

A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.

problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.