A b-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter b. Two nodes in a b-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of b some edges a skeleton are disappear. We study how a number of edges in b-skeleton depends on b. We speculate how this dependence can be used to discriminate between random and non-random planar sets. We also analyse stability of b-skeletons and their sensitivity to perturbations. © 2013 Elsevier Inc. All rights reserved.
Adamatzky, A. (2014). How b-skeletons lose their edges. Information Sciences, 254, 213-224. https://doi.org/10.1016/j.ins.2013.07.022