Asymptotics of correlators of sparse bipartite random graphs

From MaRDI portal





In the last few years, interesting results for sparse random matrices were obtained in a series of physical works using the replica or supersymmetry method. The speed of approaching zero and the value of the main term are very important in physical applications. Therefore, an extensive literature is devoted to mathematically correct justification for these physical calculations. This paper studies the asymptotic behavior of the correlator of moments as \(N \to \infty\) for the bipartite sparse random matrix ensemble. It is shown that the main term of the correlation function of \(k\)-th and \(m\)-th moments of the integrated density of states is \(N^{-1} n_{k,m}\), where the coefficients \(n_{k,m}\) obey a closed system of recurrent relations.











This page was built for publication: Asymptotics of correlators of sparse bipartite random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896325)