相关论文: Central and $L^p$-concentration of 1-Lipschitz map…

In this paper, we study the L\'{e}vy-Milman concentration phenomenon of 1-Lipschitz maps into infinite dimensional metric spaces. Our main theorem asserts that the concentration to an infinite dimensional $\ell^p$-ball with the…

The property of measure concentration is that an arbitrary 1-Lipschitz function $f:X\to \mathbb{R}$ on an mm-space $X$ is almost close to a constant function. In this paper, we prove that if such a concentration phenomenon arise, then any…

In this paper, from the viewpoint of the concentration theory of maps, we study a compact group and a L\'{e}vy group action to a large class of metric spaces, such as R-trees, doubling spaces, metric graphs, and Hadamard manifolds.

An inequality of K. Marton shows that the joint distribution of a Markov chain with uniformly contracting transition kernels exhibits concentration. We prove an analogous inequality for broadcast models on finite trees. We use this…

We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…

In this paper, we prove an exponential and Ganssian concentration inequality for 1-Lipschitz maps from mm-spaces to Hadamard manifolds. In particular, we give a complete answer to a question by M. Gromov.

There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps…

Degrading performance of indexing schemes for exact similarity search in high dimensions has long since been linked to histograms of distributions of distances and other 1-Lipschitz functions getting concentrated. We discuss this…

We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.

The present work provides an original framework for random matrix analysis based on revisiting the concentration of measure theory from a probabilistic point of view. By providing various notions of vector concentration ($q$-exponential,…

The measure concentration property of an mm-space $X$ is roughly described as that any 1-Lipschitz map on $X$ to a metric space $Y$ is almost close to a constant map. The target space $Y$ is called the screen. The case of $Y=\mathbb{R}$ is…

We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…

We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…

Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…

We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…

We establish the sharp rate of continuity of extensions of $\mathbb{R}^m$-valued $1$-Lipschitz maps from a subset $A$ of $\mathbb{R}^n$ to a $1$-Lipschitz maps on $\mathbb{R}^n$. We consider several cases when there exists a $1$-Lipschitz…

The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V(G)$ which contain $v$. In this paper Steiner $3$-eccentricity is studied on trees. Some general properties of the Steiner…

We prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process…

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…

We consider a system of weakly coupled singularly perturbed semilinear elliptic equations. First, we obtain a Lipschitz regularity result for the associated ground energy function $\Sigma$ as well as representation formulas for the left and…