Mobile geometric graphs: detection, coverage and percolation
From MaRDI portal
random graphBrownian motioncouplingBoolean modelpercolationPoisson point processWiener sausageMinkowski dimensionmobile ad hoc network
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Brownian motion (60J65) Dynamic continuum models (systems of particles, etc.) in time-dependent statistical mechanics (82C21) Time-dependent percolation in statistical mechanics (82C43)
Abstract: We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes if their distance is at most r. We study three features in this model: detection (the time until a target point---fixed or moving---is within distance r from some node of the graph), coverage (the time until all points inside a finite box are detected by the graph), and percolation (the time until a given node belongs to the infinite connected component of the graph). We obtain precise asymptotics for these features by combining ideas from stochastic geometry, coupling and multi-scale analysis.
Recommendations
- scientific article; zbMATH DE number 6783404
- 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
Cites work
- scientific article; zbMATH DE number 1254188 (Why is no real title available?)
- scientific article; zbMATH DE number 1340281 (Why is no real title available?)
- scientific article; zbMATH DE number 739280 (Why is no real title available?)
- scientific article; zbMATH DE number 786469 (Why is no real title available?)
- Brownian motion. With an appendix by Oded Schramm and Wendelin Werner
- Continuum Percolation
- Dynamic Boolean models
- Electrostatic capacity, heat flow, and brownian motion
- First Passage times and Sojourn Times for Brownian Motion in Space and the Exact Hausdorff Measure of the Sample Path
- Information dissemination via random walks in \(d\)-dimensional space
- Large deviations for discrete and continuous percolation
- MANETS: High Mobility Can Make Up for Low Transmission Power
- Random Geometric Graphs
- Stochastic theory of diffusion-controlled reactions
- Survival probability of a random walk among a Poisson system of moving traps
- The capacity of wireless networks
- The longest edge of the random minimal spanning tree
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The spread of a rumor or infection in a moving population
Cited in
(22)- scientific article; zbMATH DE number 6783404 (Why is no real title available?)
- An isoperimetric inequality for the Wiener sausage
- Viral processes by random walks on random regular graphs
- Soft local times and decoupling of random interlacements
- Random walks in random conductances: decoupling and spread of infection
- Connection times in large ad-hoc mobile networks
- Percolation and connection times in multi-scale dynamic networks
- Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents
- Brownian snails with removal: epidemics in diffusing populations
- Fast flooding over Manhattan
- Subdiffusivity of a random walk among a Poisson system of moving traps on Z
- Phase transition for finite-speed detection among moving particles
- Viral processes by random walks on random regular graphs
- Random mass splitting and a quenched invariance principle
- Brownian paths homogeneously distributed in space: percolation phase transition and uniqueness of the unbounded cluster
- Perturbing the hexagonal circle packing: a percolation perspective
- Random Walk Among Mobile/Immobile Traps: A Short Review
- Multi-scale Lipschitz percolation of increasing events for Poisson random walks
- Upper bound on saturation time of metric graphs by intervals moving on them
- Subdiffusivity of Brownian motion among a Poissonian field of moving traps
- Space-time percolation and detection by mobile nodes
- Parsimonious flooding in geometric random-walks (extended abstract)
This page was built for publication: Mobile geometric graphs: detection, coverage and percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955843)
