arXiv · cond-mat/0011360
Enumeration of simple random walks and tridiagonal matrices
Abstract
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted paths of $n$ steps allows an easier combinatorial enumeration of the paths. It also seems promising for the theory of tridiagonal random matrices .
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
G. M. Cicuta, M. Contedini, L. Molinari. 2002-01-31. Enumeration of simple random walks and tridiagonal matrices. https://doi.org/10.1088/0305-4470%2F35%2F5%2F302
Cite the original work for its findings. Save a collection to share your selection of sources.