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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for higher-order connectivity

Higher-order tangent bundles have geometric structures compatible with their iterated bundle structure.

problem Connection towers and Sasaki metrics on higher-order tangent bundles
method Introduce the notion of a connection tower and study the geometric structures induced by such towers.
result Connection towers determine multiconnections, adapted splittings, and canonical vector bundle structures.

We compare two ways of interpreting higher order connections. The geometric approach lies in the decomposition of higher order tangent space into the horizontal and vertical structures while the jet--like approach considers a higher order connection as the section of a jet prolongation of a fibered manifold. Particular…

2012-06-25abs ↗pdf ↗

The purpose of this article is to present the theory of higher order connections on vector bundles from a viewpoint inspired by projective differential geometry.

2009-08-11abs ↗pdf ↗

We present a geometric approach to the field theory with higher order anisotropic interactions. The concepts of higher order space, or locally anisotropic, space (in brief, h-space, or la-space) are introduced as general ones for various types of higher order extensions of Lagrange and Finsler geometry and higher dimen…

1996-11-09abs ↗pdf ↗

The paper connects higher order risk measures and stochastic dominance, showing their equivalence and integrating them with optimization.

problem Comparing and characterizing random outcomes in risk assessment.
method Exploring the equivalence between higher order risk measures and stochastic dominance, using stochastic optimization and expectiles as examples.
result Higher order risk measures and stochastic dominance are equivalent and can be used to characterize random outcomes.

We present an introduction to the geometry of higher order vector and co--vector bundles (including higher order generalizations of the Finsler geometry and Kaluza--Klein gravity) and review the basic results on Clifford and spinor structures on spaces with generic local anisotropy modeled by higher order nonlinear con…

2002-05-17abs ↗pdf ↗

Given a closed, oriented, connected 3-manifold, M, we define higher-order linking forms on the higher-order Alexander modules of M. These higher-order linking forms generalize similar linking forms for knots previously studied by the author, which were themselves generalizations of the classical Blanchfield linking for…

2012-04-23abs ↗pdf ↗

Networks are a fundamental model of complex systems throughout the sciences, and network datasets are typically analyzed through lower-order connectivity patterns described at the level of individual nodes and edges. However, higher-order connectivity patterns captured by small subgraphs, also called network motifs, de…

2018-02-19abs ↗pdf ↗

Flat surfaces that correspond to kk-differentials on compact Riemann surfaces are of finite area provided there is no pole of order kk or higher. We denote by \textit{flat surfaces with poles of higher order} those surfaces with flat structures defined by a kk-differential with at least one pole of order at least $k…

2016-06-12abs ↗pdf ↗

We prove a lower bound for the kk-th Steklov eigenvalues in terms of an isoperimetric constant called the kk-th Cheeger-Steklov constant in three different situations: finite spaces, measurable spaces, and Riemannian manifolds. These lower bounds can be considered as higher order Cheeger type inequalities for the Ste…

2017-05-24abs ↗pdf ↗

The work proposes a geometric background of the theory of field interactions and strings in spaces with higher order anisotropy. Our approach proceeds by developing the concept of higher order anisotropic superspace which unifies the logical and mathematical aspects of modern Kaluza-Klein theories and generalized Lagra…

1996-11-06abs ↗pdf ↗

The reduction theorems for general linear and classical connections are generalized for operators with values in higher order gauge-natural bundles. We prove that natural operators depending on the s1s_1-jets of classical connections, on the s2s_2-jets of general linear connections and on the rr-jets of tensor fields …

2004-05-26abs ↗pdf ↗

We present an introduction to the geometry of higher order vector and co-vector bundles (including higher order generalizations of the Finsler geometry and Kaluza--Klein gravity) and review the basic results on Clifford and spinor structures on spaces with generic local anisotropy modeled by anholonomic frames with ass…

2004-06-28abs ↗pdf ↗

Introduce Collapsed Effective Operators for higher-order structures.

problem Existing spectral operators decompose topology into separate ranks, leaving practitioners to fuse information back to vertices.
method Introduce Collapsed Effective Operators via Schur complementation of a graded Laplacian.
result Preserves positive semi-definiteness, lowers system energy under higher-order connectivity.

Develops higher-order Euler-Poincaré field equations for principal G-bundles.

problem Formulating field equations for higher-order jet bundles of principal G-bundles.
method Reduction theory applied to GG-invariant Lagrangian field theories on jet bundles, transferring Hamilton's principle to reduced configuration bundles.
result Higher-order Euler-Poincaré field equations are equivalent to conservation of Noether current.

MMGAN creates graphs with higher-order motifs for better network simulation.

problem Generative models fail to capture higher-order connectivity patterns in real-world networks.
method Combines multiple biased random walks to capture different motif structures.
result Outperforms NetGAN at creating graphs with accurate network motif statistics.

We extend the well-known Borromean and Brunnian rings to new higher order versions. Then we suggest an extension of the connection between Efimov states in cold gases and Borromean and Brunnian rings to these new higher order links. This gives rise to a whole new hierarchy of possible states with Efimov states at the b…

2010-12-13abs ↗pdf ↗

