Size of the giant component in a random geometric graph

DOI10.1214/12-AIHP498zbMath1283.60017MaRDI QIDQ376695

Ghurumuruhan Ganesan

Publication date: 19 November 2013

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aihp/1380718740

zbMATH Keywords

random geometric graphgraph diameternumber of componentssize of giant component

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Topology of random geometric complexes: a survey, Some Introductory Notes on Random Graphs, Threshold for the outbreak of cascading failures in degree-degree uncorrelated networks, Rumors Spread Slowly in a Small-World Spatial Network, Bridged Hamiltonian cycles in sub-critical random geometric graphs, Stretch and diameter in random geometric graphs, Infection Spread in Random Geometric Graphs

Cites Work

• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
• Percolation
• Random Geometric Graphs
• Unnamed Item
• Unnamed Item