相关论文: Random matrices, non-backtracking walks, and ortho…

We consider a class of real random matrices with dependent entries and show that the limiting empirical spectral distribution is given by the Marchenko-Pastur law. Additionally, we establish a rate of convergence of the expected empirical…

The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…

We consider the problem of determining the limiting spectral distribution for random matrices whose row distributions are permitted to have limited dependence. We assume mild moment conditions and give an extension of the…

We consider the random matrix obtained by picking vectors randomly from a large collection of mutually unbiased bases of $\mathbb{C}^n$, and prove that the spectral distribution converges to the Marchenko-Pastur law. This shows that vectors…

The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…

We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara's Theorem relates the adjacency matrix of a graph to a matrix…

The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…

Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…

In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…

In random matrix theory, Marchenko-Pastur law states that random matrices with independent and identically distributed entries have a universal asymptotic eigenvalue distribution under large dimension limit, regardless of the choice of…

We prove that the empirical spectral distribution of a (d_L, d_R)-biregular, bipartite random graph, under certain conditions, converges to a symmetrization of the Mar\v{c}enko-Pastur distribution of random matrix theory. This convergence…

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

We establish some relations between the spectra of simple and non-backtracking random walks on non-regular graphs, generalizing some well-known facts for regular graphs. Our two main results are 1) a quantitative relation between the mixing…

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

We prove that Kendall's Rank correlation matrix converges to the Mar\v{c}enko-Pastur law, under the assumption that the observations are i.i.d random vectors $X_1$, $\dots$, $X_n$ with components that are independent and absolutely…

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…

The traditional class of elliptical distributions is extended to allow for asymmetries. A completely robust dispersion matrix estimator (the `spectral estimator') for the new class of `generalized elliptical distributions' is presented. It…

We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…

We prove a local law in the bulk of the spectrum for random Gram matrices $XX^*$, a generalization of sample covariance matrices, where $X$ is a large matrix with independent, centered entries with arbitrary variances. The limiting…