Andrew Adamatzky Andrew.Adamatzky@uwe.ac.uk
Professor
How b-skeletons lose their edges
Adamatzky, Andrew
Authors
Abstract
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.
Citation
Adamatzky, A. (2014). How b-skeletons lose their edges. Information Sciences, 254, 213-224. https://doi.org/10.1016/j.ins.2013.07.022
Journal Article Type | Article |
---|---|
Publication Date | Jan 1, 2014 |
Journal | Information Sciences |
Print ISSN | 0020-0255 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 254 |
Pages | 213-224 |
DOI | https://doi.org/10.1016/j.ins.2013.07.022 |
Keywords | proximity graph, ?-skeletons, pattern formation, discrimination |
Public URL | https://uwe-repository.worktribe.com/output/822670 |
Publisher URL | http://dx.doi.org/10.1016/j.ins.2013.07.022 |
You might also like
Modelling microbial fuel cells using Lattice Boltzmann methods
(2018)
Journal Article
A parallel modular biomimetic cilia sorting platform
(2018)
Journal Article
Slime mould: The fundamental mechanisms of biological cognition
(2018)
Journal Article