Absence of percolation in graphs based on stationary point processes with degrees bounded by two (Q6077057)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Absence of percolation in graphs based on stationary point processes with degrees bounded by two |
scientific article; zbMATH DE number 7751496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Absence of percolation in graphs based on stationary point processes with degrees bounded by two |
scientific article; zbMATH DE number 7751496 |
Statements
Absence of percolation in graphs based on stationary point processes with degrees bounded by two (English)
0 references
17 October 2023
0 references
bidirectional \(k\)-nearest neighbor graph
0 references
continuum percolation
0 references
degree bounds
0 references
deletion-tolerance
0 references
stationary point processes
0 references
0 references
