⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

March 1, 1998Random Structures and Algorithms

On the log-product of the subtree-sizes of random trees

A. Meir J. W. Moon

View at Publisher

Ask AI

Bookmark

Share

Abstract

We determine the asymptotic behavior of the expected value and the variance of the log-product of the subtree-sizes of trees Tn belonging to simply generated families of rooted trees.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Meir et al. (1998) studied this question.

synapsesocial.com/papers/6ab1dc3822725abcd3a9ad0f https://doi.org/10.1002/(sici)1098-2418(199803)12:2<197::aid-rsa3>3.0.co;2-s

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Resident Fitness Computation in Linear Time and Other Algorithmic Aspects of Interacting TrajectoriesRandom Structures and Algorithms · Fri,
2Random Friend TreesRandom Structures and Algorithms · Thu,
3On the Sampling Entropy of PermutonsRandom Structures and Algorithms · Wed,
4Erdős‐Rogers Functions for Arbitrary Pairs of GraphsRandom Structures and Algorithms · Fri,
5In‐and‐Out: Algorithmic Diffusion for Sampling Convex BodiesRandom Structures and Algorithms · Sun,

More from Random Structures and Algorithms

Finding the Root in Random Nearest Neighbor TreesSun,
The Extinction of the Contact Process in a One‐Dimensional Random Environment With Long‐Range InteractionsSun,
Size‐Ramsey Numbers of Structurally Sparse GraphsSun,
Cyclic Subsets of TournamentsSun,
Massive Spanning Forests on the Complete Graph: Exact Distribution and Local LimitFri,