On the structure of random plane‐oriented recursive trees and their branches
From MaRDI portal
Publication:4696226
DOI10.1002/rsa.3240040204zbMath0773.05040OpenAlexW1972712905MaRDI QIDQ4696226
Jerzy Szymański, Hosam M. Mahmoud, Robert T. Smythe
Publication date: 29 June 1993
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240040204
Related Items (42)
ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH ⋮ Insertion depth in power-weight trees ⋮ Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases ⋮ Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls ⋮ On rotations in fringe-balanced binary trees ⋮ On the covariances of outdegrees in random plane recursive trees ⋮ ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ Branches in scale-free trees ⋮ Phase Changes in the Topological Indices of Scale-Free Trees ⋮ Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ Note on the heights of random recursive trees and random m‐ary search trees ⋮ Variance in randomized play-the-winner clinical trials ⋮ Central limit theorems for urn models ⋮ On the degree distribution of the nodes in increasing trees ⋮ Profile of random exponential recursive trees ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves ⋮ Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ Degree distributions in recursive trees with fitnesses ⋮ On several properties of a class of hybrid recursive trees ⋮ Shape Measures of Random Increasing k-trees ⋮ Euler index in uncertain graph ⋮ A bijection of plane increasing trees with relaxed binary trees of right height at most one ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Trees grown under young-age preferential attachment ⋮ The degree sequence of a scale-free random graph process ⋮ Dynamic Pólya-Eggenberger urns ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ Random sprouts as internet models, and Pólya processes ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees ⋮ Analysis of Statistics for Generalized Stirling Permutations ⋮ DRAWING MULTISETS OF BALLS FROM TENABLE BALANCED LINEAR URNS ⋮ Nonuniform recursive trees with vertex attraction depending on their labels ⋮ Dynamical models for random simplicial complexes ⋮ On a random graph evolving by degrees ⋮ 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. ⋮ Connectedness strength of two vertices in an uncertain graph ⋮ On the internal structure of random recursive circuits
Cites Work
This page was built for publication: On the structure of random plane‐oriented recursive trees and their branches
