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

DOI10.1016/j.spa.2023.01.012OpenAlexW3204705411MaRDI QIDQ2689909

Laura Eslava, Bas Lodewijks, Marcel Ortgiese

Publication date: 14 March 2023

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

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

zbMATH Keywords

random environmentdegree distributionmaximum degreerandom recursive graphuniform DAGweighted recursive graph

Mathematics Subject Classification ID

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

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit distribution for the maximum degree of a random recursive tree
• NIST digital library of mathematical functions
• Geometry of weighted recursive and affine preferential attachment trees
• Dynamical models for random simplicial complexes
• Correction terms for the height of weighted recursive trees
• Condensation phenomena in preferential attachment trees with neighbourhood influence
• Asymptotic results on Hoppe trees and their variations
• On the asymptotic behaviour of random recursive trees in random environments
• High degrees in random recursive trees
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• Depth of vertices with high degree in random recursive trees
• Random walks with preferential relocations and fading memory: a study through random recursive trees
• An Introduction to the Theory of Point Processes
• Degree distributions in recursive trees with fitnesses