The largest connected component in a random mapping

DOI10.1002/RSA.3240050109MaRDI QIDQ4288879zbMATH OpenOpenAlexFDO

Authors Jerzy Jaworski, Ljuben Mutafchiev

Publication date 24 April 1994

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

Full work available at URL https://doi.org/10.1002/rsa.3240050109

zbMATH Keywords

limiting distributionsrandom forestsrandom graphsrandom mapping

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 747042
• scientific article; zbMATH DE number 747029
• A simply obtained asymptotic expansion for the probability that a random mapping is connected

Cited in

(6)

• Size distribution of the largest component of a random \(a\)-mapping
• scientific article; zbMATH DE number 3874387 (Why is no real title available?)
• A random mapping with preferential attachment
• Moments and distributions of trajectories in slow random monads
• scientific article; zbMATH DE number 1545678 (Why is no real title available?)
• scientific article; zbMATH DE number 747029 (Why is no real title available?)

This page was built for publication: The largest connected component in a random mapping

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