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.
متن کامل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.
متن کاملAnalysis of Random Walks Using Orthogonal Polynomials
We discuss some aspects of discrete-time birth-death processes or random walks, highlighting the role played by orthogonal polynomials.
متن کامل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...
متن کاملFaster Clustering via Non-Backtracking Random Walks
This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-ofthe-art word2vec model to embed a graph in Euclidean space via random walks on the nodes of the graph. In VEC-NBT, we modify the original algorithm to use a non-b...
متن کامل