Asymptotic Study of Subcritical Graph Classes

@article{Drmota2010AsymptoticSO,
  title={Asymptotic Study of Subcritical Graph Classes},
  author={Michael Drmota and {\'E}ric Fusy and Mihyun Kang and Veronika Kraus and Juanjo Ru{\'e}},
  journal={SIAM J. Discret. Math.},
  year={2010},
  volume={25},
  pages={1615-1651}
}
We present a unified general method for the asymptotic study of graphs from the so-called subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works in both the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp., $g_n$) of labelled (resp., unlabelled… 

Figures and Tables from this paper

Scaling Limits of Random Graphs from Subcritical Classes

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges

Asymptotic Properties of Some Minor-Closed Classes of Graphs

Using exact enumeration, a collection of classes excluding non-2-connected minors are studied, and it is shown that their asymptotic behaviour may be rather different from the 2-connected case.

Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case

For a given combinatorial class $\mathcal{C}$ we study the class $\mathcal{G} = \mathrm{MSET}(\mathcal{C})$ satisfying the multiset construction, that is, any object in $\mathcal{G}$ is uniquely

Enumeration of labelled 4-regular planar graphs II: asymptotics

This work is a follow-up of the article [Proc. London Math. Soc. 119(2):358–378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a

Asymptotic Properties of Random Unlabelled Block-Weighted Graphs

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned

Limits of random tree-like discrete structures

The Benjamini--Schramm convergence of random $k$-dimensional trees is proved, and a central limit theorem for the size of the largest $2$-connected component in random graphs from planar-like classes is recover in a probabilistic way.

An Exact Enumeration of Distance-Hereditary Graphs

The power of revisiting graph decomposition results through the framework of analytic combinatorics is illustrated, which allows to show that the number of distance-hereditary graphs on $n$ vertices is tightly bounded by ${(7.24975\ldots)^n}$---opening the perspective such graphs could be encoded on $3n$ bits.

Graph enumeration and random graphs

In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture

Random Graphs from a Weighted Minor-Closed Class

It is found that earlier results extend naturally in both directions, to general well-behaved classes of graphs, and to the weighted framework, for example results concerning the probability of a random graph being connected; and the 2-core which are new even for the uniform (unweighted) case.

Limits of subcritical random graphs and random graphs with excluded minors

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the
...

References

SHOWING 1-10 OF 31 REFERENCES

Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs

Using classical cycle index enumeration with recent results from analytic combinatorics, several statistical properties of random unlabeled outerplanar graphs on n vertices are investigated, for instance concerning connectedness, the chromatic number, and the number of edges.

Enumeration and limit laws for series-parallel graphs

A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components

This article translates Tutte's decomposition into a general grammar expressing any family of graphs in terms of the subfamily of graphs that are 3-connected, and recovers in a purely combinatorial way the analytic expression found by Gimenez and Noy for the series counting labelled planar graphs.

The Degree Sequence of Random Graphs from Subcritical Classes†

The expected number of vertices of degree k = k(n) in a graph with n vertices that is drawn uniformly at random from a subcritical graph class is determined.

Characteristic Points of Recursive Systems

The proper way to adapt this tool when working with multi-equation recursive systems with irreducible non-negative power series system with $m$ equations is investigated.

Vertices of given degree in series‐parallel graphs

We show that the numbers of vertices of a given degree k ≥ 1 in several kinds of series‐parallel labeled graphs of size n satisfy a central limit theorem with mean and variance proportional to n, and

Uniform random sampling of planar graphs in linear time

  • Éric Fusy
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 2009
This article introduces new algorithms for the uniform random generation of labelled planar graphs that combine the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon, and Schaeffer, as well as a precise analytic description of the generating functions countingPlanar graphs, which was recently obtained.

Random cubic planar graphs

We show that the number of labeled cubic planar graphs on n vertices with n even is asymptotically αn−7/2ρ−nn!, where ρ−1 ≐ 3.13259 and α are analytic constants. We show also that the chromatic

Random Trees: An Interplay between Combinatorics and Probability

This book is to provide a thorough introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques to bridge combinatorial and probabilistic methods.