Live briefing
Everything about Random recursive tree
In probability theory, a random recursive tree is a rooted tree chosen uniformly at random from the recursive trees with a given number of vertices. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random recursive treeA 5-minute orientation
- Skim a recent paper: Depth of vertices with high degree in random recursive treesInfluential work since 2022
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: Asymptotic degree distribution in random recursive treesCited 71 times
- Go sideways: Tree (graph theory)A closely related topic
- Go sideways: Asymmetric graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Asymptotic degree distribution in random recursive trees
Random recursive trees and the elephant random walk
Total Path Length for Random Recursive Trees
Limit distribution for the maximum degree of a random recursive tree
Recursive construction of continuum random trees
High degrees in random recursive trees
Broadcasting on random recursive trees
Percolation on random recursive trees
🆕 Influential since 2022
Depth of vertices with high degree in random recursive trees
Estimating the history of a random recursive tree
On joint properties of vertices with a given degree or label in the random recursive tree
A law of the iterated logarithm for iterated random walks, with application to random recursive trees
A random recursive tree model with doubling events
📚 Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Discrete Mathematics and Its ApplicationsKenneth H. Rosen · 1988
Discrete mathematicsKenneth A. Ross · 1985
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Starting Out with JavaTony Gaddis · 2004
Introduction to Computing Using PythonLjubomir Perkovic · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Tree (graph theory) In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected…
- Asymmetric graph In graph theory, a branch of mathematics, an undirected graph is called an asymmetric graph if it has no nontrivial symmetries. Formally, an automorphism…
- Random binary tree In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees…
- Graph power In graph theory, a branch of mathematics, the kth power Gk of an undirected graph G is another graph that has the same set of vertices, but in which two…
- Expected linear time MST algorithm The expected linear time MST algorithm is a randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices…
- Component (graph theory) In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph…
- Planar separator theorem In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split into…
- Bethe lattice In statistical mechanics and mathematics, the Bethe lattice (also called a regular tree) is an infinite symmetric regular tree where all vertices have…