Journal article
Infinite locally random graphs
- Abstract:
-
Motivated by copying models of the web graph, Bonato and Janssen [Bonato and Janssen 03] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighborhood, add a new vertex y whose neighbors are exactly X. Iterating this construction yields a limit graph ↑G. Bonato and Janssen claimed that the limit graph is independent of G, and it is known as the infinite locally random graph. We show that this picture is incorrect: there are in fa...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 234.7KB)
-
- Publisher copy:
- 10.1080/15427951.2006.10129127
Authors
Bibliographic Details
- Publisher:
- Taylor and Francis Publisher's website
- Journal:
- Internet Mathematics Journal website
- Volume:
- 3
- Issue:
- 3
- Pages:
- 321-331
- Publication date:
- 2006-01-01
- DOI:
- EISSN:
-
1944-9488
- ISSN:
-
1542-7951
Item Description
- Pubs id:
-
pubs:5642
- UUID:
-
uuid:aa370538-c567-4959-9cde-d330797881cd
- Local pid:
- pubs:5642
- Source identifiers:
-
5642
- Deposit date:
- 2013-11-17
Terms of use
- Copyright holder:
- A K Peters Ltd
- Copyright date:
- 2006
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record