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 the normal view instead:
scientific article; zbMATH DE number 7751496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.91059434
0 references
0.8922732
0 references
0.8899055
0 references
0 references
0.8798619
0 references
0.8798619
0 references
0.87755114
0 references
0.8775405
0 references
0.87620866
0 references
