Properties of Random Graphs via Boltzmann Samplers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

Properties of Random Graphs via Boltzmann Samplers


This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise estimates for the maximum degree and maximum size of a biconnected block of a "typical'' member of the class in question. We illustrate how our method works on several graph classes, namely dissections and triangulations of convex polygons, embedded trees, and block and cactus graphs.
Fichier principal
Vignette du fichier
dmAH0112.pdf (225.61 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184800 , version 1 (17-08-2015)



Konstantinos Panagiotou, Andreas Weissl. Properties of Random Graphs via Boltzmann Samplers. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.171-182, ⟨10.46298/dmtcs.3552⟩. ⟨hal-01184800⟩


112 View
633 Download



Gmail Facebook Twitter LinkedIn More