1.1 The model and the motivation
In our previous work [Cai010], we introduced the -cut number for rooted graphs. Let be an integer. Let be a connected graph of nodes with exactly one node labeled as the root. We remove nodes from the graph using this random procedure:
Initially set every node’s cut-counter to zero, i.e., no node has ever been cut.
Choose one node uniformly at random from the component containing the root and increase its cut-counter by one, i.e., we cut the selected node once.
If this node’s cut-counter hits , i.e., it has been cut times, then remove it from the graph.
If the root has been removed, then stop. Otherwise, go to step 2.
We call the (random) total number of cuts needed for this procedure to end the -cut number and denote it by . Note that in our model nodes are only removed after having been cut times. The traditional cutting model corresponds to the case that .
We can also cut and remove edges instead of nodes using the same process with the modification that we stop when the root has been isolated. We denote the total number of cuts needed for this edge removing process to end by .
The -cut number can be seen as a measure of the difficulty for the destruction of a resilient network. For example, in a botnet, a bot-master controls a large number of compromised computer (bots) for various cybercrimes. To counter attack a botnet means to reduce the number of bots reachable from the bot-master by fixing compromised computers . We can view a botnet as a graph and fixing a computer as removing a node from the graph. If we assume that each compromised computer takes -attempts to clean, and each attempt aims at a computer chosen uniformly at random, then the -cut number is precisely the number of attempts of cleaning up needed to completely destroy a botnet.
The case , i.e., the traditional cutting model has been well-studied. It was first introduced by meir70 for uniform random Cayley trees. janson04, janson06 studied one-cuts in binary trees and conditioned Galton-Watson trees. ab14 simplified the proof for the limit distribution of one-cuts in conditioned Galton-Watson trees. The cutting model has also been studied in random recursive trees, see meir74, iksanov07, and drmota09. For binary search trees and split trees, see holmgren10, holmgren11.
In our previous work [Cai010], we mainly analyzed , the -cut number for a path of length , which generalizes the record number in a uniform random permutation. In this paper, we continue our investigation in complete binary trees, i.e., binary trees in which each level is full except possibly for the last level, and the nodes at the last level occupy the leftmost positions. If the last level is also full, then we call the tree a full binary tree.
1.2 An equivalent model
Let be a complete binary tree of size . Let and with the root of the tree as the root of the graph. There is an equivalent way to define . Let
be i.i.d. exponential random variables with mean. Let . Imagine each node in has an alarm clock and node ’s clock fires at times . If we cut a node when its alarm clock fires, then due to the memoryless property of exponential random variables, we are actually choosing a node uniformly at random to cut.
However, this also means that we are cutting nodes that have already been removed from the tree. Thus for a cut on node at time (for some ) to be counted in , none of its ancestors can have already been cut times, i.e.,
where denotes that is an ancestor of . When the event in (1.1) happens, we say that (or simply ) is an -record and let
be the indicator random variable for this event. Letbe the total number of -records, i.e., . Then obviously . We use this equivalence for the rest of the paper.
By assigning alarm clocks to edges instead of nodes, we can define the edge version of -records and have .
1.3 The main results
To introduce the main results, we need some notations. Let denote the fractional part of , i.e., . Let be the Gamma function [DLMF, 5.2.1]. Let be the upper incomplete Gamma function [DLMF, 8.2.2]. Let . Let be the inverse of . Let .
Assume the same conditions as in Theorem 1.1. Then
The same holds true for .
We do not have a closed form for . But for specific they are easy to compute with computer algebra systems. When , i.e., when , (1.6) reduces to
and since , (1.5) reduces to
In other words, we recover the result for the traditional cutting model in complete binary trees by [Theorem 1.1]janson04. When , (1.6) reduces to
In Remark 1.5 of [janson04], janson04 mentioned that when , if and are independent copies of , then , but the corresponding statement for three copies of is false. In other words, is roughly similar to a -stable distribution. This extends to general in the sense that
with . This follows by computing the characteristic functions of both sides using (1.4) and by noticing that
In the rest of the paper, we will first compute the expected number and variance of-records conditioning on , where denotes the root. Then we show that the fluctuation of the total number of -records from its mean is more or less the same as the sum of such fluctuations in each subtree rooted at height , conditioning on what happens below height . This sum can be further approximated by a sum of independent random variables. Finally, we apply a classic theorem regarding the convergence to infinitely divisible distributions by [Theorem 15.23]kallenberg02 to prove Theorem 1.1. Then Theorem 1.2 follows immediately, see section 6.
The proof follows a similar path as janson04 did for the case . However, the analysis for is significantly more complicated.
holmgren10, holmgren11 showed that when , has similar behavior in binary search trees and split trees as in complete binary trees. We are currently trying to prove this for .
2 Some more notations
We collect some of the notations which are used frequently in this paper.
Let be the Gamma function [DLMF, 5.2.1], i.e.,
Note that for . Let and be the upper and lower incomplete Gamma functions respectively [DLMF, 8.2], i.e.,
Thus . Let . We also define .
Let . Let be the inverse of . Note that and .
Let be the height of a complete binary tree of nodes, i.e., . Let . Let .
For node , let be the height of , i.e., the distance (number of edges) between and the root, which we denote by .
Let be conditioned on , i.e., the number of -record, excluding the root, conditioned on that the root is removed (cut the -th time) at time .
For functions and , we write uniformly on to indicate that there exists a constant such that for all . The word uniformly stresses that does not depend on .
We use the notation and in the usual sense, see [janson11].
The notations denote constants that depend on and other parameters but do not depend on .
3 The expectation and the variance
There exist constants such that
uniformly for all , where .
Using the series expansion of given by [DLMF, 8.7.3], it is easy to verify that
uniformly for . Taking the binomial expansion of the right-hand-side and ignoring small order terms gives (3.3). ∎
In the case that the tree is full, i.e., , then
where the implicit constants are defined in the proof.
Again, although we do not have closed forms for the constants , they are not difficult to compute with computer algebra systems. For example, for , we have . For , we have
Let be a node of height . For to be an -record, conditioning on , we need and for every that is an ancestor of . Recall that , where are i.i.d. exponential random variables. Thus are i.i.d. random variables and is a random variable, which are independent from everything else. (See Theorem 2.1.12 of [durrett10]
The Gamma distribution has the density function
which implies . Thus,
When the tree is full, each level has nodes. Thus in this case
as by [DLMF, 8.7.3]. Thus uniformly for with ,
Note that for and ,
For , it is not difficult to verify that the part of the integral in (3.10) over and the difference are both exponentially small and can be absorbed by the error term. ∎
If , then
When is a node of height , by (3.9),
where Expanding by [DLMF, 8.7.3] and using Lemma 3.1, we have, uniformly for with
The next lemma computes when the tree is not full. The reason why it is formulated in terms of will be clear in the proof of Lemma 4.2.
Let . Let
If , then
Assume first that
. When the tree is not necessarily full, the estimate ofin (3.5) over counts the number of nodes at height by . The contribution of the over counted nodes in (3.5) can be estimated using (3.14). Subtracting this part from (3.5) gives (3.19).
The only other possible case is that and the tree is full. The result follows easily by adding an extra node at height , computing the total expectation of -records for this tree by the case already studied, and subtracting from (3.14). ∎
where is defined in (1.3).
Lemma 3.4 gives an asymptotic expansion of . To get rid of this conditioning, first consider a full binary tree of height , i.e., a tree of size . It is easy to see that is exactly twice of for . This solves the case when the tree is full.
The general case can be solved similarly. Consider a binary tree, with the right subtree of the root being (possibly not full), and the left subtree of the root being , i.e., a full binary tree of height . This tree has size . Thus is the expected number of -records in , plus the expected number of -record in , which is by the previous paragraph. Thus
The simplest case that and the tree is full can also be computed directly by noticing that
where denotes Hurwitz-Lerch zeta function [DLMF, 25.14], denotes the polylogarithm function [DLMF, 25.12], and the last step uses an asymptotic expansion of given in [Cai011].
Consider two nodes, and of heights and respectively. Let be the node that is furthest away from the root among the common ancestor of and . Let .
We call the pair good if and . Otherwise we call it bad. Assume for now that is good.
Let be the path from the root to . Let .
Note that conditioning on and , the events that is an -record and that is an -record are independent. Thus by Lemma 3.3 and the assumption that is good,
Since is increasing in , (3.24) implies that, after averaging over ,
On the other hand, again by Lemma 3.3 and the assumption that is good,
Therefore, by the definition of in (3.15), the first order term of the above is
For and ,
since is decreasing and . Thus when is good,
Canceling other terms in (3.27) in a similar way shows that
Given , there are at most choices of . Thus
The number of bad pairs is at most
as the lemma claims. ∎
Recall that . Let be the nodes of height . Let be the minimum of the for all nodes on the path between the root and .
The proof uses the estimate of the variance in Lemma 3.5 and exactly the same argument of Lemma 2.3 in [janson04]. We omit the details. ∎
4 Transformation into a triangular array
In this section, we prove Proposition 4.1, which shows that , properly rescaled and shifted, can be written as a sum of independent random variables. Three technical lemmas Lemma 4.1, Lemma 4.2, Lemma 4.3 are needed first.
Let and . Then
Recall that has the distribution of the minimum of independent random variables. Let . Let be a constant. Then
the density of is
by the derivative formula
see [DLMF, 8.8.13]. For and , by the inequality [DLMF, 8.10.11],
For and , also by [DLMF, 8.10.11],
where the last inequality follows from that for and . Therefore, similar to (4.11),
Thus we have (4.4).
Since is decreasing when , for
Let be the size of the subtree rooted at . Then
By Lemma 3.4, we have
where . (This is why we need to formulate Lemma 3.4 in terms of –here is either the height of subtree rooted at , or it is the height of the subtree plus one and the subtree is full.)
We now convert this into an expression in . Let
Then using the identity ,
The first term of the above expression is
In the end, it follows from Lemma 4.1 and simple asymptotic computations that
Thus by (3.35), we have
from which (4.18) follows immediately. ∎
Let be the size of the subtree rooted at the node . Then
Recall that is the minimum of independent random variables , where denotes the path from the root to . Let
. The probability that at least twoare less than is
where we use the approximation of in (3.1) and the series expansion of in [DLMF, 8.7.3]. Thus the probability that this happens for some is .
5 Convergence of the triangular array
By taking subsequences, we can assume that as , and . Thus , , where . Moreover, and
which implies .
Let , which are deterministic. It follows from Lemma 5.1 that we can apply Theorem 15.28 in [kallenberg02] with , to show that the triangular array converges in distribution to (defined in Theorem 1.1). Thus by Proposition 4.1, Theorem 1.1 follows immediately.
Recall that in (4.2) we define
where are i.i.d. random variables. Thus , where , see (3.8). Assume for now that . Then, for all fixed .
By [DLMF, 8.10.11], for ,
Letting , (5.6) implies that
where . Similarly, it follows from (5.6) that
where the last step uses that . Thus we can apply the series expansion of near in [DLMF, 8.7.3] to (5.5) to get
Therefore this probability tends to zero for all fixed .
We reuse the notion of good and bad nodes defined in [janson04, pp. 250]. A good node has for some with . All other nodes with height at most are called bad. [eq. 20]janson04 showed that
and that the number of bad nodes is .
(By the inequality (5.7), the function is well-defined on .)
Let . Then . In other words for . Thus
Comparing with (1.5), we see that
Assume for now that . Let , i.e., . By the upper bound of in (5.16), . Thus we are allowed to write this integral as
For , by the definition of in (5.15),
Using the derivative formula (4.9), one can verify that
We next compute . By definition, if is good, then with . Let
be the probability density function of. Differentiating (5.10) shows that uniformly for all and ,
Using again the derivative formula (4.9), one can verify that
Note also that if . Thus
If , then
for large. Thus (5.29) reduces to
If , then
and (5.29) reduces to
So we distinguish three cases, , , and , which we refer to as the low part, the high part, and the last part.
The number of good nodes with , is given by (5.11). Thus for the low part, i.e., when is a good node with and ,
And for the last part, i.e., when is good node with ,
Together with (5.23),
By the upper bound of in (5.16), . Thus we are allowed to write this integral as