ar X iv : m at h - ph / 0 70 30 43 v 3 2 8 O ct 2 00 7 RANDOM MATRICES , NON - BACKTRACKING WALKS , AND ORTHOGONAL POLYNOMIALS
نویسنده
چکیده
Several well-known results from the random matrix theory, such as Wigner’s law and the Marchenko–Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the limiting spectral measure play a rôle in this approach.
منابع مشابه
M ar 2 00 7 RANDOM MATRICES , NON - BACKTRACKING WALKS , AND ORTHOGONAL POLYNOMIALS
Several well-known results from the random matrix theory, such as Wigner’s law and the Marchenko–Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the limiting spectral measure play a rôle in this approach.
متن کامل7 Random Matrices , Non - Backtracking Walks , and Orthogonal Polynomials
Several well-known results from the random matrix theory, such as Wigner’s law and the Marchenko–Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the limiting spectral measure play a rôle in this approach.
متن کاملSpherically symmetric random walks. I. Representation in terms of orthogonal polynomials.
Spherically symmetric random walks in arbitrary dimension D can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically symmetric random walks. In general, there is a connection between orthogonal polynomials and semibounded one-dimensional random walks; such a random walk can be...
متن کاملThe Geometry of t-Cliques in k-Walk-Regular Graphs
A graph is walk-regular if the number of cycles of length l rooted at a given vertex is a constant through all the vertices. For a walk-regular graph G with d+1 different eigenvalues and spectrally maximum diameter D = d, we study the geometry of its d-cliques, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency m...
متن کاملRandom walks and orthogonal functions associated with highly symmetric graphs
The relationship of orthogonal functions associated with vertex transitive graphs and random walks on such graphs is investigated. We use this relations to characterize the exponentially decaying autocorrelation functions along random walks on isotropic random elds de ned on vertex transitive graphs. The results are applied to a simple spin glass model. Motivation Recently \combinatory landscap...
متن کامل