Paper uses GNNs to efficiently detect profitable triangular arbitrage opportunities.
problem Detecting profitable triangular arbitrage opportunities in dynamic markets.
method Formulate the problem as a graph-based optimization task and use a GNN architecture to capture complex relationships.
result GNN-based method achieves higher average yield with reduced computational time compared to traditional methods.
We investigate triangular arbitrage within the spot foreign exchange market using high-frequency executable prices. We show that triangular arbitrage opportunities do exist, but that most have short durations and small magnitudes. We find intra-day variations in the number and length of arbitrage opportunities, with la…
We first show that there are in fact triangular arbitrage opportunities in the spot foreign exchange markets, analyzing the time dependence of the yen-dollar rate, the dollar-euro rate and the yen-euro rate. Next, we propose a model of foreign exchange rates with an interaction. The model includes effects of triangular…
Model shows triangular arbitrage key to cross-currency correlations in forex markets.
problem Understanding cross-currency correlations in forex markets.
method Agent-based model of market interactions.
result Triangular arbitrage is primary driver of cross-currency correlations.
We introduce a microscopic model which describes the dynamics of each dealer in multiple foreign exchange markets, taking account of the triangular arbitrage transaction. The model reproduces the interaction among the markets well. We explore the relation between the parameters of the present microscopic model and the …
If financial markets displayed the informational efficiency postulated in the efficient markets hypothesis (EMH), arbitrage operations would be self-extinguishing. The present paper considers arbitrage sequences in foreign exchange (FX) markets, in which trading platforms and information are fragmented. In Kozyakin et …
Multifractal detrended cross-correlation methodology is described and applied to Foreign exchange (Forex) market time series. Fluctuations of high frequency exchange rates of eight major world currencies over 2010-2018 period are used to study cross-correlations. The study is motivated by fundamental questions in compl…
The paper analyzes algorithmic trading in cryptocurrency exchanges, finding a profitable strategy involving indirect conversions.
problem Lack of empirical analysis of algorithmic trading in cryptocurrency exchanges.
method Empirical analysis using historical trades data from Binance.
result A triangular arbitrage strategy yields a 14.4 basis point advantage over direct exchanges.
Study identifies Bitcoin arbitrageurs and their trading strategies.
problem Detecting and understanding Bitcoin arbitrageurs on Mt. Gox.
method Analyzing historical trade data from Mt. Gox (2011-2014) to identify and categorize arbitrageurs.
result Expert arbitrageurs have a positive profit margin, while novice users do not.
Paper presents a new triangular form for flat systems.
problem Designing flat systems with two inputs.
method Geometric characterization and static feedback equivalence.
result Sufficient condition for affine input systems to be flat.
Paper presents a new flat triangular form for systems.
problem Creating a structurally flat triangular form for systems.
method Developed a new triangular form based on the extended chained form with conditions for static feedback equivalence.
result Provided conditions for affine input systems to be static feedback equivalent to the new triangular form.
We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…
Introduces triangular transport for uncertain data.
problem Uncertainty in complex systems without known probabilistic representations.
method Characterizes and manipulates unknown probability distributions using triangular transport maps.
result Triangular transport guarantees desirable mathematical and computational properties.
Solves problem of describing transformations for upper triangular Toeplitz operators.
problem Describing coordinate transformations preserving upper triangular Toeplitz form of operator fields.
method Implicit formulas involving matrix-valued functions for describing transformations and Nijenhuis operators.
result Formulas for coordinate transformations and Nijenhuis operators in upper triangular Toeplitz form.
Triangular flows ensure statistical consistency and fast rates in generative modeling.
problem Ensuring statistical consistency and fast rates in generative models.
method Statistical guarantees and sample complexity bounds for triangular flow models using empirical process theory.
result Established statistical consistency and finite sample convergence rates for Kullback-Leibler estimator of Knöthe-Rosenblatt measure coupling.
We create a smooth manifold of triangular meshes with a geodesically complete metric.
problem Representing and manipulating 2D shapes as triangular meshes.
method Developed a geodesically complete Riemannian metric for triangular meshes.
result The metric preserves mesh connectivity and avoids mesh degradation.
Discretizes Helfrich-type energies on surfaces using triangular complexes.
problem Discretizing curvature energies on surfaces of specific type.
method Asymptotic lower bound combined with recovery sequence of triangulations and edge director fields.
result Valid discrete versions of integral curvature energies on surfaces.
We study the problem to provide a triangular form based on implicit differential equations for non-linear multi-input systems with respect to the flatness property. Furthermore, we suggest a constructive method for the transformation of a given system into that special triangular shape, if possible. The well known Brun…
The study investigates linearizability of Poisson structures on groupoids.
problem Linearizing Poisson structures on groupoids around the unit section.
method Extending the Lagrangian neighbourhood theorem to cosymplectic Lie algebroids, integrating triangular Lie bialgebras to symplectic LA-groupoids.
result Poisson structures on groupoids are linearizable under certain conditions.
New method for conditional sampling using M-GANs, likely-free inference.
problem Conditional sampling of probability measures.
method Developed a novel computational approach called M-GANs based on block triangular transport.
result Accurate sampling of conditional measures in various applications.
New method uses neural maps to efficiently sample lattice QCD distributions.
problem Challenges in sampling Boltzmann distributions of lattice field theories.
method Sparse triangular transport maps exploiting conditional independence structure of lattice graphs.
result Sparse triangular maps achieve efficient sampling with linear time complexity in lattice size.
Study finds conditions for operator fields to be in strictly upper triangular form in small dimensions.
problem Jordan-Chevalley decomposition for operator fields in small dimensions.
method Tensorial conditions and proof of conjecture for higher order brackets.
result Proves Tempesta-Tondo conjecture for higher order brackets.
In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The operations used to perform this triangularization preserve the property that the entries …
This paper explores the relationship between Leibniz algebras and Nijenhuis operators.
problem Understanding the relationship between Leibniz algebras and Nijenhuis operators.
method Investigation of Nijenhuis operators on Leibniz algebras and classification of Leibniz bialgebras.
result Leibniz algebras are closely related to Nijenhuis operators, and triangular symplectic Leibniz bialgebras possess Nijenhuis operators.
New basis confirms Thurston's conjecture and reveals knot configurations.
problem Understanding cluster algebras and their bases from surfaces.
method Topological construction of band basis and comparison with Kazhdan-Lusztig type basis.
result Common triangular basis matches band basis in quantum cluster algebras.
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option pricing in polynomial diffusion models. In this setting a discretization process pro…
Let X be a simply connected compact Riemannian symmetric space, let U be the universal covering group of the identity component of the isometry group of X, and let \g denote the complexification of the Lie algebra of U, \g=\u^\C. Each \u-compatible triangular decomposition \g=\n_- + \h + \n_+ determines a Poisson Lie g…
We study controlled systems which are uniformly observable and differentially observable with an order larger than the system state dimension. We establish that they may be transformed into a (partial) triangular canonical form but with possibly non locally Lipschitz functions. We characterize the points where this Lip…
We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us to work in a reduced dimensional embedding space. A numerical continuation metho…
In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering lines and circles in the plane. Finally, we give matrix generators in $\mathrm{…
Examines discrete curvature's relation to smooth curvature in 3 spaces.
problem Understanding how discrete curvature relates to smooth curvature in different spaces.
method Using specific triangular tilings of 3 types of spaces to examine curvatures.
result Discrete curvature can sense the smooth curvature of ambient space forms.
Two algorithms create high-quality triangular meshes for surfaces with guaranteed angles.
problem Creating high-quality triangular meshes for surfaces with controlled angles.
method MidNormal and GradNormal algorithms generate meshes with specified angle constraints.
result Meshes converge to surfaces as mesh size decreases, maintaining specified angles.
Develops theory for conditional optimal transport in infinite-dimensional spaces.
problem Bayesian inference with functional parameters in infinite-dimensional spaces.
method Theory of constrained optimal transport for block-triangular maps.
result Regularity estimates on conditioning maps from prior to posterior.
New model for simulating and inferring from inverse problems.
problem Bayesian inverse problems in conditional sampling.
method Invertible generative model using triangular normalizing flows.
result Training loss for invertible map proposed.
Minimal covolume group found in hyperbolic 3-space.
problem Finding groups with minimal covolume in hyperbolic 3-space.
method Proved existence of a specific group with minimal covolume.
result Minimal covolume group found with covolume equal to Catalan's constant.
New algorithm finds more arbitrage opportunities in DEXs.
problem Detecting arbitrage loops and non-loops in decentralized exchanges.
method Combining line graph and modified Moore-Bellman-Ford algorithm.
result Found more arbitrage loops and non-loops compared to existing methods.
This paper introduces strategies to maximize arbitrage profits in decentralized exchanges.
problem Maximizing profits from arbitrage loops in decentralized exchanges.
method Three strategies: MaxPrice, MaxMax, and Convex Optimization.
result The Convex Optimization strategy yields the highest monetized arbitrage profit in theory and practice.
Study upper hedging prices for contingent claims in models with various types of arbitrage.
problem Valuation of contingent claims in market models with different types of arbitrage.
method Analysis of market models with increasing profit, strong arbitrage, and arbitrage of the first kind.
result Option prices are reduced when increasing profit is present, and corporate stock price processes can be derived from issuance and repurchase plans.
New combinatorial type helps distinguish plane curve topologies.
problem Distinguishing the topology of plane curves.
method Introducing G-combinatorial type using modified plumbing graphs.
result Invariant of G-combinatorial type under certain homeomorphisms.
Algorithm learns non-Gaussian graphical models via Hessian scores and triangular transport.
problem Learning graph structure from non-Gaussian data.
method Score based on integrated Hessian information, coupled with triangular transport map.
result Algorithm successfully recovers graph structure for non-Gaussian data.
Somewhat unexpectedly, the study of the family of twisted knots revealed a hidden structure behind exclusive Racah matrices Sˉ, which control non-associativity of the representation product in a peculiar channel R⊗Rˉ⊗R⟶R. These Sˉ are simultaneously symmetric and orthogo…
A new neural network for efficient density estimation.
problem Efficient density estimation for high-dimensional data.
method Triangular neural network implementation of neural autoregressive flow (NAF).
result Achieves state-of-the-art bits-per-dimension indices on MNIST and CIFAR-10.
New framework for learning KR maps from data, ensuring stable generalization.
problem Learning monotone triangular transport maps efficiently and accurately.
method General framework using invertible transformations of smooth functions, ensuring no spurious local minima.
result Unique global minimizer corresponds to the KR map under certain conditions.
The paper explores arbitrage in financial markets under uncertainty using Wasserstein distance.
problem Investigating arbitrage in financial markets with distributional uncertainty.
method Using Wasserstein distance, the paper considers weak and strong forms of arbitrage conditions and introduces a relaxation called statistical arbitrage.
result The paper derives dual formulations of robust arbitrage conditions and conducts computational experiments to answer questions about ambiguity and statistical arbitrage.
It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular 2x2 matrices. In this work, we propose to generalize this result by considering the representations…
Researchers compute the cohomology ring of a foliation defined by a group action.
problem Computing the cohomology ring of a specific foliation defined by a group action.
method Non-abelian harmonic analysis on G to compute the leafwise cohomology ring. result Computed the leafwise cohomology ring H∗(FP). Study limits of convex domains in projective plane, proving specific results.
problem Understanding limits of convex domains in projective plane.
method Analyzing sequences of properly convex domains with bounded multiplicity.
result Determined all Hausdorff limit domains after normalization.
The paper investigates cyclic arbitrage opportunities in decentralized exchanges.
problem Price discrepancies in decentralized exchanges lead to arbitrage opportunities.
method Theoretical framework and analysis of transaction-level data.
result Traders have executed over 292,606 cyclic arbitrages over eleven months, exploiting more than 138 million USD in revenue.