On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs

  • Authors:
  • Nicla Bernasconi;Konstantinos Panagiotou;Angelika Steger

  • Affiliations:
  • Institute of Theoretical Computer Science, ETH Zurich, Zurich CH-8092;Institute of Theoretical Computer Science, ETH Zurich, Zurich CH-8092;Institute of Theoretical Computer Science, ETH Zurich, Zurich CH-8092

  • Venue:
  • APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let be a class of labeled connected graphs and let be the class of biconnected graphs in . In this paper we develop a general framework that allows us to derive mechanically the degree distribution of random graphs with nvertices from certain 'nice' classes as a function of the degree distribution of the graphs in that are drawn under a specific probabilistic model, namely the Boltzmann model. We apply this framework to obtain the degree distribution of a random outerplanar graph and a random series-parallel graph. For the latter we formulate a generic concentration result that allows us to make statements that are true with high probability for a large family of variables defined on random graphs drawn according to the Boltzmann distribution.