Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Journal article
Authors/Editors
Strategic Research Themes
No matching items found.
Publication Details
Author list: Changaival B., Rosalie M., Danoy G., Lavangnananda K., Bouvry P.
Publisher: World Scientific Publishing
Publication year: 2017
Journal: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (0218-1274)
Volume number: 27
Issue number: 14
ISSN: 0218-1274
eISSN: 1793-6551
Languages: English-Great Britain (EN-GB)
View in Web of Science | View on publisher site | View citing articles in Web of Science
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 graphs. 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 nonresource 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. ฉ 2017 World Scientific Publishing Company.
Keywords
Bifurcation diagram, chaotic dynamics, graph traversal, random walk
Contact Information