论文信息 - On the Expected Depth of Random Circuits

On the Expected Depth of Random Circuits

In this paper we analyse the expected depth of random circuits of fixed fanin f. Such circuits are built a gate at a time, with the f inputs of each new gate being chosen randomly from among the previously added gates. The depth of the new gate is defined to be one more than the maximal depth of its input gates. We show that the expected depth of a random circuit with n gates is bounded from above by ef ln n and from below by 2.04 … f ln n.

K. Mehlhorn | S. Arya | M. Golin

[1] Anatol Rapoport,et al. Distribution of nodes of a tree by degree , 1970 .

[2] J. Moon,et al. Combinatorics: The distance between nodes in recursive trees , 1974 .

[3] Hosam M. Mahmoud,et al. On the Distribution of Leaves in Rooted Subtrees of Recursive Trees , 1991 .

[4] R. A. Doney,et al. 4. Probability and Random Processes , 1993 .

[5] Josep Díaz Cort,et al. On the expected depth of boolean circuits , 1994 .

[6] Boris G. Pittel,et al. Note on the Heights of Random Recursive Trees and Random m-ary Search Trees , 1994, Random Struct. Algorithms.

[7] Fatos Xhafa,et al. On the Depth of Randomly Generated Circuits , 1996, ESA.