Developing proximity graphs by physarum polycephalum: Does the plasmodium follow the toussaint hierarchy?

Adamatzky, Andrew

Abstract

Plasmodium of Physarum polycephalum spans sources of nutrients and constructs varieties of protoplasmic networks during its foraging behavior. When the plasmodium is placed on a substrate populated with sources of nutrients, it spans the sources with protoplasmic network. The plasmodium optimizes the network to deliver efficiently the nutrients to all parts of its body. How exactly does the protoplasmic network unfold during the plasmodium's foraging behavior? What types of proximity graphs are approximated by the network? Does the plasmodium construct a minimal spanning tree first and then add additional protoplasmic veins to increase reliability and through-capacity of the network? We analyze a possibility that the plasmodium constructs a series of proximity graphs: nearest-neighbour graph (NNG), minimum spanning tree (MST), relative neighborhood graph (RNG), Gabriel graph (GG) and Delaunay triangulation (DT). The graphs can be arranged in the inclusion hierarchy (Toussaint hierarchy): NNG⊆MST⊆RNG⊆GG⊆DT. We aim to verify if graphs, where nodes are sources of nutrients and edges are protoplasmic tubes, appear in the development of the plasmodium in the order NNG→MST→RNG→GG→ DT, corresponding to inclusion of the proximity graphs. © 2009 World Scientific Publishing Company.

• Journal Article Type: Article
• Publication Date: Mar 1, 2009
• Journal: Parallel Processing Letters
• Print ISSN: 0129-6264
• Electronic ISSN: 1793-642X
• Publisher: World Scientific Publishing
• Peer Reviewed: Peer Reviewed
• Volume: 19
• Issue: 1
• Pages: 105-127
• DOI: https://doi.org/10.1142/S0129626409000109
• Keywords: proximity graphs, Physarum polycephalum, toussaint, plasmodium, parallel computing, natural computation
• Public URL: https://uwe-repository.worktribe.com/output/997983
• Publisher URL: http://dx.doi.org/10.1142/S0129626409000109