How β-skeletons lose their edges

Andrew Adamatzky
2014 Information Sciences  
23 A b-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued 24 parameter b. Two nodes in a b-skeleton are connected by an edge if their lune-based neigh-25 bourhood contains no other nodes. With increase of b some edges a skeleton are disappear. 26 We study how a number of edges in b-skeleton depends on b. We speculate how this 27 dependence can be used to discriminate between random and non-random planar sets. 28 We also analyse stability of b-skeletons and their sensitivity to perturbations. 29
doi:10.1016/j.ins.2013.07.022 fatcat:utzane446vantm7bwksjarjs3y