TY - GEN A1 - Bodirsky, Manuel A1 - Bonato, Anthony T1 - The Infinite Locally Random Graph N2 - We investigate properties of a certain countably infinite graph called the infinite locally random graph, written R_N. The graph R_N arises in the study of models for massive, self-organizing networks like the web-graph. We characterize the isomorphism type of R_N as the limit of a random process, and via a domination elimination ordering. We prove that R_N satisfies vertex deletion properties generalizing inexhaustibility. As is the case for the infinite random graph R, R_N has a universal automorphism group and endomorphism monoid. Unlike R, R_N isometrically embeds all finite graphs. Y1 - 2005 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/288 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-2884 ER -