Random recursive forests

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1994 English Publisher:WileyJournal:Random Structures & Algorithms, volume 5, pages 3-12 (issn: 1042-9832, eissn: 1098-2418,

Copyright policy )

Authors: Krystyna T. Balinska; Louis V. Quintas; Jerzy Szymanski;

doi: 10.1002/rsa.3240050103

Random recursive forests

- Summary
- Subjects
- Metrics

Abstract

AbstractA random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests. © 1994 John Wiley & Sons, Inc.

Related Organizations

Keywords

random recursive forest, Combinatorial probability, Random graphs (graph-theoretic aspects), random recursive trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	11
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average