scientific article; zbMATH DE number 6783404
From MaRDI portal
Publication:5365052
Recommendations
- Mobile geometric graphs: detection, coverage and percolation
- Covering algorithms, continuum percolation and the geometry of wireless networks
- Space-time percolation and detection by mobile nodes
- The coverage of the largest component in random geometric graphs with applications in sensor networks
- Geometric Problems on Coverage in Sensor Networks
- A percolation model of mobile ad-hoc networks
- Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks
Cited in
(15)- How can a clairvoyant particle escape the exclusion process?
- Mobile geometric graphs: detection, coverage and percolation
- Local survival of spread of infection among biased random walks
- Percolation and connection times in multi-scale dynamic networks
- Spread of an infection on the zero range process
- Faster rumor spreading with multiple calls
- Symmetric rearrangements around infinity with applications to Lévy processes
- The coverage holes of the largest component of random geometric graph
- Theory and practice of discrete interacting agents models
- Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
- Information dissemination via random walks in d-dimensional space
- Connection times in large ad-hoc mobile networks
- Parsimonious flooding in geometric random-walks
- Space-time percolation and detection by mobile nodes
- Annealed asymptotics for Brownian motion of renormalized potential in mobile random medium
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365052)
