Giant Component and Connectivity in Geographical Threshold Graphs

DOI10.1007/978-3-540-77004-6_18zbMATH Open1136.05318OpenAlexW2113701578MaRDI QIDQ5458315FDOQ5458315

Authors: Milan Bradonjić, Aric Hagberg, Allon G. Percus 

Publication date: 11 April 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_18

Recommendations

• The structure of geographical threshold graphs
• Size of the giant component in a random geometric graph
• Gigantic and small components in random distance graphs of special form
• The random connection model: Connectivity, edge lengths, and degree distributions
• Random Geometric Graphs

zbMATH Keywords

random graphconnectivitygiant componentgeographical threshold graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Network design and communication in computer systems (68M10)

Cited In (9)

• On the mixing time of geographical threshold graphs
• A random graph model for massive graphs
• Statistical properties of a generalized threshold network model
• Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model
• The structure of geographical threshold graphs
• The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
• Gigantic component in random distance graphs of special form
• Gigantic and small components in random distance graphs of special form
• Some introductory notes on random graphs

This page was built for publication: Giant Component and Connectivity in Geographical Threshold Graphs

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