Properties of Random Graphs via Boltzmann Samplers
2007 ◽
Vol DMTCS Proceedings vol. AH,...
(Proceedings)
◽
Keyword(s):
International audience 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.
2009 ◽
Vol DMTCS Proceedings vol. AK,...
(Proceedings)
◽
2012 ◽
Vol Vol. 14 no. 2
◽
Keyword(s):
Keyword(s):
1999 ◽
Vol Vol. 3 no. 4
◽
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
2010 ◽
Vol Vol. 12 no. 1
◽
Keyword(s):
2020 ◽
Vol 29
(5)
◽
pp. 757-779
◽
Keyword(s):
1999 ◽
Vol Vol. 3 no. 4
◽
Keyword(s):