We develop the intersection theory at relative chain-cochain level, and apply it along with the use of Seifert disks for an oriented link to give a combinatorial algorithm to compute Massey's higher order linking numbers. It is subtle to compute higher-order linking numbers, and it has been a folklore to use the inters…

2014-07-18abs ↗pdf ↗

We develop a theory of higher-order feature attribution for complex models.

problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.

Mixes higher-order simplicial complexes for data augmentation.

problem Lack of labeled data for complex systems with multiway interactions.
method Proposes mixup mechanisms for simplicial complexes, including linear and nonlinear mixup, and a convex clustering mixup.
result Synthetic simplicial complexes interpolate between existing data based on homomorphism densities.

Geometric formalism views optimization algorithms as discrete connections, revealing their algebraic curvature and flatness properties.

problem Understanding and optimizing the behavior of iterative optimization algorithms.
method Introducing a geometric and operator-theoretic formalism where optimization algorithms are encoded by coupled channels (drift and diffusion) whose algebraic curvature measures the deviation from ideal reversibility.
result Flat connections correspond to methods whose updates commute up to higher order, achieving minimal numerical dissipation and preserving stability.

New method shows fully-connected networks can learn convolutional structures from data.

problem How to learn convolutional structures from translation-invariant data.
method Data-driven emergence of convolutional structure in neural networks.
result Initially fully-connected networks can learn convolutional structures from their inputs.

Expands differential geometry to higher-order infinitesimals.

problem No specific problem stated; general expansion of differential geometry.
method Introduces higher tangent vectors and jet connections, generalizes Riemannian metric tensor, develops higher-order integration theory.
result Natural analogues of Riemannian curvature tensor with novel phenomena.

Paper introduces a framework for diagnosing Alzheimer's disease using higher-order topological features from fMRI.

problem Diagnosing Alzheimer's disease using brain network topology.
method Persistent homology to extract higher-order features (cycles, cavities) from fMRI data.
result Framework significantly outperforms existing methods in AD classification.

We study heterotic supergravity at O(α)\mathcal{O}(α'), first described in detail in 1989 by Bergshoeff and de Roo. In particular, we discuss an ambiguity of a connection choice on the tangent bundle. It is well known that at O(α)\mathcal{O}(α') the Hull connection gives a consistent supergravity theory with supersymmetry …

2014-09-11abs ↗pdf ↗

Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems. However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise inter…

2019-08-02abs ↗pdf ↗

We study higher-order conservation laws of the non-linearizable elliptic Poisson equation 2uzzˉ=f(u) \frac{{\partial}^2 u}{\partial z \partial \bar{z}} = -f(u) as elements of the characteristic cohomology of the associated exterior differential system. The theory of characteristic cohomology determines a normal form for diffe…

2009-06-17abs ↗pdf ↗

We prove several Liouville-type non-existence theorems for higher order Codazzi tensors and classical Codazzi tensors on complete and compact Riemannian manifolds, in particular. These results will be obtained by using theorems of the connections between the geometry of a complete smooth manifold and the global behavio…

2018-03-11abs ↗pdf ↗

In this paper we define nnth order Hessian structures on manifolds and study them. In particular, when n=3n = 3, we make a detailed study and establish a one-to-one correspondence between {\it third-order Hessian structures} and a {\it certain class of connections} on the second-order tangent bundle of a manifold. Furt…

2005-08-25abs ↗pdf ↗

New method uses information theory to uncover causal relationships in complex systems.

problem Discovering causal relationships in multivariate systems, especially in Bayesian networks and hypergraphs.
method Partial Information Decomposition (PID) to explicitly model higher-order interactions.
result PID components reveal direct causal neighbors and collider relationships in Bayesian networks and multi-tail hyperedges in causal hypergraphs.

This paper simplifies computing higher-order UU-statistics efficiently.

problem The inefficiency of computing higher-order UU-statistics in practice.
method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute UU-statistics.

Classifies hypersurfaces with positive constant mean curvature in hyperbolic space.

problem Classifying hypersurfaces with positive constant mean curvature in hyperbolic space.
method Classifies hypersurfaces with rotational symmetry and positive constant rr-th mean curvature in HnimesR\mathbb H^n imes \mathbb R.
result Compact connected hypersurfaces of constant rr-th mean curvature embedded in Hnimes[0,)\mathbb H^n imes [0,\infty) with boundary in the slice Hnimes{0}\mathbb H^n imes \{0\} are topological disks under suitable assumptions.

It is shown that any finite list of smooth closed simply-connected 4-manifolds homeomorphic to a given one X can be obtained by removing a single compact contractible submanifold (or cork) from X, and then regluing it by powers of a boundary diffeomorphism. We then use this result to "separate" finite families of corks…

2019-02-07abs ↗pdf ↗

For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρρ-invariants, which we call higher-order signatures. The higher-order genera o…

2008-07-02abs ↗pdf ↗

Improved matching for multiple objects using a novel reweighting method.

problem Current multi-object matching methods have limitations and are not robust.
method Proposes a novel iterative reweighting strategy using the graph connection Laplacian.
result Demonstrates superior performance over state-of-the-art methods.