Related papers: Central and $L^p$-concentration of 1-Lipschitz map…
We estimate a median of $f(X_t)$ where $f$ is a Lipschitz function, $X$ is a L\'evy process and $t$ an arbitrary time. This leads to concentration inequalities for $f(X_t)$. In turn, corresponding fluctuation estimates are obtained under…
Exact eigendecomposition of large matrices is very expensive, and it is practically impossible to compute exact eigenvalues. Instead, one may set a more modest goal of approaching the empirical distribution of the eigenvalues, recovering…
We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…
In this paper we study the Dirichlet-to-Neumann map for solutions to mean value formulas on trees. We give two alternative definition of the Dirichlet-to-Neumann map. For the first definition (that involves the product of a "gradient" with…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We study the relations between the Lipschitz constant of $1$-field and the Lipschitz constant of the gradient canonically associated with this $1$-field. Moreover, we produce two explicit formulas that make up Minimal Lipschitz extensions…
Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…
We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the…
In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees.…
We are interested in measures of central tendency for a population on a network, which is modeled by a metric tree. The location parameters that we study are generalized Fr\'echet means obtained by minimizing the objective function $\alpha…
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
We elaborate the two-fold simplex-like structures of tree amplitudes in planar maximally supersymmetric Yang-Mills (N=4 SYM), through its connection to a mathematical structure known as the positive Grassmannian. Exploiting the reduced…
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…
We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…
We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…
We develop a method to calculate the column density distribution of the Lyman-alpha forest for column densities in the range $10^{12.5} - 10^{14.5} cm^{-2}$. The Zel'dovich approximation, with appropriate smoothing, is used to compute the…
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree ($T$, $d$) is a metric space such that between any…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.