Journal article
Slow emergence of the giant component in the growing m-out graph
- Abstract:
-
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new vertex to a uniformly chosen set of m earlier vertices. If edges of H m(n) are deleted independently, each being retained with probability p, then there is a "phase transition". There is a certain critical value p c of p such that, with high probability, a component of order θ(n) remains as n → ∞ if and only if p > p c. Among other results, we obtain the exact value of p c, which depends on...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1002/rsa.20060
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- RANDOM STRUCTURES and ALGORITHMS
- Volume:
- 27
- Issue:
- 1
- Pages:
- 1-24
- Publication date:
- 2005-08-01
- DOI:
- EISSN:
-
1098-2418
- ISSN:
-
1042-9832
- Source identifiers:
-
4389
Item Description
- Language:
- English
- Pubs id:
-
pubs:4389
- UUID:
-
uuid:4d08e888-412a-44da-9f89-306dd688341a
- Local pid:
- pubs:4389
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2005
If you are the owner of this record, you can report an update to it here: Report update to this record