The number of endpoints of a random walk on a semi-infinite metric path graph
From MaRDI portal
Publication:2036363
DOI10.1134/S0040577921040073zbMath1467.05248OpenAlexW3174622847MaRDI QIDQ2036363
Anton A. Tolchennikov, Vsevolod L. Chernyshev, D. S. Minenkov
Publication date: 29 June 2021
Published in: Theoretical and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0040577921040073
Related Items (2)
On logarithmic asymptotics for the number of restricted partitions in the exponential case ⋮ Restricted partitions: the polynomial case
Cites Work
- Unnamed Item
- On the entropy of a Bose-Maslov gas
- Asymptotics of the number of restricted partitions
- Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
- Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
- The second term in the asymptotics for the number of points moving along a metric graph
- On the asymptotics of the number of states for the Bose-Maslov gas
- Statistics of Gaussian packets on metric and decorated graphs
- Complex Zeros of an Incomplete Riemann Zeta Function and of the Incomplete Gamma Function
This page was built for publication: The number of endpoints of a random walk on a semi-infinite metric path graph
