Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

DOI10.1016/J.SPA.2023.01.012MaRDI QIDQ2689909zbMATH OpenOpenAlexFDO

Authors Laura Eslava, Bas Lodewijks, Marcel Ortgiese

Publication date 14 March 2023

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2109.15270

zbMATH Keywords

degree distributionmaximum degreerandom environmentrandom recursive graphuniform DAGweighted recursive graph

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Limit distribution for the maximum degree of a random recursive tree
• Correction terms for the height of weighted recursive trees
• scientific article; zbMATH DE number 17686
• High degrees in random recursive trees
• Asymptotic degree distribution in random recursive trees

Cites work

• An Introduction to the Theory of Point Processes
• Asymptotic results on Hoppe trees and their variations
• Condensation phenomena in preferential attachment trees with neighbourhood influence
• Correction terms for the height of weighted recursive trees
• Degree distributions in recursive trees with fitnesses
• Depth of vertices with high degree in random recursive trees
• Dynamical models for random simplicial complexes
• Geometry of weighted recursive and affine preferential attachment trees
• High degrees in random recursive trees
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Limit distribution for the maximum degree of a random recursive tree
• NIST digital library of mathematical functions
• On the asymptotic behaviour of random recursive trees in random environments
• Random walks with preferential relocations and fading memory: a study through random recursive trees
• The strong convergence of maximal degrees in uniform random recursive trees and dags

Cited in

(8)

• Limit distribution for the maximum degree of a random recursive tree
• Correction terms for the height of weighted recursive trees
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
• Height of weighted recursive trees with sub-polynomially growing total weight
• The maximal degree in random recursive graphs with random weights
• Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
• The location of high-degree vertices in weighted recursive graphs with bounded random weights

Describes a project that uses

Uses Software

• DLMF

This page was built for publication: Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689909)