We propose a method for cutting down a random recursive tree that focuses on its higher-degree vertices. Enumerate the vertices of a random recursive tree of size n according to the decreasing order of their degrees; namely, let $(v^{(i)})_{i=1}^{n}$ be such that $\deg(v^{(1)}) \geq \cdots \geq \deg (v^{(n)})$. The targeted vertex-cutting process is performed by sequentially removing vertices $v^{(1)}, v^{(2)}, \ldots, v^{(n)}$ and keeping only the subtree containing the root after each removal. The algorithm ends when the root is picked to be removed. The total number of steps for this procedure, $K_n$, is upper bounded by $Z_{\geq D}$, which denotes the number of vertices that have degree at least as large as the degree of the root. We prove that $\ln Z_{\geq D}$ grows as $\ln n$ asymptotically and obtain its limiting behavior in probability. Moreover, we obtain that the kth moment of $\ln Z_{\geq D}$ is proportional to $(\!\ln n)^k$. As a consequence, we obtain that the first-order growth of $K_n$ is upper bounded by $n^{1-\ln 2}$, which is substantially smaller than the required number of removals if, instead, the vertices were selected uniformly at random.

A linear DNA molecule may be labelled at a fixed locus by a minute complementary radioactive molecule. A collection of identical molecules is to be so labelled and each one independently cut at a random number, N, of random places, X (N Poisson, X uniform). Fragments containing the label are to be collected and assayed by length. It is shown that the recovery pattern (fragment length distribution) contains a jump discontinuity at the fixed locus and may be used to determine the distance between the attachment site and the nearest end of the molecule.

The recovery pattern under the hypothesis that the collection of molecules are circularly permuted, i.e. the labelled locus is uniformly distributed over the length of the molecule, does not contain such discontinuities. The case where the labelling molecule has a non-negligible extent is also treated.

Experiments involving random enzymatic or radioactive multiple cutting of single strands in double stranded DNA will occasionally cut it at pairs of positions on opposite strands that are within about 12 base pairs. In this case the DNA may unravel and come apart. The distribution of closest opposing breaks as a function of λ, the incidence of breaks per unit length, is obtained and graphs of the probability of critical distances as functions of λ are plotted. It is shown that for very large λ the distance between closest opposite breaks is approximately exponential with parameter ½λ2.