Deterministic walk on Poisson point process

DOI10.1051/PROC/201760266zbMATH Open1388.82013OpenAlexW2775140899MaRDI QIDQ4606441FDOQ4606441

Authors: Simon Le Stum 

Publication date: 7 March 2018

Published in: ESAIM: Proceedings and Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/proc/201760266

Recommendations

• Absence of percolation for Poisson outdegree-one graphs
• The greedy walk on an inhomogeneous Poisson process
• Poisson trees, succession lines and coalescing random walks
• scientific article; zbMATH DE number 1270372
• Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)

zbMATH Keywords

graphPoisson point process

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43) Stochastic processes (60G99)

Cites Work

• Domination by product measures
• Nearest neighbor and hard sphere models in continuum percolation
• The 2D-directed spanning forest is almost surely a tree
• Absence of percolation for Poisson outdegree-one graphs
• On the absence of percolation in a line-segment based lilypond model

Cited In (4)

• The greedy walk on an inhomogeneous Poisson process
• Absence of percolation for Poisson outdegree-one graphs
• Absence of percolation in graphs based on stationary point processes with degrees bounded by two
• Poisson approximation for non-backtracking random walks

This page was built for publication: Deterministic walk on Poisson point process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606441)