Related papers: Fat-tailed distribution derived from first eigenve…
Eigenvalue distributions are important dynamical quantities in matrix models, and it is an interesting challenge to study corresponding quantities in tensor models. We study real tensor eigenvalue/vector distributions for real symmetric…
Neural networks have been used successfully in a variety of fields, which has led to a great deal of interest in developing a theoretical understanding of how they store the information needed to perform a particular task. We study the…
In this paper we study an ensemble of random matrices called Elliptic Volatility Model, which arises in finance as models of stock returns. This model consists of a product of independent matrices $X = \Sigma Z $ where $Z$ is a $T$ by $S$…
We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…
The distribution of individual Dirac eigenvalues is derived by relating them to the density and higher eigenvalue correlation functions. The relations are general and hold for any gauge theory coupled to fermions under certain conditions…
We consider a multivariate heavy-tailed stochastic volatility model and analyze the large-sample behavior of its sample covariance matrix. We study the limiting behavior of its entries in the infinite-variance case and derive results for…
We review the problem of how to compute the spectral density of sparse symmetric random matrices, i.e. weighted adjacency matrices of undirected graphs. Starting from the Edwards-Jones formula, we illustrate the milestones of this line of…
We propose a construction procedure which generates a wide class of random evolving networks with fat-tailed degree distributions and an arbitrary clustering. This procedure applies the stochastic transformations of edges, which can be used…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
We study the overlaps between right and left eigenvectors for random matrices of the spherical and truncated unitary ensembles. Conditionally on all eigenvalues, diagonal overlaps are shown to be distributed as a product of independent…
We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…
Eigenvectors of matrices on a network have been used for understanding spectral clustering and influence of a vertex. For matrices with small geodesic-width, we propose a distributed iterative algorithm in this letter to find eigenvectors…
In this paper, we consider the problem of deriving new eigenvalue distributions of real-valued Wishart matrices that arises in many scientific and engineering applications. The distributions are derived using the tools from the theory of…
We consider an $N \times N$ random symmetric Toeplitz matrix with an i.i.d. input sequence drawn from a distribution that lies in the domain of attraction of an $\alpha$-stable law for $0 < \alpha < 2$. We show that under an appropriate…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
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…
This note presents an operational measure of fat-tailedness for univariate probability distributions, in $[0,1]$ where 0 is maximally thin-tailed (Gaussian) and 1 is maximally fat-tailed. Among others,1) it helps assess the sample size…
We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…
We generalise the inference procedure for eigenvectors of symmetrizable matrices of Tyler (1981) to that of invariant and singular subspaces of non-diagonalizable matrices. Wald tests for invariant vectors and $t$-tests for their individual…