Infinite Limits and Adjacency Properties of a Generalized Copying Model

DOI10.1080/15427951.2007.10129292zbMATH Open1230.60015OpenAlexW1966840235MaRDI QIDQ5892547FDOQ5892547

Jeannette Janssen, Anthony Bonato

Publication date: 21 June 2011

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2007.10129292

zbMATH Keywords

limit behaviourself-organizing networksadjacency propertiesWorld Wide Web graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Network design and communication in computer systems (68M10)

Cited In (3)

• Generating Infinite Random Graphs
• Preferential attachment processes approaching the Rado multigraph
• Infinite random geometric graphs

This page was built for publication: Infinite Limits and Adjacency Properties of a Generalized Copying Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892547)