Author:
BERNASCONI NICLA,PANAGIOTOU KONSTANTINOS,STEGER ANGELIKA
Abstract
In this work we determine the expected number of vertices of degreek=k(n) in a graph withnvertices that is drawn uniformly at random from asubcritical graph class. Examples of such classes are outerplanar, series-parallel, cactus and clique graphs. Moreover, we provide exponentially small bounds for the probability that the quantities in question deviate from their expected values.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference20 articles.
1. [12] Fusy É. (2005) Quadratic exact-size and linear approximate-size random generation of planar graphs. In 2005 International Conference on Analysis of Algorithms ( Martínez C. , ed.), Vol. AD of DMTCS Proceedings, pp. 125–138.
2. A calculus for the random generation of labelled combinatorial structures
3. [20] Weissl A. C. (2007) Random graphs with structural constraints. PhD Thesis.
4. The number of labeled 2-connected planar graphs;Bender;Electron. J. Combin.,2002
5. Analytic Combinatorics
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献