相关论文: A tree approach to $p$-variation and to integratio…

Within the context of rough path analysis via fractional calculus, we show how variability can be used to prove the existence of integrals with respect to H\"older continuous multiplicative functionals in the case of Lipschitz coefficients…

We provide a new representation of an $\mathbb R$-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river…

There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…

Let $B=(B_1(t),\ldots,B_d(t))$ be a $d$-dimensional fractional Brownian motion with Hurst index $\alpha<1/4$. Defining properly iterated integrals of $B$ is a difficult task because of the low H\"older regularity index of its paths. Yet…

When the one-form is $Lip\left(\gamma-1\right) $ with $\gamma >p\geq 1$, we construct the integral of a branched $p$-rough path, which defines another branched $p$-rough path. We derive a quantitative bound for this integral and prove that…

We consider a fractional version of the Heston volatility model which is inspired by [16]. Within this model we treat portfolio optimization problems for power utility functions. Using a suitable representation of the fractional part,…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

We propose a measure of shape which is appropriate for the study of a complicated geometric structure, defined using the topology of neighborhoods of the structure. One aspect of this measure gives a new notion of fractal dimension. We…

Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this "convolution…

A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density…

This paper modifies a box-counting method of estimating a fractal dimension of a graph, and applies it to estimate the roughness of a sample function of a stochastic process such as a Levy process or a Gaussian process with stationary…

For any real-valued stochastic process $X$ with c\'rdl\'rg paths we define non-empty family of processes which have locally finite total variation, have jumps of the same order as the process $X$ and uniformly approximate its paths on…

Understanding the response of an output variable to multi-dimensional inputs lies at the heart of many data exploration endeavours. Topology-based methods, in particular Morse theory and persistent homology, provide a useful framework for…

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

In this paper, we establish the theory of $p$-modulus of a family of infinite paths on an infinite-rooted tree and then explore its interpretation and properties. One key result is the formulation of $p$-modulus on the infinite tree as a…

We review and extend the formalism introduced by Peliti, that maps a Markov process to a path-integral representation. After developing the mapping, we apply it to some illustrative examples: the simple decay process, the birth-and-death…

Recent theory work has found that a special type of spatial partition tree - called a random projection tree - is adaptive to the intrinsic dimension of the data from which it is built. Here we examine this same question, with a combination…

This is a review paper on recent work about the connections between rough path theory, the Connes-Kreimer Hopf algebra on rooted trees and the analysis of finite and infinite dimensional differential equation. We try to explain and motivate…

We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…