Related papers: Central and $L^p$-concentration of 1-Lipschitz map…

We present a semi-analytic model for the Lyman-$\alpha$ forest that is inspired by the Halo Model. This model is built on the absorption line decomposition of the forest. Flux correlations are decomposed into those within each absorption…

We study various generalizations of concentration of measure on the unit sphere, in particular by means of log-Sobolev inequalities. First, we show Sudakov-type concentration results and local semicircular laws for weighted random matrices.…

Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

This is a survey of the theory of real trees and their applications.

We introduce and study a natural notion of probabilistic 1-Lipschitz maps. We prove that the space of all probabilistic 1-Lipschitz maps defined on a probabilistic metric space G is also a probabilistic metric space. Moreover, when G is a…

We obtain dimension-free concentration inequalities for $\ell^p$-norms, $p\geq2$, of infinitely divisible random vectors with independent coordinates and finite exponential moments. Besides such norms, the methods and results extend to some…

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

Concentration results say that a sequence of random variables becomes progressively concentrated around the mean. Such results are common in the study of functions of random graphs. We introduce a real-valued logic with various aggregate…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…

On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of…

Let $X$ be a subset of a Hilbert space. We prove that if $v\colon X\to \mathbb{R}^m$ is such that \begin{equation*} \Big\lVert v(x)-\sum_{i=1}^m t_iv(x_i)\Big\rVert\leq \Big\lVert x-\sum_{i=1}^m t_ix_i\Big\rVert \end{equation*} for all…

Let $T$ be a locally finite tree equipped with a flow measure $m$. Let $\mathcal L$ be the flow Laplacian on $(T,m)$. We prove that the first order Riesz transform $\nabla \mathcal L^{-1/2}$ is bounded on $L^p(m)$ for $p\in (1,\infty)$.…

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height. The approach is simple but gives precise…

In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds…

We extend the recent result of G. Godefroy which concerns the existence of non-norm attaining Lipschitz maps in order to characterize the norm attainment toward vectors for Lipschitz maps in the general setting of underlying space. The main…

The N-tree approximation scheme, introduced in the context of random directed polymers, is here applied to the computation of the maximum Lyapunov exponent in a coupled map lattice. We discuss both an exact implementation for small…

We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality…