Transience Versus Recurrence for Scale-Free Spatial Networks

DOI10.1007/978-3-030-48478-1_7OpenAlexW3033017533MaRDI QIDQ5041779

Markus Heydenreich, Peter Mörters, Christian Mönch, Peter Gracar

Publication date: 14 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48478-1_7

zbMATH Keywords

recurrencetransienceBoolean modelpreferential attachmentscale-free percolationrandom-connection model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (1)

Phase transitions and percolation at criticality in enhanced random connection models

Cites Work

• Unnamed Item
• Connectivity of soft random geometric graphs
• Scale-free percolation
• From heavy-tailed Boolean models to scale-free Gilbert graphs
• On continuum percolation
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
• Uniqueness of unbounded occupied and vacant components in Boolean models
• The random connection model in high dimensions
• Transience, recurrence and critical behavior for long-range percolation
• Structures in supercritical scale-free percolation
• Geometric inhomogeneous random graphs
• Robustness of scale-free spatial networks
• Recurrence versus transience for weight-dependent random connection models
• The age-dependent random connection model
• Scale-free percolation in continuum space
• Spatial preferential attachment networks: power laws and clustering coefficients
• A Spatial Web Graph Model with Local Influence Regions
• Random Geometric Graphs
• Continuum Percolation
• Percolation phase transition in weight-dependent random connection models
• On the Ornstein–Zernike equation for stationary cluster processes and the random connection model
• Lectures on the Poisson Process
• Ultra-small scale-free geometric networks

This page was built for publication: Transience Versus Recurrence for Scale-Free Spatial Networks