Limiting shape for first-passage percolation models on random geometric graphs
From MaRDI portal
Abstract: Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed random variables on the random infinite connected component. We provide sufficient conditions for the existence of the asymptotic shape and we show that the shape is an Euclidean ball. We give some examples exhibiting the result for Bernoulli percolation and the Richardson model. For the Richardson model we further show that it converges weakly to a nonstandard branching process in the joint limit of large intensities and slow passage times.
Recommendations
- First passage percolation on random geometric graphs and an application to shortest-path trees
- Asymptotic shape for the chemical distance and first-passage percolation on the infinite Bernoulli cluster
- scientific article; zbMATH DE number 2034359
- Euclidean models of first-passage percolation
- Weak shape theorem in first passage percolation with infinite passage times
Cites work
- 50 Years of First-Passage Percolation
- Asymptotic shape in a continuum growth model
- Continuum Percolation
- First passage percolation on random geometric graphs and an application to shortest-path trees
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- scientific article; zbMATH DE number 3463051 (Why is no real title available?)
- scientific article; zbMATH DE number 3231627 (Why is no real title available?)
- scientific article; zbMATH DE number 3290003 (Why is no real title available?)
- Large deviations for discrete and continuous percolation
- Large deviations for the graph distance in supercritical continuum percolation
- On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
- Percolation by cumulative merging and phase transition for the contact process on random graphs
- Probabilistic methods in telecommunications
- Random Geometric Graphs
Cited in
(3)
This page was built for publication: Limiting shape for first-passage percolation models on random geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148881)