Giant component of the soft random geometric graph
From MaRDI portal
Recommendations
- Size of the giant component in a random geometric graph
- The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
- Connectivity of soft random geometric graphs
- On the first and second largest components in the percolated random geometric graph
- Random Geometric Graphs
Cites work
- Absence of infinite cluster for critical Bernoulli percolation on slabs
- Connectivity of soft random geometric graphs
- Continuum Percolation
- Continuum percolation and Euclidean minimal spanning trees in high dimensions
- Domination by product measures
- Lectures on the Poisson Process
- Random Geometric Graphs
- The random connection model in high dimensions
Cited in
(8)- The longest edge of the one-dimensional soft random geometric graph with boundaries
- Cluster-size decay in supercritical long-range percolation
- On the first and second largest components in the percolated random geometric graph
- scientific article; zbMATH DE number 7651057 (Why is no real title available?)
- Size of the giant component in a random geometric graph
- Giant component of the soft random geometric graph
- The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
- On the distances within cliques in a soft random geometric graph
This page was built for publication: Giant component of the soft random geometric graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2090745)