Recurrence or transience of random walks on random graphs generated by point processes in R^d

DOI10.1016/J.SPA.2015.06.002zbMATH Open1325.60165arXiv1305.4878OpenAlexW1491795945MaRDI QIDQ744968FDOQ744968

Authors: Arnaud Rousselle 

Publication date: 12 October 2015

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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 $mathbb{R}^d$. 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 $d=2$ and transient if $dgeq3$. These results hold for a large variety of point processes including Poisson point processes, Mat{'e}rn cluster and Mat{'e}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 $mathbb{R}^d$.

Full work available at URL: https://arxiv.org/abs/1305.4878

Recommendations

• Annealed invariance principle for random walks on random graphs generated by point processes in $\mathbb{R}^d$
• Recurrence and transience for long-range reversible random walks on a random point process
• Quenched invariance principle for random walks on Delaunay triangulations
• On the recurrence of simple random walks on some fractals
• Exceptional graphs for the random walk

zbMATH Keywords

random walkpoint processDelaunay triangulationrandom graphsrecurrencetransienceelectrical networkGabriel graphVoronoi tessellation

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81) Processes in random environments (60K37)

Cites Work

• Recurrence of distributional limits of finite planar graphs
• Stochastic geometry and its applications
• Spatial variation. 2nd ed
• The coincidence approach to stochastic point processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotics for Euclidean minimal spanning trees on random points
• Stochastic and Integral Geometry
• Statistical Ensembles of Complex, Quaternion, and Real Matrices
• Rough isometries and the parabolicity of Riemannian manifolds
• Random point fields associated with certain Fredholm determinants. I: Fermion, Poisson and Boson point processes.
• Random walks on supercritical percolation clusters
• Recurrence of planar graph limits
• Quenched invariance principles for random walks with random conductances
• Determinantal random point fields
• Title not available (Why is that?)
• Recent progress on the random conductance model
• Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
• Quenched invariance principles for random walks on percolation clusters
• Quenched invariance principle for simple random walk on percolation clusters
• Domination by product measures
• Random point fields associated with certain Fredholm determinants. II: Fermion shifts and their ergodic and Gibbs properties
• Stochastic geometry and wireless networks. Volume I. Theory
• Determinantal processes and independence
• Lectures on random Voronoi tessellations
• Continuum percolation in the Gabriel graph
• Diffusivity in one-dimensional generalized Mott variable-range hopping models
• Recurrence and transience for long-range reversible random walks on a random point process
• Title not available (Why is that?)
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Conditional intensity and Gibbsianness of determinantal point processes
• Mott law as upper bound for a random walk in a random environment
• Mott law as lower bound for a random walk in a random environment
• Invariance principle for Mott variable range hopping and other walks on point processes
• Nearest neighbor and hard sphere models in continuum percolation
• Harmonic deformation of Delaunay triangulations
• Greedy polyominoes and first-passage times on random Voronoi tilings
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching
• Random walk on the infinite cluster of the percolation model
• Title not available (Why is that?)
• Point processes in general position
• Estimates for distributions of the Voronoi polygon's geometric characteristics
• Connectivity of random geometric graphs related to minimal spanning forests

Cited In (10)

• First passage percolation on random geometric graphs and an application to shortest-path trees
• Random walk on the random connection model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Large fluctuations and transport properties of the Lévy-Lorentz gas
• Recurrence and transience for long-range reversible random walks on a random point process
• Stochastic geometry: Boolean model and random geometric graphs
• Random walks in a one-dimensional Lévy random environment
• Coalescing random walk on unimodular graphs
• Annealed invariance principle for random walks on random graphs generated by point processes in $\mathbb{R}^d$

This page was built for publication: Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)

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