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

285683111 · Jun 202619922001200920172026
48 results for flat chains

We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…

1999-07-01abs ↗pdf ↗

In this paper, we present a structurally flat triangular form which is based on the extended chained form. We provide necessary and sufficient conditions for an affine input system with two inputs to be static feedback equivalent to the proposed triangular form, and thus a sufficient condition for an affine input syste…

2020-02-04abs ↗pdf ↗

New insights into Markov chain geometry via positive transition measures.

problem Lack of statistical meaning in the space of transition probabilities.
method Constructing an extension of the space of transition probabilities using Amari's theory of positive measures.
result Introduction of a new dually flat structure for the space of positive transition measures.

The study provides bounds for geodesic diameter in Euclidean space.

problem Finding bounds for geodesic diameter in Euclidean space.
method Develops a geometric approach using locally rectifiable chains and complete normed commutative group bundles.
result Provides a new method for calculating geodesic diameter bounds.

We construct a flat (and fake-flat) 2-connection in the configuration space of nn indistinguishable particles in the complex plane, which categorifies the sl(2,C)sl(2,C)-Knizhnik-Zamolodchikov connection obtained from the adjoint representation of sl(2,C)sl(2,C). This will be done by considering the adjoint categorical represen…

2012-07-04abs ↗pdf ↗

Sobolev mappings preserve the Rumin complex on contact manifolds.

problem Preserving the Rumin complex under Sobolev mappings on contact manifolds.
method Using the Pullback Theorem, Pansu pullback is shown to induce chain mappings between Rumin complexes and de Rham complexes.
result The Rumin flat complex is bilipschitz invariant under Sobolev mappings between contact manifolds.

The pull back of a flat bundle EXE\rightarrow X along the evaluation map π:LXXπ: \mathcal{L} X \to X from the free loop space LX\mathcal{L} X to XX comes equipped with a canonical automorphism given by the holonomies of EE. This construction naturally generalizes to flat Z\mathbb{Z}-graded connections on XX. Our main …

2015-10-16abs ↗pdf ↗

Lie contact structures generalize the classical Lie sphere geometry of oriented hyperspheres in the standard sphere. They can be equivalently described as parabolic geometries corresponding to the contact grading of orthogonal real Lie algebra. It follows the underlying geometric structure can be interpreted in several…

2009-01-28abs ↗pdf ↗

The paper extends gradient flow and relaxation studies to non-flat Riemannian manifolds.

problem Understanding gradient flows and relaxation in non-flat Riemannian manifolds.
method Developed a criterion for comparing relaxation along gradient descent curves using non-metricity tensor.
result Revealed a universal asymmetry: warming up is faster than cooling down.

A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane curves. At present the most efficient method for sampling diagrams is rejection sa…

2018-04-10abs ↗pdf ↗

A fundamental theorem of Wolfe isometrically identifies the space of flat differential forms of dimension mm in Rn\mathbb{R}^n with the space of flat mm-cochains, that is, the dual space of flat chains of dimension mm in Rn\mathbb{R}^n. The main purpose of the present paper is to generalize Wolfe's theorem to the se…

2014-01-30abs ↗pdf ↗

