PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 25, 20240 citationsOpen Access

Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers

View Full Paper
AIAlexander IksanovZKZakhar KabluchkoAMAlexander Marynych

Key Points

Key points are not available for this paper at this time.

Abstract

We introduce multinomial and r-variants of several classic objects of combinatorial probability, such as the random recursive and Hoppe trees, random set partitions and compositions, the Chinese restaurant process, Feller's coupling, and some others. Just as various classic combinatorial numbers - like Stirling, Eulerian and Lah numbers - emerge as essential ingredients defining the distributions of the mentioned processes, the so-called r-versions of these numbers appear in exact distributional formulas for the multinomial and r-counterparts. This approach allows us to offer a concise probabilistic interpretation for various identities involving r-versions of these combinatorial numbers, which were either unavailable or meaningful only for specific values of the parameter r. We analyze the derived distributions for fixed-size structures and establish distributional limit theorems as the size tends to infinity. Utilizing the aforementioned generalized Stirling numbers of both kinds, we define and analyze (r, s) -Lah distributions, which have arisen in the existing literature on combinatorial probability in various contexts.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Iksanov et al. (2024) studied this question.

synapsesocial.com/papers/68e7285cb6db6435876a22d8https://doi.org/10.48550/arxiv.2403.16448
Ask AI
Helpful
Bookmark
Share
View Full Paper