Spectral density of random graphs with topological constraints

  • IFISC Seminar

  • Isaac Pérez
  • Department of Mathematics, King’s College London, UK
  • 11 de novembre de 2009 a les 15:00
  • 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.


Detalls de contacte:

Damià Gomila

Contact form


Aquesta web utilitza cookies per a la recollida de dades amb un propòsit estadístic. Si continues navegant, vol dir que acceptes la instal·lació de la cookie.


Més informació D'accord