On the number of predecessors in constrained random mappings
From MaRDI portal
Publication:1375862
DOI10.1016/S0167-7152(97)00045-XzbMATH Open0891.60009MaRDI QIDQ1375862FDOQ1375862
Authors: Bernhard Gittenberger
Publication date: 27 July 1998
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Recommendations
directed graphrandom mappingsasymptotic expression for the expected number of predecessorsgraph-representations
Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Stochastic analysis (60H99)
Cites Work
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Images and Preimages in Random Mappings
- Title not available (Why is that?)
- Marking in combinatorial constructions: Generating functions and limiting distributions
- Probability Distributions Related to Random Mappings
- Random mappings with constraints on coalescence and number of origins
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limit distribution of the number of nodes in low strata of random mapping
- Predecessors in random mappings
Cited In (2)
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)