Skip to main content
SpringerLink
Log in

On random mapping patterns

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Random mapping patterns may be represented by unlabelled directed graphs in which each point has out-degree one. We determine the asymptotic behaviour of various parameters associated with such graphs, such as the expected number of points belonging to cycles and the expected number of components.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. G. de Bruijn andD. A. Klarner, Multisets of aperiodic cycles,SIAM J. Alg. Disc. Math. 3 (1982), 359–368.

    Article  MATH  Google Scholar 

  2. G. Darboux, Mémoire sur l’approximation des fonctions de très grands nombres, et sur une classe étendu développements en série,J. Math. Pures et Appliquées 4 (1878), 5–56.

    Google Scholar 

  3. F. Harary, The number of functional digraphs,Math. Ann. 138 (1959), 203–210.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Harary andE. Palmer,Graphical Enumeration, Academic Press, New York, 1973.

    MATH  Google Scholar 

  5. B. Harris, Probability distributions related to random mappings,Ann. Math. Statist. 31 (1960), 1045–1062.

    MathSciNet  MATH  Google Scholar 

  6. L. Katz, Probability of indecomposability of a random mapping function,Ann. Math. Statist. 26 (1955), 512–517.

    MathSciNet  MATH  Google Scholar 

  7. M. D. Kruskal, The expected number of components under a random mapping function, Amer. Math. Monthly61 (1954), 392–397.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Jungen, Sur les séries de Taylor n’ayant que des singularités algébricologarithmiques sur leur cercle de convergence,Comm. Math. Hel. 3 (1931), 266–306.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Meir andJ. W. Moon, Path edge-covering constants for certain families of trees,Util. Math. 14 (1978), 313–333.

    MATH  MathSciNet  Google Scholar 

  10. J. W. Moon, Counting Labelled Trees,Canadian Mathematical Congress, Montreal, 1970.

  11. R. C. Read, A note on the number of functional digraphs,Math. Ann. 143 (1961), 109–110.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Rényi, On connected graphs, I,Publ. Math. Inst. Hung. Acad. Sci. 4 (1959), 385–388.

    MATH  Google Scholar 

  13. J. Riordan, Enumeration of linear graphs for mappings of finite sets,Ann. Math. Statist. 33 (1962), 178–185.

    MathSciNet  MATH  Google Scholar 

  14. R. Otter, The number of trees,Ann. of Math. 49 (1948), 583–599.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Alberta, Edmonton, Alberta, Canada

    A. Meir & J. W. Moon

Authors
  1. A. Meir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meir, A., Moon, J.W. On random mapping patterns. Combinatorica 4, 61–70 (1984). https://doi.org/10.1007/BF02579158

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579158

AMS subject classification (1980)

Search

Navigation