Related papers: Path signatures of ODE solutions
We review matrix methods as applied to tracer transport. Because tracer transport is linear, matrix methods are an ideal fit for the problem. A gridded, Eulerian tracer simulation can be approximated as a system of linear ordinary…
An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…
The concept of symmetry breaking has been a propelling force in understanding phases of matter. While rotational symmetry breaking is one of the most prevalent examples, the rich landscape of orientational orders breaking the rotational…
In 1994 we showed that very large classes of systems of nonlinear PDEs have solutions which can be assimilated with usual measurable functions on the Euclidean domains of definition of the respective equations. Recently, the regularity of…
In this short note we give and discuss a general multilinear expression of the structure function of an arbitrary semicoherent system in terms of its minimal path and cut sets. We also examine the link between the number of minimal path and…
Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability for…
We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurable solution, a factor of iid solution, or a solution with the…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
Directed graphs can be partitioned in so-called passages. A passage P is a set of edges such that any two edges sharing the same initial vertex or sharing the same terminal vertex are both inside $P$ or are both outside of P. Passages were…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from…
There has been a long history of using ordinary differential equations (ODEs) to understand the dynamics of discrete-time algorithms (DTAs). Surprisingly, there are still two fundamental and unanswered questions: (i) it is unclear how to…
In this article, we introduce a novel parallel-in-time solver for nonlinear ordinary differential equations (ODEs). We state the numerical solution of an ODE as a root-finding problem that we solve using Newton's method. The affine…
The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
We derive a canonical form for smooth vector fields on $\Re^{n+1}$. We use this to demonstrate the local multi-Hamiltonian nature of the corresponding flows. Associated with the canonical form is an inhomogenious linear PDE whose solutions…
A signed graph (SG) is a graph where edges carry sign information attached to it. The sign of a network can be positive, negative, or neutral. A signed network is ubiquitous in a real-world network like social networks, citation networks,…
By setting up appropriate uniform convergence structures, we are able to reformulate the Order Completion Method of Oberguggenberger and Rosinger in a setting that more closely resembles the usual topological constructions for solving PDEs.…
This paper presents an accurate method for verifying online signatures. The main difficulty of signature verification come from: (1) Lacking enough training samples (2) The methods must be spatial change invariant. To deal with these…
The representation of workflows and processes is essential in materials science engineering, where experimental and computational reproducibility depend on structured and semantically coherent process models. Although numerous ontologies…