Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics

DOI10.1142/S0218127417502157zbMATH Open1382.68162OpenAlexW2786956989MaRDI QIDQ3132937FDOQ3132937

Authors: Boonyarit Changaival, Martin Rosalie, Grégoire Danoy, Kittichai Lavangnananda, Pascal Bouvry 

Publication date: 31 January 2018

Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127417502157

Recommendations

• Graph traversal and graph transformation
• scientific article; zbMATH DE number 1982181
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Memory Efficient Anonymous Graph Exploration
• Traversing graphs in a paging environment, BFS or DFS?

zbMATH Keywords

random walkchaotic dynamicsbifurcation diagramgraph traversal

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81)

Cites Work

• Mersenne twister
• Large networks and graph limits
• Title not available (Why is that?)
• Deterministic Nonperiodic Flow
• Collective dynamics of `small-world' networks
• An equation for continuous chaos
• Firefly algorithm with chaos
• Improved particle swarm optimization combined with chaos
• Graph exploration by a finite automaton
• Random walks on weighted graphs and applications to on-line algorithms
• YET ANOTHER CHAOTIC ATTRACTOR
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Use of Ranks in One-Criterion Variance Analysis
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• Constructing competitive tours from local information
• Title not available (Why is that?)
• Exploring Unknown Environments
• Setting port numbers for fast graph exploration
• Coverage for robotics -- a survey of recent results
• An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• An optimization method inspired by ``chaotic ant behavior
• A universal circuit for studying and generating chaos. II. Strange attractors
• Dynamics of a Hénon-Lozi-type map
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Bifurcations in the Lozi map
• Fast chaotic optimization algorithm based on locally averaged strategy and multifold chaotic attractor
• Chaos-enhanced accelerated particle swarm optimization
• Exploring Unknown Undirected Graphs
• Vertex-ant-walk -- a robust method for efficient exploration of faulty graphs
• On a simple depth-first search strategy for exploring unknown graphs
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Templates and subtemplates of Rössler attractors from a bifurcation diagram
• Toward a general procedure for extracting templates from chaotic attractors bounded by high genus torus
• Emergence of randomness from chaos
• Non-strange chaotic attractors equivalent to their templates

Cited In (1)

• Graph traversal and graph transformation

Uses Software

• NetworkX
• MersenneTwister

This page was built for publication: Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132937)