The chains studied in this paper generalize Chern-Moser chains for CR structures. They form a distinguished family of one dimensional submanifolds in manifolds endowed with a parabolic contact structure. Both the parabolic contact structure and the system of chains can be equivalently encoded as Cartan geometries (of d…

2005-04-22abs ↗pdf ↗

We prove an analogue of the de Rham theorem for the extended L^2-cohomology introduced by M. Farber. This is done by establishing that the de Rham complex over a compact closed manifold with coefficients in a flat Hilbert bundle E of A-modules over a finite von Neumann algebra A is chain-homotopy equivalent (with bound…

1996-10-11abs ↗pdf ↗

New approach connects quantum phases to VQA trainability, enabling better scaling.

problem Scalability issues in VQAs, especially barren plateaus.
method Analog VQA ansätze composed of quenches of a disordered Ising chain, tuning disorder strength.
result Thermalized and MBL phases reach maximal expressivity at large MM, but barren plateaus emerge at smaller MM in the thermalized phase.

In this paper, we construct new characteristic classes of fiber bundles via flat connections with values in infinite-dimensional Lie algberas of derivations. In fact, choosing a fiberwise metric, we construct a chain map to the de Rham complex on the base space, and show that the induced map on cohomology groups is ind…

2015-11-21abs ↗pdf ↗

Geometrically proves twisted Poincaré duality for orientable Poisson manifolds.

problem Establishing twisted Poincaré duality for Poisson manifolds.
method Geometrically reinterprets algebraic constructions of twisted Poisson modules and Poisson chain complexes.
result Explicit chain isomorphism between Poisson cochain and chain complexes with coefficients in Poisson modules.

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

We prove that every stationary polyhedral varifold minimizes area in the following senses: (1) its area cannot be decreased by a one-to-one Lipschitz ambient deformation that coincides with the identity outside of a compact set, and (2) it is the varifold associated to a mass-minimizing flat chain with coefficients in …

2019-11-30abs ↗pdf ↗

MCMC complexity matches optimization for large nn and dd.

problem Lack of theoretical understanding of MCMC complexity for large nn and dd.
method Comparison of MCMC, LA, and VI complexities for linear, logistic, and Poisson regression.
result MCMC complexity matches optimization complexity for ndn\gtrsim d.

Constructs a support-preserving homotopy for differential forms with boundary decay estimates.

problem Non-uniqueness of chain homotopies in de Rham complexes with boundary decay properties.
method Constructs a specific chain homotopy with desirable support propagation and boundary decay estimates.
result Obtains a support-preserving right inverse of the divergence operator with optimal decay estimates.

Study on Klein bottle's cotangent bundle using contact homology.

problem Understanding symplectic embeddings of toric domains into the Klein bottle's cotangent bundle.
method Combinatorial description of embedded contact homology, pseudoholomorphic curves.
result Obstruction theorem for symplectic embeddings and computation of Gromov width.

Unique solutions found for Plateau problems in smooth and continuous calibrations.

problem Finding unique solutions to the Plateau problem for specific types of currents.
method Boundary regularity theory for area-minimizing currents and unique continuation argument.
result Every compactly supported smoothly or continuously calibrated integral current is the unique solution to the Plateau problem for its boundary data.

Study finds on-chain data can proxy off-chain cryptocurrency pricing.

problem Develop methods to proxy off-chain cryptocurrency pricing using on-chain data.
method Graphical models, mutual information, and ensemble machine learning.
result A significant amount of pricing information is contained in on-chain data, but precise prices are hard to recover except on short time scales.

We solve the local equivalence problem for second order (smooth or analytic) ordinary differential equations. We do so by presenting a {\em complete convergent normal form} for this class of ODEs. The normal form is optimal in the sense that it is defined up to the automorphism group of the model (flat) ODE y"=0y"=0. For…

2016-11-25abs ↗pdf ↗

Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.

problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…

2013-05-03abs ↗pdf ↗

Mack's estimator improves chain ladder prediction for large exposure insurance models.

problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.

Polynomial invariants classify molecular chains based on their contact arrangements.

problem No established invariants for molecular chains with both hard and soft contacts.
method Developed polynomial invariants for circuit topology of molecular chains.
result Polynomial invariants efficiently classify chains with various contact types.

This study aims to improve communication between fragmented blockchain systems in finance.

problem Inefficient and insecure communication in fragmented blockchain systems.
method Analysis of cross-chain interoperability protocols and their properties.
result Comparison and evaluation of cross-chain interoperability protocols.

We analyze a new Markov chain model for better sampling and optimization.

problem Developing a new Markov chain model for improved sampling and optimization.
method We introduce a new class of Ito chains with arbitrary noise and inexact drift/diffusion coefficients, proving a bound in W2W_{2}-distance.
result Our analysis provides improved or first results for various applications like SGLD, sampling, and boosting.

This work improves generalisation bounds using chaining and information theory.

problem Improving generalisation bounds for supervised learning algorithms.
method Developed a theoretical framework linking generalisation bounds to their chained counterparts, derived new bounds using Wasserstein distance.
result Chained generalisation bounds can be tighter than standard bounds, especially for concentrated hypothesis distributions.