相关论文: Ramification of rough paths
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…
One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. A nonparametric, rank-based method to estimate this structure is presented. The idea is to represent…
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in general. Through backtracking, on each graph an IR-algorithm…
The enumerative geometry of r-th roots of line bundles is the subject of Witten's conjecture and occurs in the calculation of Gromov-Witten invariants of orbifolds. It requires the definition of the suitable compact moduli stack and the…
In \cite{TY18}, higher genus Gromov--Witten invariants of the stack of $r$-th roots of a smooth projective variety $X$ along a smooth divisor $D$ are shown to be polynomials in $r$. In this paper we study the degrees and coefficients of…
We consider a real-valued path; it is possible to associate a tree to this path, and we explore the relations between the tree, the properties of $p$-variation of the path, and integration with respect to the path. In particular, the…
We consider additive functionals of stationary Markov processes and show that under Kipnis-Varadhan type conditions they converge in rough path topology to a Stratonovich Brownian motion, with a correction to the Levy area that can be…
The Hairer-Kelly map has been introduced for establishing a correspondence between geometric and non-geometric rough paths. Recently, a new renormalisation on rough paths has been proposed in (arxiv 1810.12179), built on this map and the…
Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth,…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where until recently solely reserved to numerical data. Within the…
We provide a draft of a theory of geometric integration of rough differential forms which are generalizations of classical (smooth) differential forms to similar objects with very low regularity, for instance, involving H\"older continuous…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…