Spectral density of random graphs with topological constraints

  • IFISC Seminar

  • Isaac Pérez
  • Department of Mathematics, King’s College London, UK
  • Nov. 11, 2009, 3 p.m.
  • IFISC Seminar Room
  • Announcement file

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case an exact solution is found for the spectral density in the form of consistency equations depending on the statistical properties of the graph ensemble in question. We highlight the effect of these topological constraints on the resulting spectral density.


Contact details:

Damià Gomila

Contact form


This web uses cookies for data collection with a statistical purpose. If you continue browsing, it means acceptance of the installation of the same.


More info I agree