On the deepest cycle of a random mapping

DOI10.1016/J.JCTA.2024.105875zbMATH Open1546.60026MaRDI QIDQ6543047

Steven R. Finch, Ljuben Mutafchiev

Publication date: 24 May 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

limit distributionlongest cyclelargest componentdeepest cyclerandom functional graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional graphs of polynomials over finite fields
• Logarithmic combinatorial structures: A probabilistic approach
• Factorization of the Eighth Fermat Number
• A monte carlo method for factorization
• The stationary distribution of the infinitely-many neutral alleles diffusion model
• A Problem of the Allocation of Particles in Cells and Random Mappings
• Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
• The Asymptotic Distribution of Maximum Tree Size in a Random Forest
• Probabilistic Methods in Combinatorial Analysis
• Cycle Length in a Random Function
• Probability of Indecomposability of a Random Mapping Function

This page was built for publication: On the deepest cycle of a random mapping

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