Restricted random walks on a graph
| dc.creator | Wu, F. Y. | |
| dc.creator | Kunz, H. | |
| dc.date | 1998-12-11 | |
| dc.date.accessioned | 2026-07-07T07:59:52Z | |
| dc.date.available | 2026-07-07T07:59:52Z | |
| dc.description | The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the number of n-step walks with r reversal steps for walks on any graph. In the case of graphs of a uniform valence, we show that our result has a probabilistic meaning, and deduce explicit expressions for the generating function in terms of the eigenvalues of the adjacency matrix. Applications to periodic lattices and the complete graph are given. | |
| dc.description | plain latex, 10 pages, 1 fig., submitted to Ann. Combinatorics | |
| dc.identifier | https://arxiv.org/abs/cond-mat/9812203 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/9812203 | |
| dc.identifier | Ann. Combinatorics 3, 475-481 (1999) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128529 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Combinatorics | |
| dc.title | Restricted random walks on a graph | |
| dc.type | text |