Asymptotic degree distribution in random recursive trees
From MaRDI portal
Publication:4667857
DOI10.1002/rsa.20046zbMath1059.05094OpenAlexW4237831634MaRDI QIDQ4667857
Publication date: 21 April 2005
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20046
Related Items (44)
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Random recursive hypergraphs ⋮ Distributions in a class of Poissonized urns with an application to Apollonian networks ⋮ The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases ⋮ On the covariances of outdegrees in random plane recursive trees ⋮ On leaf related statistics in recursive tree models ⋮ ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ The collision spectrum of \(\Lambda\)-coalescents ⋮ Depth of nodes in random recursive \(k\)-ary trees ⋮ Phase Changes in the Topological Indices of Scale-Free Trees ⋮ High degrees in recursive trees ⋮ From trees to graphs: collapsing continuous-time branching processes ⋮ Periodic P\'olya urns and an application to Young tableaux ⋮ Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes ⋮ On the degree distribution of the nodes in increasing trees ⋮ A class of random recursive tree algorithms with deletion ⋮ Profile of random exponential recursive trees ⋮ Generalized Stirling permutations, families of increasing trees and urn models ⋮ Tree evolution processes for bucket increasing trees ⋮ Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks ⋮ Community modulated recursive trees and population dependent branching processes ⋮ Broadcasting‐induced colorings of preferential attachment trees ⋮ DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION ⋮ THE ASYMPTOTIC DEGREE DISTRIBUTIONS OF RANDOM FAST GROWTH MODELS FOR TREELIKE NETWORKS ⋮ On several properties of a class of hybrid recursive trees ⋮ Fluctuations of balanced urns with infinitely many colours ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ Random tree growth by vertex splitting ⋮ Markov branching in the vertex splitting model ⋮ Deterministic Edge Weights in Increasing Tree Families ⋮ On edge-weighted recursive trees and inversions in random permutations ⋮ Dynamic Pólya-Eggenberger urns ⋮ On the distribution of distances between specified nodes in increasing trees ⋮ The Hitting Time for the Height of a Random Recursive Tree ⋮ The degree profile and weight in Apollonian networks and k-trees ⋮ Analysis of Statistics for Generalized Stirling Permutations ⋮ A non-increasing tree growth process for recursive trees and applications ⋮ DRAWING MULTISETS OF BALLS FROM TENABLE BALANCED LINEAR URNS ⋮ Periodic Pólya urns, the density method and asymptotics of Young tableaux ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns. ⋮ On joint properties of vertices with a given degree or label in the random recursive tree
Cites Work
This page was built for publication: Asymptotic degree distribution in random recursive trees
