Random walk on the random connection model

DOI10.1016/J.INDAG.2022.05.002MaRDI QIDQ2166107zbMATH OpenOpenAlexFDO

Authors Ercan Sönmez, Arnaud Rousselle

Publication date 23 August 2022

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Poisson processpercolationrandom graphsrecurrencetransiencerandom walk in random environmentrandom connection modellong-range percolation

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y{|}^{-alpha}$ with $alpha>d$, where $d$ denotes the dimension of the underlying Euclidean space. More precisely, focus is on the random connection model in which the vertex set is given by the realization of a homogeneous Poisson point process. We show that this random graph exhibits the same properties as classical discrete long-range percolation models studied in [3] with regard to recurrence and transience of the random walk. The recurrence results are valid for every intensity of the Poisson point process while the transience results hold for large enough intensity. Moreover, we address a question which is related to a conjecture in [16] for this graph.

Recommendations

• Transience, recurrence and critical behavior for long-range percolation
• Random walk on the infinite cluster of the percolation model
• scientific article; zbMATH DE number 1270372
• Simple random walk on long-range percolation clusters. II: Scaling limits
• Recurrence versus transience for weight-dependent random connection models

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3452925 (Why is no real title available?)
• A simple criterion for transience of a reversible Markov chain
• Clump counts in a mosaic
• Connectivity of soft random geometric graphs
• Continuum Percolation
• Graph distances of continuum long-range percolation
• Invariance principle for Mott variable range hopping and other walks on point processes
• Long range percolation in stationary point processes
• On a continuum percolation model
• On continuum percolation
• Paths in graphs
• Probability on trees and networks
• Random graphs and complex networks. Volume 1
• Random walk on the infinite cluster of the percolation model
• Recurrence and transience for long-range reversible random walks on a random point process
• Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
• Recurrence versus transience for weight-dependent random connection models
• Rough isometries and the parabolicity of Riemannian manifolds
• Scale-free percolation in continuum space
• Structures in supercritical scale-free percolation
• The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
• The random connection model: Connectivity, edge lengths, and degree distributions
• Transience, recurrence and critical behavior for long-range percolation

Cited in

(7)

• Random walk with long-range constraints
• Recurrence versus transience for weight-dependent random connection models
• Recurrence and transience for long-range reversible random walks on a random point process
• The longest edge in discrete and continuous long-range percolation
• Transience, recurrence and critical behavior for long-range percolation
• Recurrence and transience of symmetric random walks with long-range jumps
• Disconnection, random walks, and random interlacements

This page was built for publication: Random walk on the random connection model

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