Related papers: The asymptotic trace norm of random circulants and…
We estimate the norms of standard Gaussian random Toeplitz and circulant matrices and their inverses, mostly by means of combining some basic techniques of linear algebra. In the case of circulant matrices we obtain sharp probabilistic…
We study the spectral norm of large rectangular random Toeplitz and circulant matrices with independent entries. For Toeplitz matrices, we show that the scaled norm converges to the norm of a bilinear operator defined via the pointwise…
We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of the diagonals are taken to be correlated.…
Consider the ensemble of real symmetric Toeplitz matrices, each independent entry an i.i.d. random variable chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. Previous investigations showed that…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
We derive the mean eigenvalue density for symmetric Gaussian random N x N matrices in the limit of large N, with a constraint implying that the row sum of matrix elements should vanish. The result is shown to be equivalent to a result found…
In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. In this paper some of this research is extended to more general matrix norms, like the Schatten p-norms and the Ky Fan k-norms.…
In this paper, we mainly study the trace norm of the adjacency matrix of a graph, also known as the energy of graph. We give the maximum trace norms for the graph and its complement. In fact, the above problem is stated and solved in a more…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Suppose that $T_n$ is a Toeplitz matrix whose entries come from a sequence of independent but not necessarily identically distributed random variables with mean zero. Under some additional tail conditions, we show that the spectral norm of…
We establish the joint $*$-convergence of a random circulant matrix and a specific deterministic diagonal matrix. We also show that the empirical spectral distributions of skew-circulant and left skew-circulant random matrices converge…
We study two specific symmetric random block Toeplitz (of dimension $k \times k$) matrices: where the blocks (of size $n \times n$) are (i) matrices with i.i.d. entries, and (ii) asymmetric Toeplitz matrices. Under suitable assumptions on…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…
We show that the limiting eigenvalue distribution of random symmetric Toeplitz matrices is absolutely continuous with density bounded by 8, partially answering a question of Bryc, Dembo and Jiang (2006). The main tool used in the proof is a…
In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. The trace norm is just one of the Ky Fan k-norms, given by the sum of the k largest singular values, which are studied more generally…
Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the…
The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…