Pages that link to "Item:Q4361795"
From MaRDI portal
The following pages link to The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]<sup><i>d</i></sup> (Q4361795):
Displayed 8 items.
- Vertex degree of random geometric graph on exponentially distributed points (Q731943) (← links)
- Thresholding random geometric graph properties motivated by ad hoc sensor networks (Q988583) (← links)
- Central limit theorems for \(k\)-nearest neighbour distances (Q1613596) (← links)
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). (Q1871346) (← links)
- Topological properties of random wireless networks (Q2371220) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- On covering by translates of a set (Q3068760) (← links)
- (Q4969037) (← links)