scientific article; zbMATH DE number 1409903
From MaRDI portal
Publication:4940321
zbMath0933.05038MaRDI QIDQ4940321
Hosam M. Mahmoud, Robert T. Smythe
Publication date: 2 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Limit theorems in probability theory (60F99) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Insertion depth in power-weight trees ⋮ Isolating the most recent entry in a random recursive tree by random cuts ⋮ Normal Limit Law for Protected Node Profile of Random Recursive Trees ⋮ Degree distribution of the FKP network model ⋮ On leaf related statistics in recursive tree models ⋮ Depth of nodes in random recursive \(k\)-ary trees ⋮ Branches in scale-free trees ⋮ The containment profile of hyper-recursive trees ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ Periodic P\'olya urns and an application to Young tableaux ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Central limit theorems for urn models ⋮ On the degree distribution of the nodes in increasing trees ⋮ A class of random recursive tree algorithms with deletion ⋮ The power of choice in the construction of recursive trees ⋮ Profile of random exponential recursive trees ⋮ On the number of leaves in a random recursive tree ⋮ Note on the exponential recursive k-ary trees ⋮ Community modulated recursive trees and population dependent branching processes ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point ⋮ Scaling limits of \(k\)-ary growing trees ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ On densities for solutions to stochastic fixed point equations ⋮ Note on the outdegree of a node in random recursive trees ⋮ 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 ⋮ A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees ⋮ Trees grown under young-age preferential attachment ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ Weighted height of random trees ⋮ The height of increasing trees ⋮ Asymptotic results on Hoppe trees and their variations ⋮ Asymptotics in random recursive circuits ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ On edge-weighted recursive trees and inversions in random permutations ⋮ On the convergence of probabilities of first-order sentences for recursive random graph models ⋮ BUILDING RANDOM TREES FROM BLOCKS ⋮ Asymptotic Analysis of Hoppe Trees ⋮ On the distribution of distances between specified nodes in increasing trees ⋮ Supercritical percolation on large scale-free random trees ⋮ Random sprouts as internet models, and Pólya processes ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ Spectra of large random trees ⋮ A combinatorial approach to the analysis of bucket recursive trees ⋮ Central limit theorems for generalized Pólya urn models ⋮ A functional limit theorem for the profile of \(b\)-ary trees ⋮ Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ Width of a scale-free tree ⋮ Geometry of weighted recursive and affine preferential attachment trees ⋮ Population size versus runtime of a simple evolutionary algorithm ⋮ On symmetry of uniform and preferential attachment graphs ⋮ Branching random walks on binary search trees: convergence of the occupation measure ⋮ An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm ⋮ Large deviations for the leaves in some random trees ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees ⋮ On the Zagreb Index of Random Recursive Trees ⋮ Nonuniform recursive trees with vertex attraction depending on their labels ⋮ Correction terms for the height of weighted recursive trees ⋮ A Theory of Network Security: Principles of Natural Selection and Combinatorics ⋮ Dominating sets of random recursive trees ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs ⋮ A new approach to Pólya urn schemes and its infinite color generalization ⋮ On the internal structure of random recursive circuits
