The interpolation method for random graphs with prescribed degrees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Combinatorics, Probability and Computing Année : 2016

The interpolation method for random graphs with prescribed degrees

Justin Salez

Résumé

We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic convergence of a broad class of graph parameters that includes in particular the independence number, the maximum cut size and the log-partition function of the antiferromagnetic Ising and Potts models. The corresponding limits are shown to be Lipschitz and concave functions of $\mu$. Our work extends the applicability of the celebrated interpolation method, introduced in the context of spin glasses, and recently related to the fascinating problem of right-convergence of sparse graphs.
Fichier principal
Vignette du fichier
draft.pdf (156.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00983930 , version 1 (26-04-2014)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Justin Salez. The interpolation method for random graphs with prescribed degrees. Combinatorics, Probability and Computing, 2016, 25 (3), pp.436-447. ⟨10.1017/S0963548315000139⟩. ⟨hal-00983930⟩
138 Consultations
275 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More