Dynamic Erdős- Rényi random graph with forbidden degree - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Dynamic Erdős- Rényi random graph with forbidden degree

Lucas Mercier
  • Fonction : Auteur
  • PersonId : 775642
  • IdRef : 195497066

Résumé

As suggested by Itai Benjamini, we introduced a variant of the Erdős- Rényi random graph process with a forbidden degree $k$, in which every edge adjacent to a vertex $v$ is removed when the degree of $v$ reaches $k$ (but the removed edges may very well be added again later). We study the existence of a giant component, depending on the forbidden degree $k$ and the time parameter $t$. We prove that for $k>4$ a giant component appears at some point, while for $k<4$, a giant component never occurs. The main tool of our study is the local limit of the random graph process: it provides useful information about the cases $k>4$, but also the threshold case k=4.
Fichier principal
Vignette du fichier
dynamicERgraphprocess.pdf (516.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01279328 , version 1 (25-02-2016)

Identifiants

Citer

Lucas Mercier. Dynamic Erdős- Rényi random graph with forbidden degree. 2016. ⟨hal-01279328⟩
160 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More