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

DOI10.1142/S0218127417502157MaRDI QIDQ3132937zbMATH OpenOpenAlexFDO

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

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)

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?

Cites work

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

Cited in

(1)

• Graph traversal and graph transformation

Describes a project that uses

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)