Related papers: Set-valued recursions arising from vantage-point t…

We obtain a polynomial upper bound on the mixing time $T_{CHR}(\epsilon)$ of the coordinate Hit-and-Run random walk on an $n-$dimensional convex body, where $T_{CHR}(\epsilon)$ is the number of steps needed in order to reach within…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We investigate the rate of convergence in the central limit theorem for convex sets. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the…

To any free group automorphism, we associate a universal (cone of) limit tree(s) with three defining properties: first, the tree has a minimal isometric action of the free group with trivial arc stabilizers; second, there is a unique…

We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

A. Iosevich and K. Taylor showed that compact subsets of $\mathbb R^d$ with Hausdorff dimension greater than $(d+1)/2$ contain trees with gaps in an open interval. Under the same dimensional threshold, we prove the analogous result where…

We develop a finite-sample, design-based theory for random forests in which each tree is a randomized conditional predictor acting on fixed covariates and the forest is their Monte Carlo average. An exact variance identity separates Monte…

We study the minimal/endogenous solution $R$ to the maximum recursion on weighted branching trees given by $$R\stackrel{\mathcal{D}}{=}\left(\bigvee_{i=1}^NC_iR_i \right)\vee Q,$$ where $(Q,N,C_1,C_2,\dots)$ is a random vector with $N\in…

By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…

We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…

Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ vertices that can be deleted, so that $H(G - S)$ is at…

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Upper and lower bounds are derived for the Gaussian mean width of the intersection of a convex hull of $M$ points with an Euclidean ball of a given radius. The upper bound holds for any collection of extreme point bounded in Euclidean norm.…

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…

We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…

We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…