On the number of predecessors in constrained random mappings

DOI10.1016/S0167-7152(97)00045-XMaRDI QIDQ1375862zbMATH OpenFDO

Authors Bernhard Gittenberger

Publication date 27 July 1998

Published in Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

directed graphrandom mappingsasymptotic expression for the expected number of predecessorsgraph-representations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Stochastic analysis (60H99)

Recommendations

• Predecessors in random mappings
• scientific article; zbMATH DE number 3956091
• scientific article; zbMATH DE number 1380606
• scientific article; zbMATH DE number 4209190

Cites work

• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 1142298 (Why is no real title available?)
• scientific article; zbMATH DE number 4113631 (Why is no real title available?)
• scientific article; zbMATH DE number 3238093 (Why is no real title available?)
• scientific article; zbMATH DE number 3307941 (Why is no real title available?)
• Images and Preimages in Random Mappings
• Marking in combinatorial constructions: Generating functions and limiting distributions
• Predecessors in random mappings
• Probability Distributions Related to Random Mappings
• Random mappings with constraints on coalescence and number of origins
• Singularity Analysis of Generating Functions
• The limit distribution of the number of nodes in low strata of random mapping

Cited in

(2)

• Predecessors and successors in random mappings with exchangeable in-degrees
• scientific article; zbMATH DE number 3956091 (Why is no real title available?)

This page was built for publication: On the number of predecessors in constrained random mappings

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