Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing - Laboratoire d'Informatique Fondamentale et Appliquée de Tours Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2021

Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing

Giuliano Grossi
  • Fonction : Auteur
  • PersonId : 1113249
Raffaella Lanzarotti
  • Fonction : Auteur
Jianyi Lin
Alessandro Petrini
  • Fonction : Auteur

Résumé

We propose the analysis of a scalable parallel MCMC algorithm for graph coloring aimed at balancing the color class sizes, provided that a suitable number of colors is made available. Firstly, it is shown that the Markov chain converges to the target distribution by repeatedly sampling from suitable proposed distributions over the neighboring colors of each node, independently and hence in parallel manner. We prove that the number of conflicts in the improper colorings genereted thoughout the iterations of the algorithm rapidly converges in probability to 0. As for the balancing, given to the complexity of the distributions involved, we propose a qualitative analysis about the balancing level achieved. Based on a collection of multinoulli distributions arising from the color occurrences within every node neighborhood, we provide some evidence about the character of the final color balancing, which results to be nearly uniform over the color classes. Some numerical simulations on big social graphs confirm the fast convergence and the balancing trend, which is validated through a statistical hypothesis test eventually.
Fichier principal
Vignette du fichier
2021PRLColoring.pdf (276.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03375814 , version 1 (13-10-2021)

Identifiants

Citer

Donatello Conte, Giuliano Grossi, Raffaella Lanzarotti, Jianyi Lin, Alessandro Petrini. Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing. Pattern Recognition Letters, 2021, 149, pp.30-36. ⟨10.1016/j.patrec.2021.05.014⟩. ⟨hal-03375814⟩
82 Consultations
142 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More