Related papers: Grounded Lipschitz functions on trees are typicall…

It was already known that a p-adic, locally Lipschitz continuous semi-algebraic function is piecewise Lipschitz continuous, where the pieces can be taken semi-algebraic. We prove that if the function has locally Lipschitz constant 1, then…

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

We present a way to turn an arbitrary (unbounded) metric space $\mathcal{M}$ into a bounded metric space $\mathcal{B}$ in such a way that the corresponding Lipschitz-free spaces $\mathcal{F}(\mathcal{M})$ and $\mathcal{F}(\mathcal{B})$ are…

We consider deep neural networks with a Lipschitz continuous activation function and with weight matrices of variable widths. We establish a uniform convergence analysis framework in which sufficient conditions on weight matrices and bias…

We observe that embeddings into random metrics can be fruitfully used to study the $L_1$-embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new…

This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…

In the function field setting with a fixed characteristic, it was proven by the second and third authors that the values $\log \big|L\big(\frac12, \chi_D\big)\big|$ as $D$ varies over monic and square-free polynomials are asymptotically…

Necessary and sufficient conditions for Lipschitzness of the Lempert and Green functions are found in terms of their boundary behaviors.

We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…

We study the shape of the normalized stable L\'{e}vy tree $\mathcal{T}$ near its root. We show that, when zooming in at the root at the proper speed with a scaling depending on the index of stability, we get the unnormalized Kesten tree. In…

The Lipschitz constant of a neural network is connected to several important properties of the network such as its robustness and generalization. It is thus useful in many settings to estimate the Lipschitz constant of a model. Prior work…

We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size…

The convergence theory for the gradient sampling algorithm is extended to directionally Lipschitz functions. Although directionally Lipschitz functions are not necessarily locally Lipschitz, they are almost everywhere differentiable and…

Let $\mathrm{Lip}_0(M)$ be the space of Lipschitz functions on a complete metric space $(M,d)$ that vanish at a point $0\in M$. We investigate its dual $\mathrm{Lip}_0(M)^*$ using the de Leeuw transform, which allows representing each…

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

We propose a function-field analog of Pisot's $d$-th root conjecture on linear recurrences, and prove it under some "non-triviality" assumption. Besides a recent result of Pasten-Wang on B{\"u}chi's $d$-th power problem, our main tool,…

In this paper we model discontinuous extended real functions in pointfree topology following a lattice-theoretic approach, in such a way that, if $L$ is a subfit frame, arbitrary extended real functions on $L$ are the elements of the…

An invertible function is bi-Lipschitz if both the function and its inverse have bounded Lipschitz constants. Nowadays, most Normalizing Flows are bi-Lipschitz by design or by training to limit numerical errors (among other things). In this…

A partial order on the set of metric measure spaces is defined; it generalizes the Lipschitz order of Gromov. We show that our partial order is closed when metric measure spaces are equipped with the Gromov-weak topology and give a new…

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…