Using Sequences of Knots as a Random Search

  • C. A. Pina-Garcia
  • Dongbing Gu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6856)


Fink and Mao define a knot as “a sequence of moves creating an aesthetic structure or topology, where its properties are preserved under continuous deformations” [1]. Thus, it is possible to emulate a random search behavior [5], using a set of steps that represents a knot. However, a single knot is not enough to cover a specific area, due to this lack of coverage, we suggest link several knots in order to increase the searching scope.


  1. 1.
    Fink, T., Mao, Y.: Tie knots, random walks and topology. Physica A 276, 109–121 (2000)CrossRefGoogle Scholar
  2. 2.
    Livingston, C.: Knot theory. The Mathematical Association of America (1993)Google Scholar
  3. 3.
    Fink, T.M., Mao, Y.: Designing Tie Knots by Random Walks. Nature 398, 31 (1999)CrossRefGoogle Scholar
  4. 4.
    Wilensky, U.: Netlogo, center for connected learning and computer-based modeling (1999),
  5. 5.
    Berg, H.C.: Random walks in biology. Princeton University Press, Princeton (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • C. A. Pina-Garcia
    • 1
  • Dongbing Gu
    • 1
  1. 1.School of Computer Science and Electronic EngineeringUniversity of EssexColchesterUK

Personalised recommendations