Path count asymptotics and Stirling numbers
From MaRDI portal
Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30) Infinite graphs (05C63) Random walks on graphs (05C81) Bell and Stirling numbers (11B73) Dynamical aspects of measure-preserving transformations (37A05) Dynamical systems and their relations with probability theory and stochastic processes (37A50)
Abstract: We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.
Recommendations
- ASYMPTOTIC ESTIMATES FOR GENERALIZED STIRLING NUMBERS
- A symmetric sum involving the Stirling numbers of the first kind
- Stirling Numbers for Complex Arguments: Asymptotics and Identities
- Asymptotic estimates for second kind generalized Stirling numbers
- Asymptotics of Stirling and Chebyshev-Stirling numbers of the second kind
Cites work
- Corrigendum to the paper. Generalized Eulerian numbers: combinatorial applications (this Journal vol. 265 (1974), 110—137)
- Ergodicity of the adic transformation on the Euler graph
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- Random permutations and unique fully supported ergodicity for the Euler adic transformation
- Reinforced random walks and adic transformations
- Some exactly solvable models of urn process theory
- The boundary of Eulerian number triangle
- The Euler adic dynamical system and path counts in the Euler graph
- The On-Line Encyclopedia of Integer Sequences
This page was built for publication: Path count asymptotics and Stirling numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884411)
