Size of the giant component in a random geometric graph
From MaRDI portal
(Redirected from Publication:376695)
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
Cites work
Cited in
(18)- Bridged Hamiltonian cycles in sub-critical random geometric graphs
- 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
- Stretch and diameter in random geometric graphs
- scientific article; zbMATH DE number 7651057 (Why is no real title available?)
- Giant component of the soft random geometric graph
- The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications
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)