Article (Scientific journals)
Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire et al.
2017In International Journal of Bifurcation and Chaos, 27 (14), p. 1750215
Peer reviewed
 

Files


Full Text
main-1.pdf
Author preprint (9.14 MB)
Request a copy

Preprint of an article published in [Int J Bifurcation Chaos Appl Sci Eng, 27, 14, 2017, 1750215] [10.1142/S0218127417502157] © [copyright World Scientific Publishing Company] [http://www.worldscientific.com/worldscinet/ijbc]


All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Bifurcation diagram; chaotic dynamics; graph traversal; random walk
Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
Changaival, Boonyarit ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Rosalie, Martin ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Danoy, Grégoire  ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Lavangnananda, Kittichai;  King Mongkut’s University of Technology Thonburi (Bangkok) > School of information and Technology (SIT)
Bouvry, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Language :
English
Title :
Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Publication date :
30 December 2017
Journal title :
International Journal of Bifurcation and Chaos
ISSN :
0218-1274
eISSN :
1793-6551
Publisher :
World Scientific Pub Co Pte Lt, Singapore, Singapore
Volume :
27
Issue :
14
Pages :
1750215
Peer reviewed :
Peer reviewed
Focus Area :
Computational Sciences
Available on ORBilu :
since 29 January 2018

Statistics


Number of views
191 (34 by Unilu)
Number of downloads
1 (1 by Unilu)

Scopus citations®
 
2
Scopus citations®
without self-citations
1
WoS citations
 
2

Bibliography


Similar publications



Contact ORBilu