Related papers: Path signatures of ODE solutions

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…

Path signatures embed trajectories into tensor algebra and constitute a universal, non-parametric representation of paths; however, in the standard form, they collapse temporal structure into a single global object, which limits their…

General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The…

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost…

We exhibit an explicit natural isomorphism between spaces of branched and geometric rough paths. This provides a multi-level generalisation of the isomorphism of Lejay-Victoir (2006) as well as a canonical version of the It\^o-Stratonovich…

The Hamiltonian Path Problem is formulated as a continuous minimization problem on conductances assigned to an Ohmic network associated with the given graph. The objective function is a sum of two penalty terms that collectively enforce a…

A {\it Lie system} is a nonautonomous system of first-order differential equations admitting a {\it superposition rule}, i.e., a map expressing its general solution in terms of a generic family of particular solutions and some constants.…

Persistence diagrams (PDs), often characterized as sets of death and birth of homology class, have been known for providing a topological representation of a graph structure, which is often useful in machine learning tasks. Prior works rely…

Branched rough paths, used to solve ODEs on $\mathbb{R}$, have been generalised in two different directions. In one direction, there are regularity structures aimed at solving SPDEs on $\mathbb{R}$. In the other direction, there are…

Probabilistic solvers for ordinary differential equations (ODEs) have emerged as an efficient framework for uncertainty quantification and inference on dynamical systems. In this work, we explain the mathematical assumptions and detailed…

On the basis of the canonical quantization procedure of a system defined on a cubic lattice, we propose a new method, in which resolutions of unity expressed in terms of eigenvectors are naturally provided, to find eigenvectors of field…

We study rectangles inscribed in lines in the plane by parametrizing these rectangles in two ways, one involving slope and the other aspect ratio. This produces two paths, one that finds rectangles with specified slope and the other…

This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are represented by edges in a diagram, and matrices by markings…

We construct a series of stochastic differential equations of the form $dX_t = b(t, X_t) dt + dB_t$ which exhibit nonuniqueness in the path-by-path sense while having a unique adapted solution in the sense of stochastic processes, i.e.…

This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…

This paper describes the construction of a canonical compactification of the space of trajectories and of the unstable/stable sets of a generic gradient like vector field on a closed manifold as well as a canonical structure of a smooth…

Natural laws are often described through differential equations yet finding a differential equation that describes the governing law underlying observed data is a challenging and still mostly manual task. In this paper we make a step…

We propose a framework to define solutions of ODE systems under a novel condition that goes well beyond the usual continuity condition required in the classical theory of ODEs (Peano's or Picard's theorems). We illustrate our results with…