Asymptotics for the probability of connectedness and the distribution of number of components
type: Item
instance of: scholarly article
title: Asymptotics for the probability of connectedness and the distribution of number of components
zbMATH Open document ID: 0948.05009
author: Jason P. Bell
author: Edward A. Bender
author: Peter J. Cameron
author: L. Bruce Richmond
published in: The Electronic Journal of Combinatorics
publication date: 2000-07-23T00:00:00Z
full work available at URL: https://eudml.org/doc/120600
full work available at URL: v7i1r33.html
review text: Summary: Let \(\rho_n\) be the fraction of structures of ``size'' \(n\) which are ``connected''; e.g., (a) the fraction of labeled or unlabeled \(n\)-vertex graphs having one component, (b) the fraction of partitions of \(n\) or of an \(n\)-set having a single part or block, or (c) the fraction of \(n\)-vertex forests that contain only one tree. Various authors have considered \(\lim \rho_n\), provided it exists. It is convenient to distinguish three cases depending on the nature of the power series for the structures: pure formal, convergent on the circle of convergence, and other. We determine all possible values for the pair (\(\lim\inf\rho_n\), \(\limsup\rho_n\)) in these cases. Only in the convergent case can one have \(0<\lim \rho_n<1\). We study the existence of \(\lim\rho_n\) in this case.
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1467491
zbMATH Keywords: probability
zbMATH Keywords: connectedness
zbMATH Keywords: number of components
zbMATH Keywords: asymptotic probabilities
zbMATH Keywords: generating function
zbMATH Keywords: fraction of structures
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1467491