Infinite Limits of Copying Models of the Web Graph

DOI10.1080/15427951.2004.10129087MaRDI QIDQ4665448zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, Jeannette Janssen

Publication date 11 April 2005

Published in Internet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

adjacency propertiesfractal property of a graphinfinite random graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Infinite limits and adjacency properties of a generalized copying model
• Infinite Locally Random Graphs
• scientific article; zbMATH DE number 5763190
• A general model of web graphs
• Growing Protean Graphs

Cited in

(12)

• An explicit construction of \((3,t)\)-existentially closed graphs
• Isomorphism and embedding problems for infinite limits of scale-free graphs
• Bounded expansion in web graphs.
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• Then-ordered graphs: A new graph class
• scientific article; zbMATH DE number 1452973 (Why is no real title available?)
• Infinite Locally Random Graphs
• Robustness of Preferential Attachment Under Deletion of Edges
• A Spatial Web Graph Model with Local Influence Regions
• Protean Graphs with a Variety of Ranking Schemes
• Infinite limits and adjacency properties of a generalized copying model
• The diameter of protean graphs

This page was built for publication: Infinite Limits of Copying Models of the Web Graph

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