Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-09T14:58:06.750Z Has data issue: false hasContentIssue false
  • English
  • Français

Random Finite Topologies and their Thresholds

Published online by Cambridge University Press:  25 June 2001

C. F. MACLEAN  and
NEIL O'CONNELL
C. F. MACLEAN
Affiliation:
Ecole Normale Supérieure, 45 rue d'Ulm, 75005 Paris, France (e-mail: maclean@clipper.ens.fr)
NEIL O'CONNELL
Affiliation:
BRIMS, Hewlett-Packard Laboratories, Stoke Gifford, Bristol BS34 8QZ, England (e-mail: noc@hplb.hpl.hp.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For each integer n, there is a natural family of probability distributions on the set of topologies on a set of n elements, parametrized by an integer variable, m. We will describe how these are constructed and analysed, and find threshold functions (for m in terms of n) for various topological properties; we focus attention on connectivity and the size of the largest component.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 3 , May 2001 , pp. 239 - 249
Copyright
2001 Cambridge University Press

Footnotes

An earlier version of this article appeared as BRIMS Technical Report HPL-BRIMS-9718.