Random mappings with constraints on coalescence and number of origins

DOI10.2140/PJM.1982.103.269zbMath0514.05033OpenAlexW2056829705MaRDI QIDQ1051000

Edward A. Bender, James Arney

Publication date: 1982

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1982.103.269

zbMATH Keywords

random digraphrandom mappingcoefficient of coalescence

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (18)

A calculus for the random generation of labelled combinatorial structures ⋮ The component counts of random functions ⋮ On the number of predecessors in constrained random mappings ⋮ Largest component in random combinatorial structures ⋮ Unnamed Item ⋮ Structural transition in random mappings ⋮ Quantifying noninvertibility in discrete dynamical systems ⋮ Random mappings with exchangeable in-degrees ⋮ On random walks for Pollard's rho method ⋮ Local properties of random mappings with exchangeable in-degrees ⋮ A probabilistic approach to value sets of polynomials over finite fields ⋮ Predecessors in Random Mappings ⋮ A limit theorem for the six-length of random functional graphs with a fixed degree sequence ⋮ Случайные преобразования множеств с ограничениями на параметры. I ⋮ Toward a theory of Pollard's rho method ⋮ Runs in labelled trees and mappings ⋮ Averaging sequences, deranged mappings, and a problem of Lampert and Slater ⋮ Statistical inference for a class of modified power series distributions with applications to random mapping theory

This page was built for publication: Random mappings with constraints on coalescence and number of origins