Related papers: Spectrum of Markov generators on sparse random gra…

We consider an indexed class of real symmetric random matrices which generalize the symmetric Hankel and Reverse Circulant matrices. We show that the limiting spectral distributions of these matrices exist almost surely and the limit is…

We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…

We discuss the limiting spectral density of real symmetric random matrices. Other than in standard random matrix theory the upper diagonal entries are not assumed to be independent, but we will fill them with the entries of a stochastic…

We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…

We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…

For a directed graph $G(V_n, E_n)$ on the vertices $V_n = \{1,2, \dots, n\}$, we study the distribution of a Markov chain $\{ {\bf R}^{(k)}: k \geq 0\}$ on $\mathbb{R}^n$ such that the $i$th component of ${\bf R}^{(k)}$, denoted…

We consider the spectrum of random Laplacian matrices of the form $L_n=A_n-D_n$ where $A_n$ is a real symmetric random matrix and $D_n$ is a diagonal matrix whose entries are equal to the corresponding row sums of $A_n$. If $A_n$ is a…

We obtain the limiting spectral distribution for large sample covariance matrices associated with random vectors having graph-dependent entries under the assumption that the interdependence among the entries grows with the sample size n.…

We study the limiting spectral distribution of quantum channels whose Kraus operators are sampled as $n\times n$ random Hermitian matrices satisfying certain assumptions. We show that when the Kraus rank goes to infinity with n, the…

We obtain various new limit theorems for random walks on SL_2(C) under low moment conditions. For non-elementary measures with a finite second moment, we prove a Local Limit Theorem for the norm cocycle, yielding the optimal version of a…

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

In this article we study the fluctuation of linear statistics of eigenvalues of circulant, symmetric circulant, reverse circulant and Hankel matrices. We show that the linear spectral statistics of these matrices converges to the Gaussian…

We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…

In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…