Path count asymptotics and Stirling numbers
DOI10.1090/S0002-9939-2011-11052-9zbMath1241.05001arXiv0911.1970MaRDI QIDQ2884411
Alexander Varchenko, Karl E. Petersen
Publication date: 29 May 2012
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.1970
11B73: Bell and Stirling numbers
05A10: Factorials, binomial coefficients, combinatorial functions
05A19: Combinatorial identities, bijective combinatorics
37A05: Dynamical aspects of measure-preserving transformations
05C30: Enumeration in graph theory
37A50: Dynamical systems and their relations with probability theory and stochastic processes
05A16: Asymptotic enumeration
05C63: Infinite graphs
05C81: Random walks on graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Euler adic dynamical system and path counts in the Euler graph
- Random permutations and unique fully supported ergodicity for the Euler adic transformation
- Reinforced random walks and adic transformations
- Ergodicity of the adic transformation on the Euler graph
- Corrigendum to the paper. Generalized Eulerian numbers: combinatorial applications (this Journal vol. 265 (1974), 110—137)