English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this note we consider the $k$th level of the uniform random recursive treeafter $n$ steps, and prove that the proportion of nodes with degree greaterthan $t\log n$ converges to $(1-t)^k$ almost surely, as $n\to\infty$, for every$t\in(0,1)$. In addition, we show that the number of degree $d$ nodes in thefirst level is asymptotically Poisson distributed with mean 1; moreover, theyare asymptotically independent for $d=1,2,...$.

Degree distribution in the lower levels of the uniform recursive tree