.

Authors

  • Takechi Sato Departamento de Psicologia Experimental. Instituto de Psicologia - Universidade de São Paulo

DOI:

https://doi.org/10.5007/%25x

Abstract

Shortest-distance ditree, a tree-search procedure of graph theory, can be employed as a method of representing the organization of behavioural sequences. The tree-like diagram clearly shows association and embeddedness relationships between behaviour events, a feature not easily found in the behavioural transition "sociograms" largely employed in ethological studies. Shortest-distance ditree can be analysed by the graph-theoretical concept of maximal connected subgraphs. The number of such subgraphs is related to the degree of organization of behavior. The author proposes an information-theory index, normalized and ranging from zero to one, to measure the degree of organization. The method is exemplified by the analysis of sequences of grooming behaviour of Musca domestica.

Author Biography

Takechi Sato, Departamento de Psicologia Experimental. Instituto de Psicologia - Universidade de São Paulo

Possui Graduação pela Universidade de São Paulo, Mestrado pela Universidade de São Paulo e Doutorado pela Universidade de São Paulo. Atualmente é da Universidade de São Paulo, da Universidade de São Paulo e da Universidade de São Paulo.

Mais informações no Currículo Lattes.

Downloads

Published

1991-01-01

Issue

Vol. 4 No. 2 (1991)

Section

Artigos

License

After the electronic publication of the manuscript, the authors are entitled, without any restriction, on its contents.

License Creative Commons Atribuição 4.0 Internacional - CC BY

 Licença Creative Commons

Authors are able to take on additional contracts separately, non-exclusive distribution of the version of the paper published in this journal (ex.: publish in institutional repository or as a book), with an acknowledgment of its initial publication in this journal.