Size of the giant component in a random geometric graph

DOI10.1214/12-AIHP498zbMATH Open1283.60017MaRDI QIDQ376695FDOQ376695

Authors: 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

Recommendations

• Giant component of the soft random geometric graph
• The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications
• Random Geometric Graphs
• On the first and second largest components in the percolated random geometric graph
• Stretch and diameter in random geometric graphs

zbMATH Keywords

number of componentsgraph diameterrandom geometric graphsize of giant component

Mathematics Subject Classification ID

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

Cites Work

• Random Geometric Graphs
• Percolation
• Title not available (Why is that?)
• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
• The bin-covering technique for thresholding random geometric graph properties

Cited In (18)

• Topology of random geometric complexes: a survey
• The expected size of some graphs in computational geometry
• Giant Component and Connectivity in Geographical Threshold Graphs
• Some properties for the largest component of random geometric graphs with applications in sensor networks
• Infection spread in random geometric graphs
• Dynamic geometric graph processes: Adjacency operator approach
• Giant components in random graphs
• Random Geometric Graphs
• Threshold for the outbreak of cascading failures in degree-degree uncorrelated networks
• The size of the largest hole in a random graph
• Rumors spread slowly in a small-world spatial network
• Some introductory notes on random graphs
• On the first and second largest components in the percolated random geometric graph
• Title not available (Why is that?)
• Stretch and diameter in random geometric graphs
• The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications
• Giant component of the soft random geometric graph
• Bridged Hamiltonian cycles in sub-critical random geometric graphs

This page was built for publication: Size of the giant component in a random geometric graph

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