Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Abstract: "We obtain a large deviation principle (LDP) for the relative size of the largest connected component in a random graph with small edge probability. The rate function, which is not convex in general, is determined explicitly using a new technique. As a corollary we present an asymptotic formula for the probability that the random graph is connected. We also present an LDP and related result for the number of isolated vertices. Here we make use of a simple but apparently unknown characterisation, wheich is obtained by embedding the random graph in a random directed graph. The results demonstrate that, at this scaling, the properties 'connected' and 'contains no isolated vertices' are not asymptotically equivalent. (At the threshold probability they are asymptotically equivalent.)."
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Subjects
Graph theory, Large deviations, Random graphsShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1 |
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Cover title.
"September, 1996."
Includes bibliographical references.
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?December 3, 2010 | Edited by Open Library Bot | Added subjects from MARC records. |
December 10, 2009 | Created by WorkBot | add works page |