IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v42y1999i2p115-125.html
   My bibliography  Save this article

On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations

Author

Listed:
  • Fu, James C.
  • Lou, W. Y. Wendy
  • Wang, Yueh-Jir

Abstract

Eulerian and Simon Newcomb numbers are two of the most celebrated numbers associated with random permutations. Their distributions have been successfully used in various areas of statistics and applied probability. Conventionally, these distributions have been studied via combinatorial analysis. In this article, we provide a new, simple and unified probabilistic method based on the finite Markov chain imbedding technique to study the exact distributions of Eulerian and Simon Newcomb numbers. A new recursive equation which characterizes the Simon Newcomb numbers is obtained. We also show that many classical identities and recursive equations associated with Eulerian numbers are immediate consequences of our main result.

Suggested Citation

  • Fu, James C. & Lou, W. Y. Wendy & Wang, Yueh-Jir, 1999. "On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations," Statistics & Probability Letters, Elsevier, vol. 42(2), pages 115-125, April.
  • Handle: RePEc:eee:stapro:v:42:y:1999:i:2:p:115-125
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(98)00176-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James Fu, 1995. "Exact and limiting distributions of the number of successions in a random permutation," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(3), pages 435-446, September.
    2. Harris, Bernard & Park, C. J., 1994. "A generalization of the Eulerian numbers with a probabilistic application," Statistics & Probability Letters, Elsevier, vol. 20(1), pages 37-47, May.
    3. M. Koutras & V. Alexandrou, 1995. "Runs, scans and URN model distributions: A unified Markov chain approach," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(4), pages 743-766, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. James C. Fu & Wan-Chen Lee & Hsing-Ming Chang, 2023. "On Distribution of the Number of Peaks and the Euler Numbers of Permutations," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-13, June.
    2. Yu-Fei Hsieh & Tung-Lung Wu, 2013. "Recursive equations in finite Markov chain imbedding," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 65(3), pages 513-527, June.
    3. Johnson, Brad C. & Fu, James C., 2000. "The distribution of increasing l-sequences in random permutations: a Markov chain approach," Statistics & Probability Letters, Elsevier, vol. 49(4), pages 337-344, October.
    4. James C. Fu, 2012. "On the Distribution of the Number of Occurrences of an Order-Preserving Pattern of Length Three in a Random Permutation," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 831-842, September.
    5. Tung-Lung Wu, 2013. "On Finite Markov Chain Imbedding and Its Applications," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 453-465, June.
    6. Johnson, Brad C., 2002. "The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets," Statistics & Probability Letters, Elsevier, vol. 59(1), pages 67-74, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johnson, Brad C. & Fu, James C., 2000. "The distribution of increasing l-sequences in random permutations: a Markov chain approach," Statistics & Probability Letters, Elsevier, vol. 49(4), pages 337-344, October.
    2. James C. Fu, 2012. "On the Distribution of the Number of Occurrences of an Order-Preserving Pattern of Length Three in a Random Permutation," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 831-842, September.
    3. Koutras, M. V. & Alexandrou, V. A., 1997. "Non-parametric randomness tests based on success runs of fixed length," Statistics & Probability Letters, Elsevier, vol. 32(4), pages 393-404, April.
    4. Serkan Eryilmaz, 2005. "On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials," Statistical Papers, Springer, vol. 46(1), pages 117-128, January.
    5. Markos V. Koutras & Demetrios P. Lyberopoulos, 2018. "Asymptotic results for jump probabilities associated to the multiple scan statistic," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(5), pages 951-968, October.
    6. Stathis Chadjiconstantinidis & Serkan Eryilmaz, 2023. "Computing waiting time probabilities related to $$ (k_{1},k_{2},\ldots ,k_{l})$$ ( k 1 , k 2 , … , k l ) pattern," Statistical Papers, Springer, vol. 64(5), pages 1373-1390, October.
    7. Kiyoshi Inoue & Sigeo Aki, 2013. "Distributions of numbers of runs and scans on directed acyclic graphs with generation," Computational Statistics, Springer, vol. 28(3), pages 1133-1150, June.
    8. Yong Kong, 2019. "Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 789-803, September.
    9. James C. Fu & Yu-Fei Hsieh, 2015. "On the Distribution of the Length of the Longest Increasing Subsequence in a Random Permutation," Methodology and Computing in Applied Probability, Springer, vol. 17(2), pages 489-496, June.
    10. Spiros D. Dafnis & Frosso S. Makri, 2023. "Distributions Related to Weak Runs With a Minimum and a Maximum Number of Successes: A Unified Approach," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-24, March.
    11. A. Godbole & M. Koutras & F. Milienos, 2011. "Binary consecutive covering arrays," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 63(3), pages 559-584, June.
    12. Yi-Shen Lin & Xenos Chang-Shuo Lin & Daniel Wei-Chung Miao & Yi-Ching Yao, 2020. "Corrected Discrete Approximations for Multiple Window Scan Statistics of One-Dimensional Poisson Processes," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 237-265, March.
    13. James C. Fu & Wan-Chen Lee & Hsing-Ming Chang, 2023. "On Distribution of the Number of Peaks and the Euler Numbers of Permutations," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-13, June.
    14. Spiros D. Dafnis & Frosso S. Makri, 2022. "Weak runs in sequences of binary trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(5), pages 573-603, July.
    15. Kiyoshi Inoue & Sigeo Aki, 2003. "Generalized binomial and negative binomial distributions of orderk by thel-overlapping enumeration scheme," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 55(1), pages 153-167, March.
    16. Bartolucci, F., 2001. "Developments of the Markov chain approach within the distribution theory of runs," Computational Statistics & Data Analysis, Elsevier, vol. 36(1), pages 107-118, March.
    17. Aki, Sigeo, 2008. "Joint distributions of numbers of occurrences of a discrete pattern and weak convergence of an empirical process for the pattern," Journal of Multivariate Analysis, Elsevier, vol. 99(7), pages 1460-1473, August.
    18. Bobotas, Panayiotis & Koutras, Markos V., 2019. "Distributions of the minimum and the maximum of a random number of random variables," Statistics & Probability Letters, Elsevier, vol. 146(C), pages 57-64.
    19. Johnson, Brad C., 2002. "The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets," Statistics & Probability Letters, Elsevier, vol. 59(1), pages 67-74, August.
    20. Inoue, Kiyoshi & Aki, Sigeo, 2010. "On the conditional and unconditional distributions of the number of success runs on a circle with applications," Statistics & Probability Letters, Elsevier, vol. 80(9-10), pages 874-885, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:42:y:1999:i:2:p:115-125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.