Isotropic random geometric networks in two dimensions with a penetrable cavity

DOI10.1016/j.physa.2021.126297OpenAlexW3193130686MaRDI QIDQ2667647

Ankur Sensharma, Dipa Saha, Bishnu Bhowmik, Sayantan Mitra

Publication date: 1 March 2022

Published in: Physica A (Search for Journal in Brave)

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

zbMATH Keywords

modelingrandom geometric graphcomplex networkclustering coefficientaverage degree of a nodeisotropic random geometric graph

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (1)

Critically spanning epidemic outbreak cluster in random geometric networks

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Connectivity of soft random geometric graphs over annuli
• Full connectivity: corners, edges and faces
• The longest edge of the random minimal spanning tree
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Understanding spatial connectivity of individuals with non-uniform population density
• Topological structure of dictionary graphs
• Random Plane Networks
• Random Geometric Graphs
• Directed random geometric graphs
• Collective dynamics of ‘small-world’ networks
• On random points in the unit disk

This page was built for publication: Isotropic random geometric networks in two dimensions with a penetrable cavity