Transience versus recurrence for scale-free spatial networks

DOI10.1007/978-3-030-48478-1_7MaRDI QIDQ5041779zbMATH OpenOpenAlexFDO

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

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

Boolean modelpreferential attachmentrandom-connection modelrecurrencescale-free percolationtransience

Mathematics Subject Classification ID

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

Recommendations

• Recurrence versus transience for weight-dependent random connection models
• Percolation phase transition in weight-dependent random connection models
• Random weighted pseudofractal scale-free network
• Robustness of scale-free spatial networks
• The structure of geographical threshold graphs

Cites work

• A spatial web graph model with local influence regions
• Connectivity of soft random geometric graphs
• Continuum Percolation
• From heavy-tailed Boolean models to scale-free Gilbert graphs
• Geometric inhomogeneous random graphs
• scientific article; zbMATH DE number 1418385 (Why is no real title available?)
• Lectures on the Poisson Process
• On continuum percolation
• On the Ornstein-Zernike equation for stationary cluster processes and the random connection model
• Percolation phase transition in weight-dependent random connection models
• Random Geometric Graphs
• Recurrence versus transience for weight-dependent random connection models
• Robustness of scale-free spatial networks
• Scale-free percolation
• Scale-free percolation in continuum space
• Spatial preferential attachment networks: power laws and clustering coefficients
• Structures in supercritical scale-free percolation
• The age-dependent random connection model
• The random connection model in high dimensions
• Transience, recurrence and critical behavior for long-range percolation
• Ultra-small scale-free geometric networks
• 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

Cited in

(2)

• Phase transitions and percolation at criticality in enhanced random connection models
• Recurrence versus transience for weight-dependent random connection models

This page was built for publication: Transience versus recurrence for scale-free spatial networks

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