Path count asymptotics and Stirling numbers

DOI10.1090/S0002-9939-2011-11052-9zbMATH Open1241.05001arXiv0911.1970OpenAlexW2963123299MaRDI QIDQ2884411FDOQ2884411

Authors: A. Varchenko, Karl Petersen 

Publication date: 29 May 2012

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0911.1970

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

zbMATH Keywords

Eulerian numberssymmetric polynomialsStirling numbersreinforced random walksurn models

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) 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) Dynamical aspects of measure-preserving transformations (37A05) Dynamical systems and their relations with probability theory and stochastic processes (37A50)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some exactly solvable models of urn process theory
• The boundary of Eulerian number triangle
• Reinforced random walks and adic transformations
• Ergodicity of the adic transformation on the Euler graph
• The Euler adic dynamical system and path counts in the Euler graph
• Random permutations and unique fully supported ergodicity for the Euler adic transformation
• Corrigendum to the paper. Generalized Eulerian numbers: combinatorial applications (this Journal vol. 265 (1974), 110—137)

Cited In (2)

• Enumeration by e
• Counting paths with Schur transitions

Uses Software

• OEIS

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)