title: Random symmetric matrices with a constraint: the spectral density of random impedance networks.
abstract: 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 recently for the average density of resonances in random impedance networks [Y.V. Fyodorov, J. Phys. A 32, 7429 (1999)]. In the case of banded matrices, the analytical results are compared with those extracted from the numerical solution of Kirchhoff equations for quasi-one-dimensional random impedance networks.
authors.affiliation: School of Physics and Engineering Physics, Gothenburg University/Chalmers, SE-41296 Göteborg, Sweden.
authors.forename: J
authors.initials: J
authors.lastname: Stäring
authors.forename: B
authors.initials: B
authors.lastname: Mehlig
authors.forename: Yan V
authors.initials: YV
authors.lastname: Fyodorov
authors.forename: J M
authors.initials: JM
authors.lastname: Luck