On random trees
From MaRDI portal
Publication:4431327
DOI10.1556/SScMath.39.2002.1-2.9zbMath1026.05095OpenAlexW1963890374MaRDI QIDQ4431327
Publication date: 20 October 2003
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1556/sscmath.39.2002.1-2.9
Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)
Related Items
Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting), Phase Changes in the Topological Indices of Scale-Free Trees, Condensation phenomena in preferential attachment trees with neighbourhood influence, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Influence of the seed in affine preferential attachment trees, On a 2-parameter class of scale free random graphs, On the asymptotic normality of estimating the affine preferential attachment network models with random initial degrees, Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves, On Bollobás‐Riordan random pairing model of preferential attachment graph, THE ASYMPTOTIC DEGREE DISTRIBUTIONS OF RANDOM FAST GROWTH MODELS FOR TREELIKE NETWORKS, Degree distributions in recursive trees with fitnesses, On several properties of a class of hybrid recursive trees, Large deviations for the degree structure in preferential attachment schemes, On a preferential attachment and generalized Pólya's urn model, The \(k\)-cut model in deterministic and random trees, Scaling limits and influence of the seed graph in preferential attachment trees, Growth of preferential attachment random graphs via continuous-time branching processes, Diameters in preferential attachment models, The clustering coefficient of a scale-free random graph, Asymptotic normality of degree counts in a preferential attachment model, Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees, Width of a scale-free tree, Preferred attachment in affiliation networks, Sublinear preferential attachment combined with a growing number of choices, Large deviations for the leaves in some random trees, Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model
