Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics - Archive ouverte HAL Access content directly
Journal Articles International journal of bifurcation and chaos in applied sciences and engineering Year : 2017

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Abstract

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graph. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and non-resource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.
Fichier principal
Vignette du fichier
main.pdf (8.71 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01695674 , version 1 (04-01-2019)

Identifiers

Cite

Boonyarit Changaival, Martin Rosalie, Grégoire Danoy, Kittichai Lavangnananda, Pascal Bouvry. Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics. International journal of bifurcation and chaos in applied sciences and engineering , 2017, 27 (14), pp.1750215. ⟨10.1142/S0218127417502157⟩. ⟨hal-01695674⟩

Collections

INSMI TDS-MACS
41 View
54 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More