Recurrence or transience of random walks on random graphs generated by point processes in
arXiv:1305.4878
Abstract
We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in . Under suitable assumptions on point processes and conductances, we show that, for almost any realization of the point process, these random walks are recurrent if and transient if . These results hold for a large variety of point processes including Poisson point processes, Mat{é}rn cluster and Mat{é}rn hardcore processes which have clustering or repulsive properties. In order to prove them, we state general criteria for recurrence or almost sure transience which apply to random graphs embedded in .
arXiv commentTo appear in Stochastic Processes and their Applications
References in corpus (8)
- Determinantal Processes and Independence
- Quenched invariance principle for simple random walk on percolation clusters
- Random walks on supercritical percolation clusters
- Recent progress on the Random Conductance Model
- Finding Galaxy Clusters using Voronoi Tessellations
- Quenched invariance principles for random walks with random conductances
- Conditional Intensity and Gibbsianness of Determinantal Point Processes
- A global descriptor of spatial pattern interaction in the galaxy distribution