相关论文: High degrees of random recursive trees

We study the maximal degree of (sub)critical L{\'e}vy trees which arise as the scaling limits of Bienaym{\'e}-Galton-Watson trees. We determine the genealogical structure of large nodes and establish a Poissonian decomposition of the tree…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\ldots, X_{[n^t]}(k))_{t\geq 0}$, for each $k\in\mathbb N$.…

Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

We offer an alternative proof, using the Stein-Chen method, of Bollob\'{a}s' theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic…

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

Let $\Xi_n=\{\xi_1,\dots,\xi_n\}$ be a sample of $n$ independent points distributed in a regular closed element $K$ of the extended convex ring in $\mathbb{R}^d$ according to a probability measure $\mu$ on $K$, admitting a density function.…

Let $\{X_n\}_n$ be a sequence of freely independent, identically distributed non-commutative random variables. Consider a sequence $\{W_n\}_n$ of the renormalized spectral maximum of random variables $X_1,\cdots, X_n$. It is known that the…

In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…

We present a rigorous and precise analysis of the maximum degree and the average degree in a dynamic duplication-divergence graph model introduced by Sol\'e, Pastor-Satorras et al. in which the graph grows according to a…

We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

We study several parameters of a random Bienaym\'e-Galton-Watson tree $T_n$ of size $n$ defined in terms of an offspring distribution $\xi$ with mean $1$ and nonzero finite variance $\sigma^2$. Let $f(s)={\bf E}\{s^\xi\}$ be the generating…

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

We prove that for each $k\ge0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, so that the expected number of vertices of degree $k$ is asymptotically $d_k n$, and moreover…

We present an analysis of the depth-first search algorithm in a random digraph model with independent outdegrees having a geometric distribution. The results include asymptotic results for the depth profile of vertices, the height (maximum…

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…

Let $X=\{x_1,\ldots,x_n\} \subset \mathbb R^d$ be an $n$-element point set in general position. For a $k$-element subset $\{x_{i_1},\ldots,x_{i_k}\} \subset X$ let the degree ${\rm deg}_k(x_{i_1},\ldots,x_{i_k})$ be the number of empty…

We show that a randomly perturbed digraph, where we start with a dense digraph $D_\alpha$ and add a small number of random edges to it, will typically contain a fixed orientation of a bounded degree spanning tree. This answers a question…