The densest subgraph problem in sparse random graphs - Archive ouverte HAL
Article Dans Une Revue The Annals of Applied Probability Année : 2016

The densest subgraph problem in sparse random graphs

Résumé

We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-Rényi model, where it settles a conjecture of Hajek (1990). Our proof consists in extending the notion of balanced loads from finite graphs to their local weak limits, using unimodularity. This is a new illustration of the objective method described by Aldous and Steele (2004).
Fichier principal
Vignette du fichier
draft.pdf (228.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00919079 , version 1 (16-12-2013)

Identifiants

Citer

Venkat Anantharam, Justin Salez. The densest subgraph problem in sparse random graphs. The Annals of Applied Probability, 2016, 26 (1), pp.305-327. ⟨10.1214/14-AAP1091⟩. ⟨hal-00919079⟩
185 Consultations
361 Téléchargements

Altmetric

Partager

More