The number of descendants in a random directed acyclic graph

DOI10.1002/rsa.21195arXiv2302.12467OpenAlexW4388497949MaRDI QIDQ6201041

Svante Janson

Publication date: 25 March 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

Yule treerandom circuitrandom acyclic digraph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics in random recursive circuits
• Distribution function inequalities for martingales
• On the internal structure of random recursive circuits
• Long and short paths in uniform random recursive dags
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• Longest Path Distance in Random Circuits
• On the Expected Depth of Random Circuits
• On the depth of randomly generated circuits
• On martingale tail sums in affine two-color urn models with multiple drawings
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• Probability: A Graduate Course
• A limit law for outputs in random recursive circuits

This page was built for publication: The number of descendants in a random directed acyclic graph