Searcharxiv⌕ Search

arXiv subjects

Oleksiy Khorunzhiy

Publications and source records attributed to Oleksiy Khorunzhiy.

6 recordsLinked to original sources

Limiting eigenvalue distribution of random matrices of Ihara zeta function of long-range percolation graphs

We consider the ensemble of $N\times N$ real random symmetric matrices $H_N^{(R)}$ obtained from the determinant form of the Ihara zeta function associated to random graphs $Γ_N^{(R)}$ of the long-range percolation radius model with the edge probability determined by a function $ϕ(t)$. We show that the normalized eigenvalue counting function of $H_N^{( R)}$ weakly converges in average as $N,R\to\infty$, $R=o(N)$ to a unique measure that depends on the limiting average vertex degree of $Γ_N^{(R)}$ given by $ϕ_1 = \int ϕ(t) dt$. This measure converges in the limit of infinite $ϕ_1$ to a shift of the Wigner semi-circle distribution. We discuss relations of these results with the properties of the Ihara zeta function and weak versions of the graph theory Riemann Hypothesis.

math-ph↗

On correlation function of high moments of Wigner random matrices

We consider the Wigner ensemble of Hermitian n-dimensional random matrices and study the correlation function K(s',s") of their moments in the limit when the numbers s', s" of the moments are proportional to n to the power 2/3. We show that the limiting expression of K does not depend on the moments of the random matrix elements. The proof is based on a combination of the arguments by Ya. Sinai and A. Soshnikov with the detailed study of a moment analog of the Inverse Participation Ratio of the Gaussian Unitary Invariant Ensemble (GUE).

math-ph↗

A New Approach for Capacity Analysis of Large Dimensional Multi-Antenna Channels

This paper adresses the behaviour of the mutual information of correlated MIMO Rayleigh channels when the numbers of transmit and receive antennas converge to infinity at the same rate. Using a new and simple approach based on Poincaré-Nash inequality and on an integration by parts formula, it is rigorously established that the mutual information converges to a Gaussian random variable whose mean and variance are evaluated. These results confirm previous evaluations based on the powerful but non rigorous replica method. It is believed that the tools that are used in this paper are simple, robust, and of interest for the communications engineering community.

cs.IT↗

Asymptotic Behavior of Partition Functions with Graph Laplacian

We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We study the large-n limit of the free energy per site and show that it is determined by the number of connected acyclic diagrams on the set of two-valent vertices.

math-ph↗

Lifshitz tails for spectra of Erdős--Rényi random graphs

We consider the discrete Laplace operator $Δ^{(N)}$ on Erdős--Rényi random graphs with $N$ vertices and edge probability $p/N$. We are interested in the limiting spectral properties of $Δ^{(N)}$ as $N\to\infty$ in the subcritical regime $0<p<1$ where no giant cluster emerges. We prove that in this limit the expectation value of the integrated density of states of $Δ^{(N)}$ exhibits a Lifshitz-tail behavior at the lower spectral edge E=0.

math-ph↗