Sunflower hard disk graphs

Carl P. Dettmann and Orestis Georgiou

Physica A: Statistical Mechanics and its Applications, 2023, vol. 629, issue C

Abstract: The random geometric graph consists of a random point set with links between points with mutual distance below a fixed threshold. Here, we use the same geometric connection rule (“hard disk graph”) but for a deterministic point set, the sunflower spiral. At large distances, the local structure is asymptotically a lattice where for each lattice vector, there is another of length a factor 5 greater, and the angle between these varies log-periodically with distance from the origin. Graph properties including node degrees, stretch factor, clique and chromatic numbers are considered, as well as link formation, connectivity and planarity transitions. Properties depend on a combination of the central region and the perturbed distant lattices, in a rich and varied manner.

Keywords: Hard disk graphs; Network structure; Spatial networks; Sunflower spiral (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437123007355
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:629:y:2023:i:c:s0378437123007355

DOI: 10.1016/j.physa.2023.129180

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().