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

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformlyat random without replacement and let $W_k$, $2 \le k \le n$, be the length ofthe subtree spanned by the first $k$ leaves. We consider the question, "Can $T$be identified (up to isomorphism) by the joint probability distribution of therandom vector $(W_2, \ldots, W_n)$?" We show that if $T$ is known {\em apriori} to belong to one of various families of edge-weighted trees, then theanswer is, "Yes." These families include the edge-weighted trees withedge-weights in general position, the ultrametric edge-weighted trees, andcertain families with equal weights on all edges such as $(k+1)$-valent androoted $k$-ary trees for $k \ge 2$ and caterpillars.

Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves