Abstract
It is exponentially unlikely that a sparse random graph or hypergraph is connected, but such graphs occur commonly as the giant components of larger random graphs. This simple observation allows us to estimate the number of connected graphs, and more generally the number of connected d-uniform hypergraphs, on n vertices with m=O(n) edges. We also estimate the probability that a binomial random hypergraph H d (n,p) is connected, and determine the expected number of edges of H d (n,p) conditioned on its being connected. This generalizes prior work of Bender, Canfield, and McKay [2] on the number of connected graphs; however, our approach relies on elementary probabilistic methods, extending an approach of O’Connell, rather than using powerful tools from enumerative combinatorics. We also estimate the probability for each t that, given k=O(n) balls in n bins, every bin is occupied by at least t balls.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barraez, D., Boucheron, S., Fernandez de la Vega, W.: On the fluctuations of the giant component. Combinatorics, Probability and Computing 9, 287–304 (2000)
Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures & Algorithms 1, 127–169 (1990)
Bender, E.A., Canfield, E.R., McKay, B.D.: Asymptotic properties of labeled connected graphs. Random Structures & Algorithms 3, 183–202 (1992)
Engel, A., Monasson, R., Hartmann, A.: On large deviation properties of Erdös- Rényi random graphs. Preprint rXiv, cond-mat/0311535 (2003)
Feller, W.: Introduction to probability theory and its applications. Wiley, Chichester (1968)
Janson, S., Luczak, T., Ruciński, A.: Random Graphs. Wiley, Chichester (2000)
Karonski, M., Luczak, T.: The phase transition in a random hypergraph. J. Comput. Appl. Math. 142, 125–135 (2002)
Karonski, M., Luczak, T.: The number of connected sparsely edged uniform hypergraphs. Discrete Math. 171, 153–168 (1997)
Luczak, T.: On the number of sparse connected graphs. Random Structures & Algorithms 1, 171–173 (1990)
Moser, L., Wyman, M.: Stirling numbers of the second kind. Duke Mathematical Journal 25, 29–43 (1958)
O’Connell, N.: Some large deviation results for sparse random graphs. Prob. Th. Relat. Fields 110, 277–285 (1998)
Pittel, B., Wormald, N.C.: Counting connected graphs inside out. J. Combinatorial Theory Series B (to appear)
Schmidt-Pruzan, J., Shamir, E.: Component structure in the evolution of random hypergraphs. Combinatorica 5, 81–94 (1985)
Temme, N.M.: Asymptotic estimates of Stirling numbers. Studies in Applied Mathematics 89, 233–243 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coja-Oghlan, A., Moore, C., Sanwalani, V. (2004). Counting Connected Graphs and Hypergraphs via the Probabilistic Method. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive