Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

RSA
2000

favoriteEmaildiscussreport

112views more RSA 2000»

Growth of components in random graphs

13 years 4 months ago

Growth of components in random graphs

Download www2.math.uu.se

The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found. It follows that the largest -component during the process is Op(n2/3 ) for any given . The results also yield a new proof of the asymptotic behaviour of Wright's coefficients.

Svante Janson

Real-time Traffic

Expected Number | Random Graph Process | RSA 2000 | Total Size |

claim paper

Related Content

» Random graphs on surfaces

» A random graph model for massive graphs

» Creation and Growth of Components in a Random Hypergraph Process

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» Component structure induced by a random walk on a random graph

» Patterns on the Connected Components of TerabyteScale Graphs

» Continuum limits for classical sequential growth models

» Giant Component and Connectivity in Geographical Threshold Graphs

» The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	RSA
Authors	Svante Janson

Comments (0)