Pages that link to "Item:Q988583"
From MaRDI portal
The following pages link to Thresholding random geometric graph properties motivated by ad hoc sensor networks (Q988583):
Displaying 8 items.
- Concentration for Poisson functionals: component counts in random geometric graphs (Q265636) (← links)
- The coverage holes of the largest component of random geometric graph (Q277050) (← links)
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs (Q1615893) (← links)
- Connectivity threshold of Bluetooth graphs (Q2874082) (← links)
- The bin-covering technique for thresholding random geometric graph properties (Q2921769) (← links)
- Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks (Q3547993) (← links)
- Automata, Languages and Programming (Q5716818) (← links)